A New Algorithm for Sampling CSP Solutions Uniformly at Random

@inproceedings{Gogate2006ANA,
  title={A New Algorithm for Sampling CSP Solutions Uniformly at Random},
  author={Vibhav Gogate and Rina Dechter},
  booktitle={CP},
  year={2006}
}
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. Our method relies on expressing the constraint network as a uniform probability distribution over its solutions and then sampling from the distribution using state-of-the-art probabilistic sampling schemes. To speed up the rate at which random solutions are generated, we augment our sampling schemes with pruning techniques used successfully in the CSP literature such as conflict… CONTINUE READING
Highly Cited
This paper has 40 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

A new algorithm for sampling csp solutions uniformly at random

  • Vibhav Gogate, Rina Dechter
  • Technical report,
  • 2006
1 Excerpt

Yedidia , William T . Freeman , and Yair Weiss . Generalized belief propagation

  • S. Jonathan
  • 2004

Bayesian inference in econometric models using monte carlo integration

  • John Geweke
  • Econometrica
  • 1989

Similar Papers

Loading similar papers…