Introduction to finite fields and their applications
Introduction to finite fields and their applications
Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Determining the Equivalence of Algebraic Expressions by Hash Coding
Journal of the ACM (JACM)
From Few to Many: Illumination Cone Models for Face Recognition under Variable Lighting and Pose
IEEE Transactions on Pattern Analysis and Machine Intelligence
Genetic Programming for Feature Discovery and Image Discrimination
Proceedings of the 5th International Conference on Genetic Algorithms
Genetic Programming for Multiple Class Object Detection
AI '99 Proceedings of the 12th Australian Joint Conference on Artificial Intelligence: Advanced Topics in Artificial Intelligence
Automatic Generation of Control Programs for Walking Robots Using Genetic Programming
EuroGP '02 Proceedings of the 5th European Conference on Genetic Programming
Determining equivalence of expressions in random polynomial time
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Introduction to Cryptography with Coding Theory (2nd Edition)
Introduction to Cryptography with Coding Theory (2nd Edition)
Genetic programming for image analysis
GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
A survey and taxonomy of performance improvement of canonical genetic programming
Knowledge and Information Systems
A relaxed approach to simplification in genetic programming
EuroGP'10 Proceedings of the 13th European conference on Genetic Programming
Hi-index | 0.00 |
This paper describes an approach to online simplification of evolved programs in genetic programming (GP). Rather than manually simplifying genetic programs after evolution for interpretation purposes only, this approach automatically simplifies programs during evolution. In this approach, algebraic simplification rules, algebraic equivalence and prime techniques are used to simplify genetic programs. The simplification based GP system is examined and compared to a standard GP system on a regression problem and a classification problem. The results suggest that, at certain frequencies or proportions, this system can not only achieve superior performance to the standard system on these problems, but also significantly reduce the sizes of evolved programs.