Solving Distributed CSPs Probabilistically

DOI10.3233/FI-2010-358MaRDI QIDQ3084980zbMATH OpenOpenAlexFDO

Authors Stefano Bistarelli, Giorgio Gosti

Publication date 28 March 2011

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2010-358

zbMATH Keywords

constraint solving problemsdistributed constraint solving problemnaming game

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Other game-theoretic models (91A40)

Recommendations

• Concurrent search for distributed CSPs
• Distributed CSPs by graph partitioning
• scientific article; zbMATH DE number 67481
• scientific article; zbMATH DE number 2084769
• Distributed constraint satisfaction with partially known constraints
• Principles and Practice of Constraint Programming – CP 2004

Cited in

(2)

• A combinatorial characterization of the distributed 1-solvable tasks
• Solving CSPs with Naming Games

This page was built for publication: Solving Distributed CSPs Probabilistically

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