239 search results - page 18 / 48 » Random walks in a supply network |
EUROPAR
2009
Springer
14 years 3 months ago
2009
Springer
Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms....
ICDM
2010
IEEE
13 years 6 months ago
2010
IEEE
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
It is shown that the error control problem in random network coding can be reformulated as a generalized decoding problem for rank-metric codes. This result allows many of the too...
MOBICOM
2009
ACM
14 years 3 months ago
2009
ACM
In this paper we investigate the connectivity for large-scale clustered wireless sensor and ad hoc networks. We study the effect of mobility on the critical transmission range fo...
ADHOCNOW
2004
Springer
14 years 1 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...