The distributed breakout algorithms
From MaRDI portal
Recommendations
- Recent Advances in Constraints
- Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks
- scientific article; zbMATH DE number 1573293
- AI 2003: Advances in Artificial Intelligence
- Concurrent search for distributed CSPs
Cites work
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 2083800 (Why is no real title available?)
- A discrete Lagrangian-based global-search method for solving satisfiability problems
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Multistage negotiation for distributed constraint satisfaction
Cited in
(9)- An efficient distributed optimization and coordination protocol: application to the emergency vehicle management
- A review of literature on parallel constraint solving
- A distributed optimization method for the geographically distributed data centres problem
- Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks
- Recent Advances in Constraints
- Concurrent forward bounding for distributed constraint optimization problems
- Integrating domain and constraint privacy reasoning in the distributed stochastic algorithm with breakouts
- Explorative anytime local search for distributed constraint optimization
- Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs
This page was built for publication: The distributed breakout algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2457700)