144 search results - page 24 / 29 » The complexity of Boolean formula minimization |
ICCAD
2009
IEEE
13 years 5 months ago
2009
IEEE
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...
AAAI
2010
13 years 7 months ago
2010
The goal of testing is to discriminate between multiple hypotheses about a system--for example, different fault diagnoses--by applying input patterns and verifying or falsifying t...
FOSSACS
2009
Springer
13 years 11 months ago
2009
Springer
In quantitative verification, system states/transitions have associated costs, and these are used to associate mean-payoff costs with infinite behaviors. In this paper, we propose ...
TAMC
2007
Springer
14 years 1 months ago
2007
Springer
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...