Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
A genetic algorithm for the minimization of OPKFDDs
- Issue Date
- Dec-2002
- Publisher
- Oxford University Press
- Keywords
- OBDD; OPKFDD; GA; variable ordering; decomposition
- Citation
- IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, v.E85A, no.12, pp 2943 - 2945
- Pages
- 3
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Volume
- E85A
- Number
- 12
- Start Page
- 2943
- End Page
- 2945
- ISSN
- 0916-8508
1745-1337
- Abstract
- OPKFDDs (Ordered Pseudo-Kronecker Functional Decision Diagrams) are a data structure that provides compact representation of Boolean functions. The size of OPKFDDs depends on a variable ordering and on decomposition type choices. Finding an optimal representation is very hard and the size of the search space is n! (.) 3(2n-1), where n is the number of input variables. To overcome the huge search space of the problem, a genetic algorithm is proposed for the generation of OPKFDDs with minimal number of nodes.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - COLLEGE OF COMPUTING > SCHOOL OF COMPUTER SCIENCE > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.