Constraint Satisfaction by Survey Propagation

Physics – Condensed Matter – Disordered Systems and Neural Networks

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

8 pages, 5 figures

Scientific paper

Survey Propagation is an algorithm designed for solving typical instances of
random constraint satisfiability problems. It has been successfully tested on
random 3-SAT and random $G(n,\frac{c}{n})$ graph 3-coloring, in the hard region
of the parameter space. Here we provide a generic formalism which applies to a
wide class of discrete Constraint Satisfaction Problems.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Constraint Satisfaction by Survey Propagation 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 Constraint Satisfaction by Survey Propagation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constraint Satisfaction by Survey Propagation will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-575536

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.