430 search results - page 2 / 86 » On Using Satisfiability-Based Pruning Techniques in Covering... |
AAAI
2000
13 years 7 months ago
2000
Maxn (Luckhardt and Irani, 1986) is the extension of the minimax backup rule to multi-player games. We have shown that only a limited version of alpha-beta pruning, shallow prunin...
COMPSAC
2006
IEEE
13 years 12 months ago
2006
IEEE
Combinatorial covering arrays have been used in several testing approaches. This paper first discusses some existing methods for finding such arrays. Then a SAT-based approach a...
ICCAD
1997
IEEE
13 years 10 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
ICCAD
2006
IEEE
14 years 2 months ago
2006
IEEE
Ignoring the effect of simultaneous switching for logic gates causes silicon failures for high performance microprocessor designs. The main reason to omit this effect is the run...
ICML
1998
IEEE
14 years 6 months ago
1998
IEEE
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...