Corpus ID: 15046897

On the Feasibility of Distributed Constraint Satisfaction

@inproceedings{Collin1991OnTF,
  title={On the Feasibility of Distributed Constraint Satisfaction},
  author={Zeev Collin and R. Dechter and Shmuel Katz},
  booktitle={IJCAI},
  year={1991}
}
This paper characterizes connectionist-type architectures that allow a distributed solution for classes of constraint-satisfaction problems. The main issue addressed is whether there exists a uniform model of computation (where all nodes are indistinguishable) that guarantees convergence to a solution from every initial state of the system, whenever such a solution exists. We show that even for relatively simple constraint networks, such as rings, there is no general solution using a completely… Expand
96 Citations
Self-Stabilizing Distributed Constraint Satisfaction
  • 55
  • PDF
Distributed constraint satisfaction algorithm for complex local problems
  • M. Yokoo, K. Hirayama
  • Computer Science
  • Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)
  • 1998
  • 168
  • Highly Influenced
  • PDF
Solving Distributed CSPs Probabilistically
  • 5
Algorithms for Distributed Constraint Satisfaction: A Review
  • 427
  • PDF
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
  • 804
  • PDF
Distributed Constraint Programming
  • B. Faltings
  • Computer Science
  • Handbook of Constraint Programming
  • 2006
  • 34
  • PDF
Adopt: asynchronous distributed constraint optimization with quality guarantees
  • 843
  • Highly Influenced
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 38 REFERENCES
Belief Maintenance in Dynamic Constraint Networks
  • 312
The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems
  • 741
A Sufficient Condition for Backtrack-Free Search
  • 812
  • PDF
Self-stabilization of dynamic systems assuming only read/write atomicity
  • 366
  • PDF
Self-stabilizing systems in spite of distributed control
  • 2,211
  • PDF
Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition
  • R. Dechter
  • Mathematics, Computer Science
  • Artif. Intell.
  • 1990
  • 624
  • PDF
Graph Algorithms
  • 1,184
  • PDF
...
1
2
3
4
...