Skip to Main content Skip to Navigation
Conference papers

Asynchronous Inter-Level Forward-Checking for DisCSPs

Abstract : We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronous Forward Checking (AFC). The second algorithm, Asynchronous Inter-Level Forward-Checking (AILFC), is based on the AFC-ng algorithm and is performed on a pseudo-tree ordering of the constraint graph. AFC-ng and AILFC only need polynomial space. We compare the performance of these algorithms with other DisCSP algorithms on random DisC-SPs in two kinds of communication environments: Fast communication and slow communication. Our experiments show that AFC-ng improves on AFC and that AILFC outperforms all compared algorithms in communication load.
Document type :
Conference papers
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00545541
Contributor : Martine Peridier <>
Submitted on : Tuesday, October 9, 2018 - 10:21:03 PM
Last modification on : Thursday, May 14, 2020 - 6:58:06 PM

File

cp09-discsps.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Redouane Ezzahir, Christian Bessière, Mohamed Wahbi, Imade Benelallam, El Houssine Bouyakhf. Asynchronous Inter-Level Forward-Checking for DisCSPs. CP: Principles and Practice of Constraint Programming, Sep 2009, Lisbon, Portugal. pp.304-318, ⟨10.1007/978-3-642-04244-7_25⟩. ⟨lirmm-00545541⟩

Share

Metrics

Record views

200

Files downloads

167