Sciweavers

133 search results - page 21 / 27
» DIJKSTRA
Sort
View
108
Voted
ICPR
2002
IEEE
15 years 4 months ago
Image Flows and One-Liner Graphical Image Representation
In this paper we introduce a novel graphical image representation comprising a single curve—the one-liner. The first step involves the detection and linking of image edges. We ...
Vadim Makhervaks, Gill Barequet, Alfred M. Bruckst...
IPPS
2002
IEEE
15 years 4 months ago
Optimizing Graph Algorithms for Improved Cache Performance
Tiling has long been used to improve cache performance. Recursion has recently been used as a cache-oblivious method of improving cache performance. Both of these techniques are n...
Joon-Sang Park, Michael Penner, Viktor K. Prasanna
INFOCOM
1998
IEEE
15 years 4 months ago
Loop-Free Multipath Routing Using Generalized Diffusing Computations
A new distributed algorithm for the dynamic computation of multiple loop-free paths from source to destination in a computer network or internet are presented,validated, and analy...
William T. Zaumen, J. J. Garcia-Luna-Aceves
ATAL
2008
Springer
15 years 1 months ago
Optimized algorithms for multi-agent routing
Auction methods have been successfully used for coordinating teams of robots in the multi-robot routing problem, a representative domain for multi-agent coordination. Solutions to...
Akihiro Kishimoto, Nathan R. Sturtevant
ESA
2008
Springer
112views Algorithms» more  ESA 2008»
15 years 1 months ago
Time-Dependent SHARC-Routing
In recent years, many speed-up techniques for Dijkstra's algorithm have been developed that make the computation of shortest paths in static road networks a matter of microse...
Daniel Delling