Asynchronous forward-checking for DisCSPs
From MaRDI portal
Publication:879978
DOI10.1007/S10601-006-9013-5zbMATH Open1118.68158OpenAlexW2116744268MaRDI QIDQ879978FDOQ879978
Publication date: 10 May 2007
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-006-9013-5
Cites Work
- Time, clocks, and the ordering of events in a distributed system
- Title not available (Why is that?)
- Dynamic Ordering for Asynchronous Backtracking on DisCSPs
- A theoretical evaluation of selected backtracking algorithms.
- Asynchronous backtracking without adding links: a new member in the ABT family
- Asynchronous aggregation and consistency in distributed constraint satisfaction
- Recent Advances in Constraints
- Title not available (Why is that?)
- Secure distributed constraint satisfaction: reaching agreement without revealing private information
- Principles and Practice of Constraint Programming – CP 2004
Cited In (8)
- Probabilistic optimal solution assessment for DCOPs
- A distributed optimization method for the geographically distributed data centres problem
- Forward bounding on pseudo-trees for DCOPs and ADCOPs
- Nogood-based asynchronous forward checking algorithms
- Title not available (Why is that?)
- Min-domain retroactive ordering for asynchronous backtracking
- Dynamic ordering for asynchronous backtracking on DisCSPs
- Message delay and DisCSP search algorithms
Recommendations
This page was built for publication: Asynchronous forward-checking for DisCSPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879978)
