1016 search results - page 58 / 204 » Optimized algorithms for multi-agent routing |
SIGCOMM
1999
ACM
15 years 2 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
ASPDAC
2006
ACM
15 years 3 months ago
2006
ACM
In recent years, the X-Architecture is introduced to obtain better performance for integrated circuit physical design. This paper reformulates the global routing problem in X-Archi...
GD
2005
Springer
15 years 3 months ago
2005
Springer
Most diagram editors and graph construction tools provide some form of automatic connector routing, typically providing orthogonal or poly-line connectors. Usually the editor provi...
STOC
2004
ACM
15 years 3 months ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...