Co-evolving parasites improve simulated evolution as an optimization procedure
CNLS '89 Proceedings of the ninth annual international conference of the Center for Nonlinear Studies on Self-organizing, Collective, and Cooperative Phenomena in Natural and Artificial Computing Networks on Emergent computation
Proceedings of the 2002 ACM symposium on Applied computing
Aspects of Digital Evolution: Geometry and Learning
ICES '98 Proceedings of the Second International Conference on Evolvable Systems: From Biology to Hardware
Discovering Fuzzy Classification Rules with Genetic Programming and Co-evolution
PKDD '01 Proceedings of the 5th European Conference on Principles of Data Mining and Knowledge Discovery
Proceedings of the European Conference on Genetic Programming
The Test Vector Problem and Limitations to Evolving Digital Circuits
EH '00 Proceedings of the 2nd NASA/DoD workshop on Evolvable Hardware
A comprehensive survey of fitness approximation in evolutionary computation
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Application of genetic programming to the calibration of industrial robots
Computers in Industry
Evolutionary consequences of coevolving targets
Evolutionary Computation
Genetic Programming and Evolvable Machines
Coevolution of Fitness Predictors
IEEE Transactions on Evolutionary Computation
Acceleration of evolutionary image filter design using coevolution in cartesian GP
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Semantic bias in program coevolution
EuroGP'13 Proceedings of the 16th European conference on Genetic Programming
Hi-index | 0.00 |
Cartesian genetic programming (CGP) is a branch of genetic programming which has been utilized in various applications. This paper proposes to introduce coevolution to CGP in order to accelerate the task of symbolic regression. In particular, fitness predictors which are small subsets of the training set are coevolved with CGP programs. It is shown using five symbolic regression problems that the (median) execution time can be reduced 2---5 times in comparison with the standard CGP.