✦ LIBER ✦

Variable ordering for ordered binary decision diagrams by a divide-and-conquer approach

✍ Scribed by Yeh, F.-M.; Kuo, S.-Y.

Book ID: 114448306
Publisher: The Institution of Electrical Engineers
Year: 1997
Tongue: English
Weight: 684 KB
Volume: 144
Category: Article
ISSN: 1350-2387
DOI: 10.1049/ip-cdt:19971370

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Variable ordering algorithms for ordered

Variable ordering algorithms for ordered binary decision diagrams and their evaluation

✍ Fujita, M.; Fujisawa, H.; Matsunaga, Y. 📂 Article 📅 1993 🏛 IEEE 🌐 English ⚖ 706 KB

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

Finding the optimal variable ordering fo

Finding the optimal variable ordering for binary decision diagrams

✍ Friedman, S.J.; Supowit, K.J. 📂 Article 📅 1990 🏛 IEEE 🌐 English ⚖ 418 KB

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

A Reducibility Concept for Problems Defi

A Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams

✍ Ch. Meinel *, † , A. Slobodová 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 434 KB

Variable ordering for shared binary deci

Variable ordering for shared binary decision diagrams targeting node count and path length optimisation using particle swarm technique

✍ Mitra, A.; Chattopadhyay, S. 📂 Article 📅 2012 🏛 The Institution of Engineering and Technology 🌐 English ⚖ 373 KB