Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Principles in the Evolutionary Design of Digital Circuits—Part I
Genetic Programming and Evolvable Machines
Shrinking the Genotype: L-systems for EHW?
ICES '01 Proceedings of the 4th International Conference on Evolvable Systems: From Biology to Hardware
Proceedings of the European Conference on Genetic Programming
Neutrality and the Evolvability of Boolean Function Landscape
EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
Towards the Automatic Design of More Efficient Digital Circuits
EH '00 Proceedings of the 2nd NASA/DoD workshop on Evolvable Hardware
Design of combinational logic circuits through an evolutionary multiobjective optimization approach
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Prokaryotic Bio-Inspired Model for Embryonics
AHS '09 Proceedings of the 2009 NASA/ESA Conference on Adaptive Hardware and Systems
Confidence intervals for computational effort comparisons
EuroGP'07 Proceedings of the 10th European conference on Genetic programming
Evolutionary design of gate-level polymorphic digital circuits
EC'05 Proceedings of the 3rd European conference on Applications of Evolutionary Computing
Redundancy and computational efficiency in Cartesian genetic programming
IEEE Transactions on Evolutionary Computation
The Automatic Acquisition, Evolution and Reuse of Modules in Cartesian Genetic Programming
IEEE Transactions on Evolutionary Computation
Evolving cell array configurations using CGP
EuroGP'11 Proceedings of the 14th European conference on Genetic programming
Hi-index | 0.00 |
This work is a study of the viability of using complex building blocks (termedmolecules) within the evolutionary computation paradigm of CGP; extending it to MolCGP. Increasing the complexity of the building blocks increases the design space that is to be explored to find a solution; thus, experiments were undertaken to find out whether this change affects the optimum parameter settings required. It was observed that the same degree of neutrality and (greedy) 1+4 evolution strategy gave optimum performance. The Computational Effort used to solve a series of benchmark problems was calculated, and compared with that used for the standard implementation of CGP. Significantly less Computational Effort was exerted by MolCGP in 3 out of 4 of the benchmark problems tested. Additionally, one of the evolved solutions to the 2-bit multiplier problem was examined, and it was observed that functionality present in the molecules, was exploited by evolution in a way that would be highly unlikely if using standard design techniques.