Distributed, Interleaved, Parallel and Cooperative Search in Constraint Satisfaction Networks

Hamadi, Youssef

HP Development Company

关键词: distributed AI;    constraint satisfaction;    search;   

RP-ID  :  HPL-2002-21

学科分类：计算机科学（综合）

美国|英语

来源: HP Labs

【 摘 要 】

In this work, we extend the efficiency of distributed search in constraint satisfaction networks. Our method adds interleaving and parallelism into distributed backtrack search. Moreover, it has a filtering capacity that makes it open to cooperative work. Experimentations show that 1) the shape of phase transition with random problem can be characterized, 2) important speed-up can be achieved when the distribution of solutions is non uniform. 6 Pages