myanmar web input system
上传时间： 2013-12-23
上传用户：dreamboy36
tinyos1.x 测试看门狗的程序 Testsuite for watchdog component. It currently shows three behaviors:
标签： Testsuite component behaviors currently
上传时间： 2014-01-01
上传用户：qw12
Solve the 8-puzzle problem using A * algorithme. Input: Program reads start state and goal state and heuristic (N or S) from EightPuzzle.INP file.0 representing blank. There are 2 Heuristic: 1. N: Number of misplaced tiles 2. S: Sum of Manhattan distance of current location and target location. Format: The first line write type of heuristic (N or S). Next is the status of departing and landing status. Between 2 states of 1 line blank. See examples EightPuzzle.INP
标签： state algorithme Program problem
上传时间： 2017-08-12
上传用户：jjj0202
The function applies the Madsen method for Doppler Centroid estimation. The input are: 1) the raw data, the parameter of the distance between samples in azimuth to be correlated and the PRF (Pulse repetition frequency)
标签： estimation The the Centroid
上传时间： 2017-08-12
上传用户：pinksun9
1、 在NMBER INPUT的基础上设计数字密码锁 2、 运行初始密码为学号后8位，密码不正确执行4、5功能 3、 连续3次密码错误，锁定键盘，发出报警指示 4、 输出开锁信号（使用功率开关），LED指示 设置修改密码功能，数据存入24C01EEROM
上传时间： 2014-01-15
上传用户：sxdtlqqjl
This file contians three programs which used for Smart antenna simulation,including DOA estimation by MUSIC and ESPRIT algorithm,Adaptive Beamforming , and Signal Regeneration
标签： estimation simulation including contians
上传时间： 2013-12-03
上传用户：dreamboy36
three Point to circle Python sample - "interactive"
标签： interactive circle Python sample
上传时间： 2013-12-17
上传用户：dengzb84
Calculates if the brackets in a sentence are correctly close. Input consists, one per line, sentences with brackets, and output say YES if its correctly close, or NO int if its not saying where is the error. Input: ()[]<>(**) (*) (ASA Output: YES NO 2 NO 4
标签： Calculates correctly brackets consists
上传时间： 2013-12-13
上传用户：aig85
Implementation of Edmonds Karp algorithm that calculates maxFlow of graph. Input: For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, ending vertex and arc weight, separated by a space). The nodes are numbered from 1 to n. The node 1 and node n should be in different sets. There are no more than 30 arcs and 15 nodes. The arc weights vary between 1 and 1 000 000. Output: The output is a single line for each case, with the corresponding minimum size cut. Example: Input: 7 11 1 2 3 1 4 3 2 3 4 3 1 3 3 4 1 3 5 2 4 6 6 4 5 2 5 2 1 5 7 1 6 7 9 Output: 5
标签： Implementation calculates algorithm Edmonds
上传时间： 2014-01-04
上传用户：kiklkook
sd card input,output source program
标签： program output source input
上传时间： 2017-08-29
上传用户：懒龙1988
