A new algorithm for sampling CSP solutions uniformly at random

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4204 LNCS, Issue , 2006, Pages 711-715

  Gogate, Vibhav ^a   Dechter, Rina ^a  

^a Ringgold Standard Institution Informatics   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES;

CONSTRAINT NETWORK; CONSTRAINT SATISFACTION PROBLEM (CSP); PRUNING TECHNIQUES; SEARCH ALGORITHMS;

PROBLEM SOLVING;

EID: 33750316288     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11889205_56     Document Type: Conference Paper

References (6)

1. R. Dechter: Enhancement schemes for constraint processing: Backjumping, learning and cut-set decomposition. Artificial Intelligence, 41:273312, 1990.
2. Rina Dechter, Kalev Kask, Eyal Bin, and Roy Emek. Generating random solutions for constraint satisfaction problems. In AAAI, 2002.
3. Rina Dechter, Kalev Kask, and Robert Mateescu. Iterative join graph propagation. In UAI 02, pages 128136. Morgan Kaufmann, August 2002.
4. Vibhav Gogate and Rina Dechter. Approximate inference algorithms for hybrid bayesian networks with discrete constraints. UAI-2005, 2005.
5. Vibhav Gogate and Rina Dechter. A new algorithm for sampling csp solutions uniformly at random. Technical report, University of California, Irvine, 2006.
6. Wei Wei, Jordan Erenrich, and Bart Selman. Towards efficient sampling: Exploiting random walk strategies. In AAAI, 2004.