Abstract
In this paper, we present a clean and simple formulation of survey propagation (SP) for constraint-satisfaction problems as “probabilistic token passing”. The result shows the importance of extending variable alphabets to their power sets in designing SP algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have