Genetic engineering versus natural evolution: Genetic algorithms with deterministic operators

Journal of Systems Architecture

Volumn 48, Issue 1-3, 2002, Pages 99-112

  Jóźwiak, Lech ^a   Postuła, Adam ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

Automated design problem solving; Circuit synthesis; Evolutionary algorithms; Genetic algorithms; Genetic engineering; Heuristic search; Input support minimization

Indexed keywords

GENETIC ALGORITHMS; GENETIC ENGINEERING; HEURISTIC METHODS; MATHEMATICAL OPERATORS; OPTIMIZATION; PROBLEM SOLVING;

GENETIC ENGINEERING ALGORITHM (GEA);

COMPUTER ARCHITECTURE;

EID: 0036711523     PISSN: 13837621     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1383-7621(02)00094-2     Document Type: Article

References (42)

1. State assignment of finite state machines using a genetic algorithm
2. An overview of genetic algorithms - Part 1: Fundamentals
3. An overview of genetic algorithms - Part 2: Research topics
4. GAP: A genetic algorithm to optimize two-bit decoder PLAs
5. BDD representation of incompletely specified functions, international workshop on logic synthesis
6. Genetic algorithm based approach for integrated state assignment and flipflop selection in finite state machine synthesis
7. Two-level logic minimization: An overview
8. Evolutionary minimization of generalized Reed-Muller forms
9. Baldwinian learning utilizing genetic andheuristic algorithms for logic synthesis and minimization of incompletely specified data with generalized Reed-Muller (AND-EXOR) forms
10. Simulation of genetic systems
11. Multi-level logic minimization based on minimal support and its application to the minimization of look-up table type FPGAs
12. Selection criterion for a potentially inessential argument to be eliminated form an incompletely-specified logical function
13. Irredundant normal forms and minimal dependence sets of a Boolean function
14. Minimal input solutions
15. Parallel decomposition in logic synthesis
16. An efficient method for the sequential general decomposition of sequential machines
17. An efficient heuristic method for state assignment of large sequential machines
18. An efficient method for decomposition of multiple output Boolean functions and assigned sequential machines
19. General decomposition and its use in digital circuit synthesis
20. Input support minimization for efficient PLD and FPGA synthesis
21. Genetic algorithm for input support minimization
22. Information relationships and measures in application to logic design
23. Functional decomposition based on information relationship measures extremely effective for symmetric functions
24. Logic design of programmable logic arrays
25. Exact redundant state registers removal based on binary decision diagrams
26. Syntactic analysis of convergence in genetic algorithms
27. Algorithm of elimination of attributes and arguments based on unate complement concept
28. Rough sets and some aspects of logic synthesis
29. Implicit algorithms for multi-valued input support manipulation
30. Logic synthesis for look-up table based FPGAs using functional decomposition and support minimization
31. Simulated crossover in genetic algorithms
32. Division-based versus general decomposition-based multiple-level logic synthesis