Source coding by efficient selection of ground states clusters

Details Source coding by efficient selection of ground states clusters Source coding by efficient selection of ground states clusters

2004-12-23

arxiv.org/abs/cond-mat/0412652v1

Phys. Rev. E 72, 015103 (2005)

Physics

Condensed Matter

Disordered Systems and Neural Networks

4 pages, 4 figures

Scientific paper

10.1103/PhysRevE.72.015103

In this letter, we show how the Survey Propagation algorithm can be generalized to include external forcing messages, and used to address selectively an exponential number of glassy ground states. These capabilities can be used to explore efficiently the space of solutions of random NP-complete constraint satisfaction problems, providing a direct experimental evidence of replica symmetry breaking in large-size instances. Finally, a new lossy data compression protocol is introduced, exploiting as a computational resource the clustered nature of the space of addressable states.

Affiliated with

Also associated with

No associations

Rating

Source coding by efficient selection of ground states clusters 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 Source coding by efficient selection of ground states clusters, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Source coding by efficient selection of ground states clusters will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-93687