Solving Distributed CSPs Probabilistically
Stefano Bistarelli, Giorgio Gosti · Fundamenta Informaticae · 2010
Constraint solving problems (CSPs) are the formalization of a large range of problems that emerge from computer science. The solving methodology described here is based on the naming game. The two main features that distinguish this methodology from