410 search results - page 28 / 82 » Upgrading Shortest Paths in Networks |
NIPS
1993
15 years 2 months ago
1993
This paper describes the Q-routing algorithm for packet routing, in which a reinforcement learning module is embedded into each node of a switching network. Only local communicati...
129
click to vote
ICC
2011
IEEE
14 years 1 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...
117
click to vote
CVPR
2009
IEEE
16 years 8 months ago
2009
IEEE
This paper presents a new method to extract a network of vessels centerlines from a medical
image. The network is composed of local geodesics over a four-dimensional space that in...
NOMS
2000
IEEE
15 years 5 months ago
2000
IEEE
Communication networks are expected to offer a wide range of services to an increasingly large number of users, with a diverse range of quality of service. This calls for efficien...
109
click to vote
WCNC
2010
IEEE
15 years 5 months ago
2010
IEEE
—When shortest path routing is employed in large scale multi-hop wireless networks, nodes located near the center of the network have to perform disproportional amount of relayin...