133 search results - page 5 / 27 » DIJKSTRA |
IPPS
1997
IEEE
13 years 12 months ago
1997
IEEE
We present a parallel priority data structure that improves the running time of certain algorithms for problems that lack a fast and work-efficient parallel solution. As a main a...
CN
2007
13 years 7 months ago
2007
A number of routing algorithms based on the ant-colony metaphor have been proposed for communication networks. However, there has been little work on the performance analysis of a...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
FUIN
2007
13 years 7 months ago
2007
Concurrent runs reveal more insight into distributed systems than interleaved runs. This is shown by help of Dijkstra’s paradigm of five philosophers.
TALG
2008
13 years 7 months ago
2008
The Fibonacci heap was devised to provide an especially efficient implementation of Dijkstra's shortest path algorithm. Although asyptotically efficient, it is not as fast in...