338 search results - page 17 / 68 » Fast distributed random walks |
ICRA
1998
IEEE
15 years 1 months ago
1998
IEEE
This paper addresses some performance limits of the kneed and non-kneed passive-dynamic walking machines discovered by McGeer [10, 11]. Energetic inefficiency is measured by the s...
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...
100
Voted
CAV
2001
Springer
15 years 1 months ago
2001
Springer
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The alg...
102
click to vote
TSP
2010
14 years 4 months ago
2010
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
CCS
2010
ACM
14 years 8 months ago
2010
ACM
Social network-based Sybil defenses exploit the trust exhibited in social graphs to detect Sybil nodes that disrupt an algorithmic property (i.e., the fast mixing) in these graphs...