5 search results - page 1 / 1 » Combining ordered best-first search with branch and bound fo... |
ASPDAC
2004
ACM
13 years 10 months ago
2004
ACM
ISVLSI
2005
IEEE
13 years 10 months ago
2005
IEEE
In this paper we present a new method for quasiexact optimization of BDDs using relaxed ordered best-first search. This general method is applied to BDD minimization. In contrast...
KI
2006
Springer
13 years 4 months ago
2006
Springer
Abstract. In this paper, a framework for previous and new quasi-exact extensions of the A -algorithm is presented. In contrast to previous approaches, the new methods guarantee to ...
CP
2009
Springer
13 years 2 months ago
2009
Springer
We describe a new exact solver for the minimization of open stacks problem (MOSP). By combining nogood recording with a branch and bound strategy based on choosing which customer s...
FMCAD
2000
Springer
13 years 8 months ago
2000
Springer
Image computation nds wide application in VLSI CAD, such as state reachability analysis in formal veri cation and synthesis, combinational veri cation, combinational and sequential...