Sciweavers

CP
2008
Springer

Approximate Solution Sampling (and Counting) on AND/OR Spaces

14 years 1 months ago
Approximate Solution Sampling (and Counting) on AND/OR Spaces
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampling/Importance Resampling (SIR) component of our previous scheme of SampleSearch-SIR by taking advantage of the decomposition implied by the network's AND/OR search space. We also describe how our new scheme can approximately count and lower bound the number of solutions of a constraint network. We demonstrate both theoretically and empirically that our new algorithm yields far better performance than competing approaches.
Vibhav Gogate, Rina Dechter
Added 18 Oct 2010
Updated 18 Oct 2010
Type Conference
Year 2008
Where CP
Authors Vibhav Gogate, Rina Dechter
Comments (0)