25 search results - page 4 / 5 » cpaior 2008 |
CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. While several powerful methods exist for automatically detecting symmetries in instances of constraint satisfaction problems (CSPs), current methods for detecting symmetr...
CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Haplotype inference has relevant biological applications, and represents a challenging computational problem. Among others, pure parsimony provides a viable modeling appr...
CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a complete, constructive search technique that has been shown to out-perform standard constructive search techniques on ...
CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer
We consider the problem of estimating the model count (number of solutions) of Boolean formulas, and present two techniques that compute estimates of these counts, as well as eith...