Treedy: A heuristic for counting and sampling subsets
Treedy is a software library for for approximate weighted counting and sampling of subsets. This C++ implementation includes both Treedy and Sorted heuristics as well as the Exact algorithm for the weighted counting task, as described in the following article.
- Treedy: a heuristic for counting and sampling subset . 29th Conference on Uncertainty in Artificial Intelligence (UAI 2013)
Download the software here: Treedy-1.0.tar.gz
See README for more information.
In case of questions, suggestions or general feedback, please contact Teppo Niinimäki.