3809 search results - page 265 / 762 » Randomized Broadcast in Networks |
175
click to vote
INFOCOM
2007
IEEE
16 years 24 days ago
2007
IEEE
— This paper argues for the need to address the issue of multi-channel network performance under constraints on channel switching. We present examples from emergent directions in...
179
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
167
click to vote
CCGRID
2010
IEEE
15 years 7 months ago
2010
IEEE
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...
194
click to vote
Publication
State-of-the-art techniques for probability sampling of users of online social networks (OSNs) are based on random walks on a single social relation. While powerful, these methods ...
152
click to vote
INFOCOM
2008
IEEE
16 years 27 days ago
2008
IEEE
The capacity gain of network coding has been extensively studied in wired and wireless networks. Recently, it has been shown that network coding improves network reliability by re...