Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Shared binary decision diagram with attributed edges for efficient Boolean function manipulation
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Boolean matching using generalized Reed-Muller forms
DAC '94 Proceedings of the 31st annual Design Automation Conference
DAC '94 Proceedings of the 31st annual Design Automation Conference
Sequential circuit test generation in a genetic algorithm framework
DAC '94 Proceedings of the 31st annual Design Automation Conference
Fast OFDD based minimization of fixed polarity Reed-Muller expressions
EURO-DAC '94 Proceedings of the conference on European design automation
A macro-cell global router based on two genetic algorithms
EURO-DAC '94 Proceedings of the conference on European design automation
Interleaving based variable ordering methods for ordered binary decision diagrams
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Dynamic variable ordering for ordered binary decision diagrams
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
OFDD Based Minimization of Fixed Polarity Reed-Muller Expressions Using Hybrid Genetic Algorithms
ICCS '94 Proceedings of the1994 IEEE International Conference on Computer Design: VLSI in Computer & Processors
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
On the Relation Betwen BDDs and FDDs
LATIN '95 Proceedings of the Second Latin American Symposium on Theoretical Informatics
A Genetic Algorithm for Channel Routing Problem
Proceedings of the 5th International Conference on Genetic Algorithms
Sympathy: fast exact minimization of fixed polarity Reed-Muller expressions for symmetric functions
EDTC '95 Proceedings of the 1995 European conference on Design and Test
On variable ordering of binary decision diagrams for the application of multi-level logic synthesis
EURO-DAC '91 Proceedings of the conference on European design automation
| Hi-index | 0.00 |
A genetic algorithm (GA) is applied to find decomposition type lists (DTLs) that minimize the size of ordered Kronecker functional decision diagrams (OKFDDs). OKFDDs are a data structure for representation and manipulation of Boolean functions. The choice of the DTL largely influences the size of the OKFDD, i.e. its size may vary from polynomial to exponential. In Dreschsler, Becker, and Jahnke (1995) heuristic methods have been presented. In this paper the authors show by experiments that better results can be obtained by using GAs.