send an input on a linux socket.
上传时间： 2017-04-06
上传用户：569342831
send an input on a linux socket.
上传时间： 2014-01-18
上传用户：wpt
java csharp program that ask users a input(process arrival time, burst time and priority)
标签： time priority arrival program
上传时间： 2014-10-25
上传用户：rishian
使用FPGA/CPLD设置语音AD、DA转换芯片AIC23，FPGA/CPLD系统时钟为24.576MHz 1、AIC系统时钟为12.288MHz，SPI时钟为6.144MHz 2、AIC处于主控模式 3、input bit length 16bit output bit length 16bit MSB first 4、帧同步在96KHz
上传时间： 2013-12-20
上传用户：二驱蚊器
Finding blob in the input image using seed filling algorithm.
标签： algorithm Finding filling image
上传时间： 2014-01-09
上传用户：sammi
c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that uses depth-first search to determine all such paths. Note that, these paths are not vertex-disjoint i.e., the vertices may repeat but they are all edge-disjoint i.e., no two paths have the same edges. The input is the adjacency matrix of a directed acyclic graph and a pair(s) of source and destination vertices and the output should be the number of such disjoint paths and the paths themselves on separate lines. In case of multiple paths the output should be in order of paths with minimum vertices first. In case of tie the vertex number should be taken in consideration for ordering.
标签： fault-tolerant algorithms redundant underlyin
上传时间： 2013-12-18
上传用户：jkhjkh1982
Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or integers (2, 3). There are no negative edges. Given such a graph as input, you are to output the shortest path between any two given vertices. Input is the adjacency matrix and the two vertices. You must output the path.
标签： Multiplicative undirected Shortest measured
上传时间： 2017-04-08
上传用户：邶刖
In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights of the edges and the number of edges. For example: if two paths with equal cost exist then, the path with the least number of edges is chosen as the shortest path. Given this metric, you have find out the shortest path between a given pair of vertices in the input graph. The output should be the number of edges on the path, the cost of the shortest path, and the path itself. Input is the adjacency matrix and the two vertices.
标签： optimizing different the shortest
上传时间： 2014-10-25
上传用户：1159797854
</div> <br> <input type="button" value="闪烁" onclick="highLight($( demo ))" /> <input type="button" value="停止" onclick="stopTwinkle($( demo ))" /> <br> <br> <div id="demo2" class="box"> Box II </div> <br> <input type="button" value="闪烁" onclick="highLight($( demo2 ))" /> <input type="button" value="停止" onclick="stopTwinkle($( demo2 ))" />
上传时间： 2013-12-07
上传用户：虫虫虫虫虫虫
A File Comparer with visual output
标签： Comparer visual output File
上传时间： 2013-12-14
上传用户：yuanyuan123
