On the parallel complexity of discrete relaxation in constraint satisfaction networks
Artificial Intelligence
A generic arc-consistency algorithm and its specializations
Artificial Intelligence
Arc-consistency and arc-consistency again
Artificial Intelligence
Local consistency in parallel constraint satisfaction networks
Artificial Intelligence
A distributed arc-consistency algorithm
Science of Computer Programming - Special issue on concurrent constraint programming
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Generating Semantic Descriptions From Drawings of Scenes With Shadows
Generating Semantic Descriptions From Drawings of Scenes With Shadows
| Hi-index | 0.00 |
Many problems from artificial intelligence can be described as constraint satisfaction problems over finite domains (CSP(FD)), that is, a solution is an assignment of a value to each problem variable such that a set of constraints is satisfied. Arc-consistency algorithms remove inconsistent values from the set of values that can be assigned to a variable (its domain), thus reducing the search space. We have developed a parallelisation scheme of arc-consistency to be run on MIMD multiprocessor. The set of constraints is divided into N partitions, which are executed in parallel on N processors. The parallelisation scheme has been implemented on a CRAY T3E multiprocessor with up to thirty-four processors. Empirical results on speedup and behaviour are reported and discussed.