Solving constraint satisfaction problems through belief propagation-guided decimation (original) (raw)

2007

Abstract

Abstract: Message passing algorithms have proved surprisingly successful in solving hard constraint satisfaction problems on sparse random graphs. In such applications, variables are fixed sequentially to satisfy the constraints. Message passing is run after each step. Its outcome provides an heuristic to make choices at next step. This approach has been referred to asdecimation,'with reference to analogous procedures in statistical physics.

Andrea Montanari hasn't uploaded this paper.

Let Andrea know you want this paper to be uploaded.

Ask for this paper to be uploaded.