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