2084 search results - page 249 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
SPAA
2003
ACM
15 years 3 months ago
2003
ACM
Link reversal algorithms provide a simple mechanism for routing in mobile ad hoc networks. These algorithms maintain routes to any particular destination in the network, even when...
ICDCS
2007
IEEE
15 years 4 months ago
2007
IEEE
This paper addresses the problem of selection and discovery of a consistent availability monitoring overlay for computer hosts in a large-scale distributed application, where host...
124
click to vote
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
MASS
2010
14 years 8 months ago
2010
We study a problem in which a single sensor is scheduled to observe sites periodically, motivated by applications in which the goal is to maintain up-to-date readings for all the o...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
— The paper studies distributed average consensus in sensor networks, when the sensors exchange quantized data at each time step. We show that randomizing the exchanged sensor da...