Advanced Search

Finite Energy Survey Propagation for Constraint Satisfaction Problems

Research and Teaching Output of the MIT Community

Show simple item record Chieu, Hai Leong 2007-01-26T16:12:47Z 2007-01-26T16:12:47Z 2007-01
dc.description.abstract The Survey Propagation (SP) algorithm [1] has recently been shown to work well in the hard region for random K-SAT problems. SP has its origins in sophisticated arguments in statistical physics, and can be derived from an approach known as the cavity method, when applied at what is called the one-step replica symmetry breaking level. In its most general form, SP can be applied to general constraint satisfaction problems, and can also be used in the unsatisfiable region, where the aim is to minimize the number of violated constraints. In this paper, we formulate the SP-Y algorithm for general constraint satisfaction problems, applicable for minimizing the number of violated constraints. This could be useful, for example, in solving approximate subgraph isomorphism problems. Preliminary results show that SP can solve a few instances of induced subgraph isomorphism for which belief propagation failed to converge. en
dc.description.sponsorship Singapore-MIT Alliance (SMA) en
dc.format.extent 577133 bytes
dc.format.mimetype application/pdf
dc.language.iso en en
dc.relation.ispartofseries Computer Science (CS) en
dc.subject Survey Propagation en
dc.subject Constraint Satisfaction Problems en
dc.subject Subgraph Isomorphism en
dc.title Finite Energy Survey Propagation for Constraint Satisfaction Problems en
dc.type Article en

Files in this item

Name Size Format Description
CS004.pdf 563.6Kb PDF

This item appears in the following Collection(s)

Show simple item record