Probabilistic optimal solution assessment for DCOPs
From MaRDI portal
Recommendations
- A class of algorithms for distributed constraint optimization.
- COOPT: using collective behavior of coupled oscillators for solving DCOP
- Distributed Gibbs: a linear-space sampling-based DCOP algorithm
- Adopt: asynchronous distributed constraint optimization with quality guarantees
- Distributed constraint optimization problems and applications: a survey
Cites work
- scientific article; zbMATH DE number 5547971 (Why is no real title available?)
- scientific article; zbMATH DE number 2080333 (Why is no real title available?)
- scientific article; zbMATH DE number 2083800 (Why is no real title available?)
- Adopt: asynchronous distributed constraint optimization with quality guarantees
- 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
- Bounded approximate decentralised coordination via the max-sum algorithm
- Concurrent forward bounding for distributed constraint optimization problems
- Distributed search by constrained agents. Algorithms, performance, communication.
- Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks
- Emergence of Scaling in Random Networks
- GLOBAL FLUCTUATIONS IN PHYSICAL SYSTEMS: A SUBTLE INTERPLAY BETWEEN SUM AND EXTREME VALUE STATISTICS
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- Solving weighted CSP by maintaining arc consistency
Cited in
(3)
This page was built for publication: Probabilistic optimal solution assessment for DCOPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q722106)