Self-Stabilizing Distributed Constraint Satisfaction
@article{Collin1999SelfStabilizingDC, title={Self-Stabilizing Distributed Constraint Satisfaction}, author={Zeev Collin and R. Dechter and Shmuel Katz}, journal={Chic. J. Theor. Comput. Sci.}, year={1999}, volume={1999} }
Author(s): Collin, Zeev; Dechter, Rina; Katz, Shmuel | Abstract: This paper characterizes connectionist-type architectures that allow a distributed solution for classes of constraint satisfaction problems, and presents such solutions. We first consider whether there exists a uniform model of computation that guarantees convergence to a solution from every initial state of the system, whenever such a solution exists. Even for relatively simple constraint networks, such as rings, we show that… Expand
Figures and Topics from this paper
55 Citations
Superstabilizing, Fault-Containing Distributed Combinatorial Optimization
- Computer Science
- AAAI
- 2005
- 38
- PDF
S-DPOP: Superstabilizing, Fault-containing Multiagent Combinatorial Optimization
- Computer Science
- AAAI 2005
- 2005
- 53
ADOPT-ing: unifying asynchronous distributed optimization with asynchronous backtracking
- Computer Science
- Autonomous Agents and Multi-Agent Systems
- 2008
- 21
- PDF
References
SHOWING 1-10 OF 70 REFERENCES
SuperStabilizing protocols for dynamic distributed systems
- Computer Science, Mathematics
- PODC '95
- 1995
- 250
- PDF
Self-stabilizing depth-first token circulation in arbitrary rooted networks
- Computer Science
- Distributed Computing
- 2000
- 66
- PDF
Local and global properties in networks of processors (Extended Abstract)
- Computer Science
- STOC '80
- 1980
- 571
Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity
- Computer Science
- PODC
- 1990
- 139
- Highly Influential
Self-stabilization of dynamic systems assuming only read/write atomicity
- Computer Science
- PODC '90
- 1990
- 366
- PDF
Parallel and Distributed Finite Constraint Satisfaction: Complexity, Algorithms and Experiments
- Computer Science
- 1992
- 32
A Self-Stabilizing Algorithm for Constructing Breadth-First Trees
- Mathematics, Computer Science
- Inf. Process. Lett.
- 1992
- 131