✦ LIBER ✦

Terminal reliability using binary decision diagrams

✍ Scribed by H. Singh; S. Vaithilingam; R.K. Anne; L. Anneberg

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 140 KB
Volume: 36
Category: Article
ISSN: 0026-2714
DOI: 10.1016/0026-2714(95)00087-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast Binary Image Processing Using Binar

Fast Binary Image Processing Using Binary Decision Diagrams

✍ L. Robert; G. Malandain 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 284 KB

Many classical image processing tasks can be realized as evaluations of a boolean function over subsets of an image. For instance, the simplicity test used in 3D thinning requires examining the 26 neighbors of each voxel and computing a single boolean function of these inputs. In this article, we sh

Boolean satisfiability and equivalence c

Boolean satisfiability and equivalence checking using general Binary Decision Diagrams

✍ Pranav Ashar; Abhijit Ghosh; Srinivas Devadas 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 905 KB

Ordered binary decision diagrams as know

Ordered binary decision diagrams as knowledge-bases

✍ Takashi Horiyama; Toshihide Ibaraki 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 258 KB

We consider the use of ordered binary decision diagrams (OBDDs) as a means of realizing knowledge-bases, and show that, from the view point of space requirement, the OBDD-based representation is more efficient and suitable in some cases, compared with the traditional CNFbased and/or model-based repr

Using genetic algorithms for the variabl

Using genetic algorithms for the variable ordering of Reed-Muller binary decision diagrams

✍ A.E.A Almaini; N Zhuang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 604 KB

Translation among CNFs, characteristic m

Translation among CNFs, characteristic models and ordered binary decision diagrams

✍ Takashi Horiyama; Toshihide Ibaraki 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 118 KB

We consider translation among conjunctive normal forms (CNFs), characteristic models, and ordered binary decision diagrams (OBDDs) of Boolean functions. It is shown in this paper that Horn OBDDs can be translated into their Horn CNFs in polynomial time. As for the opposite direction, the problem can

On random orderings of variables for par

On random orderings of variables for parity ordered binary decision diagrams

✍ Petr Savický 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB

## Ordered binary decision diagrams (OBDDs) are a model for representing Boolean functions. There is also a more powerful variant called parity OBDDs. The size of the representation of a given function depends in both these models on the chosen ordering of the variables. It is known that there are