Asynchronous forward-checking for DisCSPs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1149402 (Why is no real title available?)
- scientific article; zbMATH DE number 2080333 (Why is no real title available?)
- A theoretical evaluation of selected backtracking algorithms.
- Asynchronous aggregation and consistency in distributed constraint satisfaction
- Asynchronous backtracking without adding links: a new member in the ABT family
- Dynamic Ordering for Asynchronous Backtracking on DisCSPs
- Principles and Practice of Constraint Programming – CP 2004
- Recent Advances in Constraints
- Secure distributed constraint satisfaction: reaching agreement without revealing private information
- Time, clocks, and the ordering of events in a distributed system
Cited in
(11)- Message delay and DisCSP search algorithms
- scientific article; zbMATH DE number 2084775 (Why is no real title available?)
- Asynchronous constraint-based approach: new solution for any constraint problem
- Completeness and performance of the APO algorithm
- Probabilistic optimal solution assessment for DCOPs
- Forward bounding on pseudo-trees for DCOPs and ADCOPs
- A distributed optimization method for the geographically distributed data centres problem
- Nogood-based asynchronous forward checking algorithms
- Min-domain retroactive ordering for asynchronous backtracking
- Message delay and asynchronous DisCSP search
- Dynamic ordering for asynchronous backtracking on DisCSPs
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)
