Probabilistic optimal solution assessment for DCOPs

DOI10.1007/S10472-018-9582-1zbMath1405.90058OpenAlexW2801392965MaRDI QIDQ722106

Amnon Meisels, Daniel Berend, Or Peri

Publication date: 20 July 2018

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-018-9582-1

zbMATH Keywords

constraint optimizationdistributed constraint optimization problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Concurrent forward bounding for distributed constraint optimization problems
• Bounded approximate decentralised coordination via the max-sum algorithm
• Solving weighted CSP by maintaining arc consistency
• Asynchronous forward-checking for DisCSPs
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• Distributed search by constrained agents. Algorithms, performance, communication.
• Asynchronous backtracking without adding links: a new member in the ABT family
• Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks
• Adopt: asynchronous distributed constraint optimization with quality guarantees
• Emergence of Scaling in Random Networks
• GLOBAL FLUCTUATIONS IN PHYSICAL SYSTEMS: A SUBTLE INTERPLAY BETWEEN SUM AND EXTREME VALUE STATISTICS
• BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm

This page was built for publication: Probabilistic optimal solution assessment for DCOPs