A test problem generator for non-stationary environments,Branke J的MovingPeak問題
標簽： non-stationary environments MovingPeak generator
上傳時間： 2014-12-20
上傳用戶：秦莞爾w
Problem A:放蘋果 Time Limit:1000MS Memory Limit:65536K Total Submit:1094 Accepted:441 Language: not limited Description 把M個同樣的蘋果放在N個同樣的盤子里，允許有的盤子空著不放，問共有多少種不同的分法？（用K表示）5，1，1和1，5，1 是同一種分法。 Input 第一行是測試數據的數目t（0 <= t <= 20）。以下每行均包含二個整數M和N，以空格分開。1<=M，N<=10。 Output 對輸入的每組數據M和N，用一行輸出相應的K。 Sample Input 1 7 3 Sample Output 8
標簽： Limit Accepted Language Problem
上傳時間： 2016-11-30
上傳用戶：leixinzhuo
ATMEL AT89C51SND1 IDE TO USB READER
上傳時間： 2014-01-30
上傳用戶：tzl1975
Liferea is an abbreviation for Linux Feed Reader. It is a news aggregator for online news feeds. It supports a number of different feed formats including RSS/RDF, CDF and Atom. There are many other news readers available, but these others are not available for Linux or require many extra libraries to be installed. Liferea tries to fill this gap by creating a fast, easy to use, easy to install news aggregator for GTK/GNOME. It was last updated for Liferea version 1.4.
標簽： news abbreviation aggregator for
上傳時間： 2016-12-05
上傳用戶：luopoguixiong
Problem B:Longest Ordered Subsequence A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8).
標簽： Subsequence sequence Problem Longest
上傳時間： 2016-12-08
上傳用戶：busterman
sovling TSP(Travelling Salesman Problem) with GAs
標簽： Travelling Salesman sovling Problem
上傳時間： 2014-01-10
上傳用戶：youmo81
TSP問題（Travelling Salesman Problem）是數學領域中著名問題之一,旅行商的VC算法實現
標簽： Travelling Salesman Problem TSP
上傳時間： 2014-08-02
上傳用戶：hjshhyy
We address the problem of predicting a word from previous words in a sample of text. In particular, we discuss n-gram models based on classes of words. We also discuss several statistical algorithms for assigning words to classes based on the frequency of their co-occurrence with other words. We find that we are able to extract classes that have the flavor of either syntactically based groupings or semantically based groupings, depending on the nature of the underlying statistics.
標簽： predicting particular previous address
上傳時間： 2016-12-26
上傳用戶：xfbs821
RFID中rc500的讀寫程序。Firmware for MFRC500 Demo Serial Reader
標簽： 500 Firmware Serial Reader
上傳時間： 2013-12-18
上傳用戶：waizhang
int main(int argc,char *argv[]) { char ch while(true) { printf("*************************************\n") printf(" 1.Reader Priority\n") printf(" 2.Writer Priority\n") printf(" 3.Exit to Windows\n") printf("*************************************\n") printf("Enter your choice(1,2,3): ") do{ ch=(char)_getch() }while(ch!= 1 &&ch!= 2 &&ch!= 3 ) system("cls") if(ch== 3 ) return 0 else if(ch== 1 ) ReaderPriority("thread.dat") else WriterPriority("thread.dat") printf("\nPress Any Key to Coutinue:") _getch() system("cls") } return 0
上傳時間： 2017-01-06
上傳用戶：gonuiln
