13214 search results - page 398 / 2643 » Pseudorandomness for network algorithms |
191
click to vote
ICOIN
2004
Springer
16 years 7 days ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
227
click to vote
WEA
2010
Springer
16 years 1 months ago
2010
Springer
We study the problem of finding good alternative routes in road networks. We look for routes that are substantially different from the shortest path, have small stretch, and are ...
167
click to vote
CISS
2008
IEEE
16 years 1 months ago
2008
IEEE
— It has been known since the early 1990s that backpressure-type algorithms for communication networks (such as the Max-Weight algorithm) can be used to approximately solve stati...
163
click to vote
RTSS
1999
IEEE
15 years 11 months ago
1999
IEEE
Packet switching in connection-oriented networks that may have multiple parallel links between pairs of switches is considered. An e cient packet-scheduling algorithm that guarant...
204
Voted
TCOM
2008
15 years 6 months ago
2008
Network coding is a powerful coding technique that has been proved to be very effective in achieving the maximum multicast capacity. It is especially suited for new emerging networ...