BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm
From MaRDI portal
Publication:3563097
DOI10.1613/jair.2849zbMath1191.68733arXiv1401.3490OpenAlexW3139174429MaRDI QIDQ3563097
William Yeoh, Ariel Felner, Sven Koenig
Publication date: 31 May 2010
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.3490
Related Items (17)
Distributed Bayesian: A Continuous Distributed Constraint Optimization Problem Solver ⋮ Concurrent forward bounding for distributed constraint optimization problems ⋮ Forward bounding on pseudo-trees for DCOPs and ADCOPs ⋮ Proactive Dynamic Distributed Constraint Optimization Problems ⋮ Solving distributed constraint optimization problems using logic programming ⋮ Privacy stochastic games in distributed constraint reasoning ⋮ Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs ⋮ Explorative anytime local search for distributed constraint optimization ⋮ Nogood-based asynchronous forward checking algorithms ⋮ PC-SyncBB: a privacy preserving collusion secure DCOP algorithm ⋮ Bounded approximate decentralised coordination via the max-sum algorithm ⋮ A distributed optimization method for the geographically distributed data centres problem ⋮ Probabilistic optimal solution assessment for DCOPs ⋮ Governing convergence of Max-sum on DCOPs through damping and splitting ⋮ Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs ⋮ Adding laziness in BnB-ADOPT\(^+\) ⋮ Communication-Aware Local Search for Distributed Constraint Optimization
This page was built for publication: BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm
