Reordering all agents in asynchronous backtracking for distributed constraint satisfaction problems
From MaRDI portal
Publication:2289022
DOI10.1016/j.artint.2019.103169zbMath1478.68327OpenAlexW2973893776MaRDI QIDQ2289022
Kenneth N. Brown, Mohamed Wahbi, Younes Mechqrane, Christian Bessiere
Publication date: 20 January 2020
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-02344682/file/v82-12-10-2019-cb-very-crc.pdf
Uses Software
Cites Work
- Unnamed Item
- Corrigendum to: ``Min-domain retroactive ordering for asynchronous backtracking
- Min-domain retroactive ordering for asynchronous backtracking
- Dynamic ordering for asynchronous backtracking on DisCSPs
- Message delay and DisCSP search algorithms
- Program verification. Fundamental issues in computer science
- Asynchronous backtracking without adding links: a new member in the ABT family
- Sensor networks and distributed CSP: communication, computation and complexity
- Adopt: asynchronous distributed constraint optimization with quality guarantees
- Distributed personnel scheduling -- negotiation among scheduling agents
- Recent Advances in Constraints
This page was built for publication: Reordering all agents in asynchronous backtracking for distributed constraint satisfaction problems