410 search results - page 48 / 82 » Upgrading Shortest Paths in Networks |
129
Voted
RSA
2010
15 years 2 months ago
2010
Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow ...
132
click to vote
WEA
2010
Springer
15 years 10 months ago
2010
Springer
We successfully contract timetable networks with realistic transfer times. Contraction gradually removes nodes from the graph and adds shortcuts to preserve shortest paths. This r...
108
Voted
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
This paper addresses the one-to-all broadcasting problem, and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. Inthispaper,...
132
Voted
JSAC
2007
15 years 3 months ago
2007
— In this paper, the detection of a correlated Gaussian field using a large multi-hop sensor network is investigated. A cooperative routing strategy is proposed by introducing a...
112
Voted
SECON
2010
IEEE
15 years 1 months ago
2010
IEEE
Anypath routing has been proposed to improve the performance of unreliable wireless networks by exploiting the spatial diversity and broadcast nature of the wireless medium. In thi...