Susceptibility Propagation for Constraint Satisfaction Problems

Details Susceptibility Propagation for Constraint Satisfaction Problems Susceptibility Propagation for Constraint Satisfaction Problems

2009-03-09

arxiv.org/abs/0903.1621v1

J. Phys.: Conf. Ser. 233(2010)012003

Physics

Condensed Matter

Disordered Systems and Neural Networks

17 pages, 5 figures

Scientific paper

10.1088/1742-6596/233/1/012003

We study the susceptibility propagation, a message-passing algorithm to compute correlation functions. It is applied to constraint satisfaction problems and its accuracy is examined. As a heuristic method to find a satisfying assignment, we propose susceptibility-guided decimation where correlations among the variables play an important role. We apply this novel decimation to locked occupation problems, a class of hard constraint satisfaction problems exhibited recently. It is shown that the present method performs better than the standard belief-guided decimation.

Affiliated with

Also associated with

No associations

Rating

Susceptibility Propagation for Constraint Satisfaction Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Susceptibility Propagation for Constraint Satisfaction Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Susceptibility Propagation for Constraint Satisfaction Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-96264