Sciweavers

11 search results - page 1 / 3
» Evolving binary decision diagrams using implicit neutrality
Sort
View
CEC
2005
IEEE
13 years 11 months ago
Evolving binary decision diagrams using implicit neutrality
Abstract- A new algorithm is presented for evolving Binary Decision Diagrams (BDD) that employs the neutrality implicit in the BDD representation. It is shown that an effortless ne...
Richard M. Downing
DEXA
2004
Springer
83views Database» more  DEXA 2004»
13 years 9 months ago
Efficient Rule Base Verification Using Binary Decision Diagrams
As their field of application has evolved and matured, the importance of verifying knowledge-based systems is now widely recognized. Nevertheless, some problems have remained. In t...
Christophe Mues, Jan Vanthienen
DATE
2003
IEEE
102views Hardware» more  DATE 2003»
13 years 10 months ago
Non-Enumerative Path Delay Fault Diagnosis
The first non-enumerative framework for diagnosing path delay faults using zero suppressed binary decision diagrams is introduced. We show that fault free path delay faults with ...
Saravanan Padmanaban, Spyros Tragoudas
ICCTA
2007
IEEE
13 years 9 months ago
What Graphs can be Efficiently Represented by BDDs?
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
Changxing Dong, Paul Molitor