580 search results - page 26 / 116 » Choosing a random peer |
CSR
2008
Springer
15 years 1 months ago
2008
Springer
Versus the customary preconditioners, our weakly random ones are generated more readily and for a much larger class of input matrices. Furthermore our preconditioners have a wider...
104
click to vote
STOC
2004
ACM
15 years 5 months ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
SIGMETRICS
2010
ACM
15 years 4 months ago
2010
ACM
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
SIGMETRICS
2008
ACM
14 years 11 months ago
2008
ACM
Several peer-to-peer systems for live streaming have been recently deployed (e.g. CoolStreaming, PPLive, SopCast). These all rely on distributed, epidemic-style dissemination mech...
GLOBECOM
2006
IEEE
15 years 5 months ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...