You are currently offline. Some features of the site may not work correctly.

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