Results 1 - 10 of 132,570

Table 3 Shortest-path running times

in Using Software Complexity Measures to Analyze Algorithms - an Experiment With the Shortest-Paths Algorithm
by Jukka Nurminen
"... In PAGE 7: ...1. Shortest-path algorithms We have collected the running times, from [12] in Table3 (the largest problem instances only). 13 Table 4 contains the ranking of the algorithms based on their running times.... ..."

Table 3 Shortest-path running times

in Available Online At Www.sciencedirect.com
by Computers Operations Research, Jukka K. Nurminen
"... In PAGE 7: ...1. Shortest-path algorithms We have collected the running times, from [12] in Table3 (the largest problem instances only). Table 4 contains the ranking of the algorithms based on their running times.... ..."

Table 4: Steiner vs Shortest Paths Trees

in ROMR: Robust Multicast Routing in Mobile Ad-hoc Networks
by Gretchen H. Lynn 2003
"... In PAGE 113: ... The parameters were the same as used in the romrOn case described above. The results, given in Table4 , showed that the successful delivery of packets to the receivers was very similar in both of the two cases, but other statistics gathered indicate the superiority of the use of the Steiner trees. The average amount of time a tree set remained active before a new tree set was distributed was 8% shorter in the shortest paths trees than in the Steiner tree version.... ..."
Cited by 3

Table B.1. ASCII Input File Speci cation Fields 3. Select Shortest Path Layer: Following the loading of the input le, the shortest path layer should be selected for archiving. This is to enable the display routine to work. 4. Deselecting the Shortest Path Layer: In general operation, only single paths are required at any time. These will not display if the whole coverage layer is loaded, so the user is automatically prompted to remove the SP layer. If they do not wish to do so, removal can be done at a later time. Following the performance of these steps, the shortest path coverage will have been calculated, and individual paths can be displayed.

in A 3-D Spatial Information System For Emergency Routing In Okayama City
by Simon Pollitt, B. Sc, Comp Sc

Table 1. Run-time results for the shortest paths program

in Skil: An Imperative Language with Algorithmic Skeletons for Efficient Distributed Programming
by George Horatiu Botorog, Herbert Kuchen 1996
"... In PAGE 9: ...y pp was taken, e.g. n = 201 for pp = 3). The absolute run-time results, as well as a comparison between Skil and DPFL are given in Table1 . These results show that the Skil program runs more than 6 times faster than the equivalent... ..."
Cited by 33

Table VI. All pairs shortest paths problem (execution times in seconds)

in A comparison of two paradigms for distributed shared memory
by Willem G. Levelt, M. Frans Kaashoek, Henri E. Bal, Andrew S. Tanenbaum 1992
Cited by 27

Table 2. Area usage and timing reports of the shortest path processor

in Design and Implementation of a Shortest Path Processor for Network Routing
by Nazir Shaikh-Husin, Mohamed Khalil Hani, Teoh Giap Seng

Table 2 Tra c matrix in (20) applied to the mesh network in Fig. 10 using the shortest path while varying the number of wavelengths a

in in
by Maher Ali, Byrav Ramamurthy, Jitender S. Deogun
"... In PAGE 13: ... 10. Table2 shows the results obtained by varying the number of wavelengths, for the demand ma- trix, T, where Ti;j is the number of connections desired from station i to station j, given in (20) T 032021 003000 010103 132032 000300 123120 2 6 6 6 6 6 6 4 3 7 7 7 7 7 7 5 : 20 For each case in Table 2, the first column shows the number of available wavelengths on a link. The second column gives the number of connections generated by the linear solver (which serves as an upper bound on the number of connections for the heuristics) and the time (in seconds) it took to solve the linear program.... In PAGE 13: ... 10. Table 2 shows the results obtained by varying the number of wavelengths, for the demand ma- trix, T, where Ti;j is the number of connections desired from station i to station j, given in (20) T 032021 003000 010103 132032 000300 123120 2 6 6 6 6 6 6 4 3 7 7 7 7 7 7 5 : 20 For each case in Table2 , the first column shows the number of available wavelengths on a link. The second column gives the number of connections generated by the linear solver (which serves as an upper bound on the number of connections for the heuristics) and the time (in seconds) it took to solve the linear program.... ..."

Table 3: Shortest path on 10 ISCAS Benchmarks to compute the longest path delay and the shortest path delay for CMOS circuits. The results show that the combination algorithm o er the best performance. For the shortest path delay, OurTS algorithm is more accurate than TS algorithm.

in Efficient Timing Analysis for CMOS Circuits Considering Data Dependent Delays
by Shang-zhi Sun, David H. C. Du, Hsi-chuan Chen 1998
"... In PAGE 18: ... The combination algorithm get the most accurate results with the most computation time. In Table3 , TS and OurTS denote the shortest topological short path algorithm based on the bounded delay model and the simpli ed data dependent delay model respectively. Both algorithms have the same accuracy for the shortest delays of circuits C880, C2670, C5315, C6288 and C7552.... ..."
Cited by 5

Table 3. Searching the Shortest Paths.

in Theory and Practice of Time-Space Trade-Offs in Memory Limited Search
by Stefan Edelkamp, Ulrich Meyer 2001
Cited by 3
Results 1 - 10 of 132,570