Principles in the Evolutionary Design of Digital Circuits—Part I
Genetic Programming and Evolvable Machines
Principles in the Evolutionary Design of Digital Circuits—Part II
Genetic Programming and Evolvable Machines
Smoothness, ruggedness and neutrality of fitness landscapes: from theory to application
Advances in evolutionary computing
Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
Advanced techniques for the creation and propagation of modules in cartesian genetic programming
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Fitness landscape analysis and image filter evolution using functional-level CGP
EuroGP'07 Proceedings of the 10th European conference on Genetic programming
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
GECCO 2011 tutorial: cartesian genetic programming
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
GECCO 2012 tutorial: cartesian genetic programming
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
GECCO 2013 tutorial: cartesian genetic programming
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Hi-index | 0.00 |
The two-bit multiplier is a simple electronic circuit, small enough to be evolvable, and practically useful for the implementation of many digital systems. In this paper, we study the structure of the two-bit multiplier fitness landscapes generated by circuit evolution on an idealised model of a field-programmable gate array. The two-bit multiplier landscapes are challenging. The difficulty in studying these landscapes stems from the genotype representation which allows us to evolve the functionality and connectivity of an array of logic cells. Here, the genotypes are simply strings defined over two completely different alphabets. This makes the study of the corresponding landscapes much more involved. We outline a model for studying the two-bit multiplier landscapes and estimate the amplitudes derived from the Fourier transform of these landscapes. We show that the two-bit multiplier landscapes can be characterised in terms of subspaces, determined by the interactions between the genotype partitions.