13214 search results - page 289 / 2643 » Pseudorandomness for network algorithms |
237
click to vote
BROADNETS
2005
IEEE
16 years 10 days ago
2005
IEEE
—In this paper, we present an extended Mobile Backbone Network (MBN) topology synthesis algorithm (ETSA) for constructing and maintaining a dynamic backbone structure in mobile w...
202
click to vote
SAPIR
2004
Springer
16 years 1 days ago
2004
Springer
We consider the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exist at...
186
click to vote
ICCS
2003
Springer
15 years 12 months ago
2003
Springer
Issues of network reliability are very important in modern computer networks. Even a short failure of a network link can cause substantial consequences. In this paper we concentrat...
147
click to vote
ISAAC
1994
Springer
15 years 10 months ago
1994
Springer
In this paper we present efficient deterministic and randomized algorithms for selection on any interconnection network when the number of input keys (n) is the number of processo...
213
click to vote
TON
2012
13 years 9 months ago
2012
—Multiparty interactive network applications such as teleconferencing, network gaming, and online trading are gaining popularity. In addition to end-to-end latency bounds, these ...