2084 search results - page 43 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
139
Voted
ICRA
2008
IEEE
15 years 9 months ago
2008
IEEE
— In this paper, we present a scalable, decentralized task allocation algorithm for a group of unknown number of Unmanned Aerial Vehicles (UAVs), which are equipped with GPS rece...
106
click to vote
PRDC
2006
IEEE
15 years 8 months ago
2006
IEEE
The finite average response time model is a very weak distributed systems model: it permits runs with unbounded transmission and processing delays and it does not bound the relat...
115
click to vote
JDA
2008
15 years 2 months ago
2008
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
158
Voted
MST
2010
14 years 9 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
99
Voted
SAT
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We offer a new understanding of some aspects of practical SAT-solvers that are based on DPLL with unit-clause propagation, clause-learning, and restarts. On the theoreti...