Distributed Gibbs: a linear-space sampling-based DCOP algorithm
From MaRDI portal
Recommendations
- A class of algorithms for distributed constraint optimization.
- Balancing local resources and global goals in multiply-constrained DCOP
- Distributed Bayesian: A Continuous Distributed Constraint Optimization Problem Solver
- BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
- COOPT: using collective behavior of coupled oscillators for solving DCOP
Cited in
(10)- An algorithm for distributed constraint optimization problems with low constraint density
- Proactive Dynamic Distributed Constraint Optimization Problems
- Probabilistic optimal solution assessment for DCOPs
- COOPT: using collective behavior of coupled oscillators for solving DCOP
- Decentralized, decomposition-based observation scheduling for a large-scale satellite constellation
- Communication-Aware Local Search for Distributed Constraint Optimization
- A distributed optimization method for the geographically distributed data centres problem
- Distributed Bayesian: A Continuous Distributed Constraint Optimization Problem Solver
- Balancing local resources and global goals in multiply-constrained DCOP
- Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs
This page was built for publication: Distributed Gibbs: a linear-space sampling-based DCOP algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3121514)