1159 search results - page 131 / 232 » Binary Decision Graphs |
165
Voted
ICCD
1995
IEEE
15 years 9 months ago
1995
IEEE
– This paper describes a new technique for extracting clock-level finite state machines(FSMs) from transistor netlists using symbolic simulation. The transistor netlist is prepr...
171
click to vote
CAV
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. Constrained random simulation is supported by constraint solvers integrated within simulators. These constraint solvers need to be fast and memory efficient to maintain s...
127
Voted
ASPDAC
2005
ACM
15 years 7 months ago
2005
ACM
It has been shown that Binary Decision Diagram (BDD) based logic synthesis enjoys faster runtime than the classic logic synthesis systems based on Sum of Product (SOP) form. Howev...
156
Voted
ALENEX
2007
15 years 7 months ago
2007
In polyhedral studies of 0/1 polytopes two prominent problems exist. One is the vertex enumeration problem: Given a system of inequalities, enumerate its feasible 0/1 points. Anot...
127
Voted
CDES
2007
15 years 7 months ago
2007
—Fault collapsing is the process of reducing the number of faults by using redundance and equivalence/dominance relationships among faults. Exact global fault collapsing can be e...