425 search results - page 12 / 85 » A Fully Dynamic Algorithm for Distributed Shortest Paths |
ICC
2011
IEEE
12 years 7 months ago
2011
IEEE
— Anypath routing, a new routing paradigm, has been proposed to improve the performance of wireless networks by exploiting the spatial diversity and broadcast nature of the wirel...
ICFEM
2000
Springer
13 years 11 months ago
2000
Springer
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...
ICCSA
2004
Springer
14 years 26 days ago
2004
Springer
The end-to-end characteristic is an important factor for QoS support. Since network users and their required bandwidths for applications increase, the efficient usage of networks h...
ICTAI
2005
IEEE
14 years 1 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...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...