2 search results - page 1 / 1 » Quasi-Exact BDD Minimization Using Relaxed Best-First Search |
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 ...