Nogood-based asynchronous forward checking algorithms
From MaRDI portal
Recommendations
Cites work
- Asynchronous aggregation and consistency in distributed constraint satisfaction
- Asynchronous backtracking without adding links: a new member in the ABT family
- Asynchronous forward-checking for DisCSPs
- BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
- Dynamic ordering for asynchronous backtracking on DisCSPs
- Fault-tolerant distributed algorithm for election in complete networks
- Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation
- scientific article; zbMATH DE number 67481 (Why is no real title available?)
- scientific article; zbMATH DE number 1149402 (Why is no real title available?)
- Improving ABT Performance by Adding Synchronization Points
- Message delay and DisCSP search algorithms
- New methods for high-dimensional verified quadrature
- Recent Advances in Constraints
- Recent Advances in Constraints
- Sensor networks and distributed CSP: communication, computation and complexity
Cited in
(4)- A distributed optimization method for the geographically distributed data centres problem
- Improving the performances of asynchronous algorithms by combining the nogood processors with the nogood learning techniques
- Distributed Forward Checking May Lie for Privacy
- Asynchronous forward-checking for DisCSPs
This page was built for publication: Nogood-based asynchronous forward checking algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q481712)
