send an input on a linux socket.
標(biāo)簽： socket input linux send
上傳時(shí)間： 2017-04-06
上傳用戶：569342831
send an input on a linux socket.
標(biāo)簽： socket input linux send
上傳時(shí)間： 2014-01-18
上傳用戶：wpt
java csharp program that ask users a input(process arrival time, burst time and priority)
標(biāo)簽： time priority arrival program
上傳時(shí)間： 2014-10-25
上傳用戶：rishian
使用FPGA/CPLD設(shè)置語(yǔ)音AD、DA轉(zhuǎn)換芯片AIC23，F(xiàn)PGA/CPLD系統(tǒng)時(shí)鐘為24.576MHz 1、AIC系統(tǒng)時(shí)鐘為12.288MHz，SPI時(shí)鐘為6.144MHz 2、AIC處于主控模式 3、input bit length 16bit output bit length 16bit MSB first 4、幀同步在96KHz
上傳時(shí)間： 2013-12-20
上傳用戶：二驅(qū)蚊器
Finding blob in the input image using seed filling algorithm.
標(biāo)簽： algorithm Finding filling image
上傳時(shí)間： 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.
標(biāo)簽： fault-tolerant algorithms redundant underlyin
上傳時(shí)間： 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.
標(biāo)簽： Multiplicative undirected Shortest measured
上傳時(shí)間： 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.
標(biāo)簽： optimizing different the shortest
上傳時(shí)間： 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 ))" />
標(biāo)簽： highLight lt gt onclick
上傳時(shí)間： 2013-12-07
上傳用戶：蟲(chóng)蟲(chóng)蟲(chóng)蟲(chóng)蟲(chóng)蟲(chóng)
A File Comparer with visual output
標(biāo)簽： Comparer visual output File
上傳時(shí)間： 2013-12-14
上傳用戶：yuanyuan123
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
