2084 search results - page 162 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
137
click to vote
SSS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. “Pulse Synchronization” intends to invoke a recurring distributed event at the different nodes, of a distributed system as simultaneously as possible and with a freq...
199
Voted
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
125
Voted
MOR
2010
15 years 3 months ago
2010
We study G/G/n + GI queues in which customer patience times are independent, identically distributed following a general distribution. When a customer’s waiting time in queue ex...
121
click to vote
JIRS
2007
15 years 4 months ago
2007
— In this paper, we propose a novel path-planning and obstacle avoidance algorithm GODZILA for navigation in unknown environments. No prior knowledge of the environment is requir...
134
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...