1016 search results - page 58 / 204 » Optimized algorithms for multi-agent routing |
159
click to vote
SIGCOMM
1999
ACM
15 years 10 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...
170
click to vote
SIGMOD
2010
ACM
15 years 11 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...
160
click to vote
ASPDAC
2006
ACM
16 years 4 days 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...
155
click to vote
GD
2005
Springer
15 years 11 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...
175
click to vote
STOC
2004
ACM
15 years 11 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...