S3C2440-Clock-Power-Management-and-WatchDog-Programming PPT文檔
標簽： Clock-Power-Management-and-WatchD og-Programming 2440
上傳時間： 2016-01-30
上傳用戶：懶龍1988
混沌時間序列預測(chaotic time series prediction)中的Volterra級數一步預測 、Volterra級數多步預測方法
標簽： Volterra prediction chaotic series
上傳時間： 2016-02-03
上傳用戶：asddsd
Time series data mining.
上傳時間： 2014-01-22
上傳用戶：gmh1314
ym12864和time ym12864r的驅動和時鐘顯示
上傳時間： 2013-12-10
上傳用戶：youlongjian0
Traveling Salesman Problem (TSP) has been an interesting problem for a long time in classical optimization techniques which are based on linear and nonlinear programming. TSP can be described as follows: Given a number of cities to visit and their distances from all other cities know, an optimal travel route has to be found so that each city is visited one and only once with the least possible distance traveled. This is a simple problem with handful of cities but becomes complicated as the number increases.
標簽： interesting Traveling classical Salesman
上傳時間： 2016-02-06
上傳用戶：rocwangdp
a good time to end progress bar for MFC
上傳時間： 2016-02-07
上傳用戶：hj_18
this procedure is a game of basketball or subsystems time, the competition will record the entire time, and can amend the Competition time suspended contest time, the two can be set at any time during the competition process of the match, the two teams exchanged scores midfielder position, Competition can end report issued directives
標簽： competition basketball subsystems procedure
上傳時間： 2016-02-14
上傳用戶：cuibaigao
An instrument other than a watch for measuring or indicating time, especially a mechanical or electronic device having a numbered dial and moving hands or a digital display.break down the enemy s resistance
標簽： instrument especially indicating mechanical
上傳時間： 2014-01-11
上傳用戶：二驅蚊器
Orthogonal Time–Frequency Signalin Over Doubly Dispersive Channels，IEEE上的文章
標簽： Orthogonal Dispersive Frequency Channels
上傳時間： 2014-01-22
上傳用戶：xg262122
詞典 Time Limit:3000MS Memory Limit:65536K Total Submit:2349 Accepted:603 Description 你旅游到了一個國外的城市。那里的人們說的外國語言你不能理解。不過幸運的是，你有一本詞典可以幫助你。 Input 首先輸入一個詞典，詞典中包含不超過100000個詞條，每個詞條占據一行。每一個詞條包括一個英文單詞和一個外語單詞，兩個單詞之間用一個空格隔開。而且在詞典中不會有某個外語單詞出現超過兩次。詞典之后是一個空行，然后給出一個由外語單詞組成的文檔，文檔不超過100000行，而且每行只包括一個外語單詞。輸入中出現單詞只包括小寫字母，而且長度不會超過10。 Output 在輸出中，你需要把輸入文檔翻譯成英文，每行輸出一個英文單詞。如果某個外語單詞不在詞典中，就把這個單詞翻譯成“eh”。 Sample Input dog ogday cat atcay pig igpay froot ootfray loops oopslay atcay ittenkay oopslay Sample Output cat eh loops Hint 輸入比較大，推薦使用C語言的I / O函數。
標簽： Limit Description Accepted 65536K
上傳時間： 2016-02-22
上傳用戶：fandeshun
