96 search results - page 10 / 20 » Fast Exact MultiConstraint Shortest Path Algorithms |
119
Voted
ICTAI
2005
IEEE
15 years 10 months ago
2005
IEEE
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reach...
139
click to vote
SOFSEM
2009
Springer
16 years 1 months ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
221
Voted
ALGORITHMICA
2011
15 years 1 days ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
137
click to vote
MUE
2008
IEEE
15 years 11 months ago
2008
IEEE
The route guidance system, which provides driving advice based on traffic information about an origin and a destination, has become very popular along with the advancement of hand...
157
Voted
INFOCOM
2011
IEEE
14 years 8 months ago
2011
IEEE
—This paper develops a mesh network protection scheme that guarantees a quantifiable minimum grade of service upon a failure within a network. The scheme guarantees that a fract...