9 search results - page 2 / 2 » An Automata-Theoretic Algorithm for Counting Solutions to Pr... |
CP
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. In this paper we consider the problem of computing the density of states of a Boolean formula in CNF, a generalization of both MAX-SAT and model counting. Given a Boolean...
RECOMB
2009
Springer
14 years 10 days ago
2009
Springer
In genome rearrangements, the double cut and join (DCJ) operation, introduced by Yancopoulos et al., allows to represent most rearrangement events that could happen in multichromos...
JMMA
2010
13 years 10 days ago
2010
An original algorithm is presented that generates both restricted integer compositions and restricted integer partitions that can be constrained simultaneously by a) upper and low...
CIE
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...