Bounded approximate decentralised coordination via the max-sum algorithm
From MaRDI portal
Publication:543622
DOI10.1016/j.artint.2010.11.001zbMath1216.68305OpenAlexW2065090389WikidataQ57377346 ScholiaQ57377346MaRDI QIDQ543622
Publication date: 17 June 2011
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/271664/1/4136.pdf
Related Items (8)
Distributed Bayesian: A Continuous Distributed Constraint Optimization Problem Solver ⋮ A framework for parallel and distributed training of neural networks ⋮ Explorative anytime local search for distributed constraint optimization ⋮ Bounded approximate decentralised coordination via the max-sum algorithm ⋮ Probabilistic optimal solution assessment for DCOPs ⋮ Governing convergence of Max-sum on DCOPs through damping and splitting ⋮ An efficient distributed optimization and coordination protocol: application to the emergency vehicle management ⋮ Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clustering by Passing Messages Between Data Points
- Bounded approximate decentralised coordination via the max-sum algorithm
- Adopt: asynchronous distributed constraint optimization with quality guarantees
- Correctness of Belief Propagation in Gaussian Graphical Models of Arbitrary Topology
- Approximations in Distributed Optimization
- Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
- BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- The generalized distributive law
- Factor graphs and the sum-product algorithm
- Approximating discrete probability distributions with dependence trees
This page was built for publication: Bounded approximate decentralised coordination via the max-sum algorithm
