Completeness and performance of the APO algorithm

MaRDI QIDQ3624163zbMATH OpenFDO

Authors Tal Grinshpoun, Amnon Meisels

Publication date 28 April 2009

Full work available at URL https://arxiv.org/abs/1401.3450

zbMATH Keywords

CompAPOComplete Asynchronous Partial Overlay

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 5547836
• Asynchronous forward-checking for DisCSPs
• Concurrent search for distributed CSPs
• Asynchronous aggregation and consistency in distributed constraint satisfaction
• scientific article; zbMATH DE number 5547971

Cited in

(6)

• Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs
• Explorative anytime local search for distributed constraint optimization
• The impact of the conflict on solving distributed constraint satisfaction problems
• Concurrent forward bounding for distributed constraint optimization problems
• Privacy preserving solution of DCOPs by mediation
• Counterexamples and amendments to the termination and optimality of ADOPT-based algorithms

This page was built for publication: Completeness and performance of the APO algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3624163)