473 search results - page 36 / 95 » Computing shortest paths with uncertainty |
101
click to vote
TON
2010
14 years 8 months ago
2010
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
CG
2006
Springer
14 years 9 months ago
2006
Springer
An algorithm for finding a smooth, obstacle-avoiding curve in the plane can be quite complicated. The process usually involves finding one or more feasible polyline paths, choosin...
ICNP
1997
IEEE
15 years 1 months ago
1997
IEEE
Future computer networks are expected to carry bursty traffic. Shortest -path routing protocols such as OSPF and RIP have t he disadvantage of causing bottlenecks due to their inh...
MUE
2008
IEEE
15 years 4 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...
SWAT
1998
Springer
15 years 1 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...