160 search results - page 12 / 32 » Satisfiability-Based Algorithms for Boolean Optimization |
ICCAD
2007
IEEE
15 years 6 months ago
2007
IEEE
—We present an implementation of an algorithm for constructing provably fast circuits for a class of Boolean functions with input signals that have individual starting times. We ...
110
click to vote
TACAS
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
Gene regulatory networks (GRNs) are complex control systems that govern the interaction of genes, which ultimately control cellular processes at the protein level. GRNs can be ted...
CP
2005
Springer
15 years 3 months ago
2005
Springer
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
DATE
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper describes an improved approach to Boolean network optimization using internal don’t-cares. The improvements concern the type of don’t-cares computed, their scope, a...