Sciweavers

100 search results - page 1 / 20
» Combination of Lower Bounds in Exact BDD Minimization
Sort
View
DATE
2003
IEEE
46views Hardware» more  DATE 2003»
13 years 10 months ago
Combination of Lower Bounds in Exact BDD Minimization
Rüdiger Ebendt, Wolfgang Günther, Rolf D...
ASPDAC
2005
ACM
101views Hardware» more  ASPDAC 2005»
13 years 10 months ago
Lower bounds for dynamic BDD reordering
— In this paper we present new lower bounds on BDD size. These lower bounds are derived from more general lower bounds that recently were given in the context of exact BDD minimi...
Rüdiger Ebendt, Rolf Drechsler
DAC
1999
ACM
13 years 9 months ago
Using Lower Bounds During Dynamic BDD Minimization
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
Rolf Drechsler, Wolfgang Günther
CPAIOR
2007
Springer
13 years 11 months ago
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
Tarik Hadzic, John N. Hooker