16 search results - page 1 / 4 » Search Pruning Conditions for Boolean Optimization |
ECAI
2000
Springer
14 years 3 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...
CP
2011
Springer
12 years 11 months ago
2011
Springer
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
AI
1998
Springer
13 years 11 months ago
1998
Springer
The Multi-model search framework generalizes minimax to allow exploitation of recursive opponent models. In this work we consider adding pruning to the multi-model search. We prov...
DAC
1994
ACM
14 years 3 months ago
1994
ACM
A powerful combinational path sensitization engine is required for the efficient implementation of tools for test pattern generation, timing analysis, and delay fault testing. Path...
IDEAS
2002
IEEE
14 years 4 months ago
2002
IEEE
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...