763 search results - page 46 / 153 » Engineering Shortest Path Algorithms |
ISAAC
1999
Springer
13 years 12 months ago
1999
Springer
We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorit...
PC
2010
13 years 6 months ago
2010
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
COSIT
1995
Springer
13 years 11 months ago
1995
Springer
: Various algorithms have been proposed for the determination of the optimum paths in line networks. Moving in space is a far more complex problem, where research has been scarce. ...
ICDCS
1999
IEEE
13 years 12 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
Focused crawlers are considered as a promising way to tackle the scalability problem of topic-oriented or personalized search engines. To design a focused crawler, the choice of s...