Sciweavers

837 search results - page 17 / 168
» Distributed algorithms for reaching consensus on general fun...
Sort
View
CDC
2009
IEEE
135views Control Systems» more  CDC 2009»
13 years 5 months ago
Formation control via distributed optimization of alignment error
This paper proposes a method for the stabilization of vehicle formations in the plane under a fixed, but not necessarily complete, sensing graph. In this method each agent acts to ...
Brandon J. Moore, Carlos Canudas de Wit
PPSN
2010
Springer
13 years 6 months ago
General Lower Bounds for the Running Time of Evolutionary Algorithms
Abstract. We present a new method for proving lower bounds in evolutionary computation based on fitness-level arguments and an additional condition on transition probabilities bet...
Dirk Sudholt
ATAL
2005
Springer
14 years 1 months ago
Argumentation-based dialogues for deliberation
This paper presents an argumentation-based approach to deliberation, the process by which two or more agents reach a consensus on a course of action. The kind of deliberation we a...
Yuqing Tang, Simon Parsons
ATAL
2008
Springer
13 years 9 months ago
Trajectories of goods in distributed allocation
Distributed allocation mechanisms rely on the agents' autonomous (and supposedly rational) behaviour: states evolve as a result of agents contracting deals and exchanging res...
Yann Chevaleyre, Ulle Endriss, Nicolas Maudet
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
13 years 12 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks