Algebraic simplification of GP programs during evolution

GECCO 2006 - Genetic and Evolutionary Computation Conference

Volumn 1, Issue , 2006, Pages 927-934

  Wong, Phillip ^a   Zhang, Mengjie ^a,b  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b AGRICULTURAL UNIVERSITY OF HEBEI   (China)

Author keywords

Algebraic Simplification; Code Bloating; Genetic Programming; Online Simplification; Program Simplification

Indexed keywords

ALGEBRA; CODES (SYMBOLS); EVOLUTIONARY ALGORITHMS; MATHEMATICAL PROGRAMMING; ONLINE SYSTEMS; PROBLEM SOLVING; REDUNDANCY;

ALGEBRAIC SIMPLIFICATION; CODE BLOATING; GENETIC PROGRAMMING (GP); ONLINE SIMPLIFICATION; PROGRAM SIMPLIFICATION;

GENETIC ALGORITHMS;

EID: 33750258542     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1143997.1144156     Document Type: Conference Paper

References (17)

1. W. Banzhaf, P. Nordin, R. E. Keller, and F. D. Francone. Genetic Programming: An Introduction on the Automatic Evolution of computer programs and its Applications. Morgan Kaufmann Publishers, 1998.
2. T. Buckle and L. Thiele. Genetic programming and redundancy. In J. Hopf, editor, Genetic Algorithms within the Framework of Evolutionary Computation, pages 33-38, Germany, 1994.
3. J. Busch, J. Ziegler, C. Aue, A. Ross, D. Sawitzki, and W. Banzhaf. Automatic generation of control programs for walking robots using genetic programming. In EuroGP '02: Proceedings of the 5th European Conference on Genetic Programming, pages 258-267, London, UK, 2002.
4. B. Cherowitzo, 2006. Lecture Notes. http://www-math.cudenver.edu/ wcherowi/courses/m5410/exeucalg.html. Visited on 7 January 2006.
5. R. Fikes and N. Nilsson. Strips: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2:189-208, 1971.
6. A. Georghiades, P. Belhumeur, and D. Kriegman. From few to many: Illumination cone models for face recognition under variable lighting and pose. IEEE Trans. Pattern Anal. Mach. Intelligence, 23(6):643-660, 2001.
7. G. H. Gonnet. Determining equivalence of expressions in random polynomial time. In Proceedings of the sixteenth annual ACM symposium on Theory of computing, pages 334-341, New York, USA, 1984.
8. J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA, 1992.
9. J. R. Koza, M. A. Keane, M. J. Streeter, W. Mydlowec, J. Yu, and G. Lanza. Genetic Programming IV: Routine Human-Competitive Machine Intelligence. Kluwer Academic Publishers, 2003.
10. R. Lidl and H. Niederreiter. Introduction to finite fields and their applications. Cambridge University Press, New York, NY, USA, 1986.
11. T. Loveard and V. Ciesielski. Representing classification problems in genetic programming. In Proceedings of the Congress on Evolutionary Computation, volume 2, pages 1070-1077, Seoul, Korea, 2001. IEEE Press.
12. W. A. Martin. Determining the equivalence of algebraic expressions by hash coding. j-J-ACM, 18(4):549-558, Oct 1971.
13. R. Poli. Genetic programming for image analysis. In Proceedings of the First Annual Conference, pages 363-368, Stanford University, CA, USA, 28-31 July 1996. MIT Press.
14. T. Soule, J. A. Foster, and J. Dickinson. Code growth in genetic programming. In Proceedings of the First Annual Conference, pages 215-223, Stanford University, CA, USA, 28-31 1996. MIT Press.
15. W. Trappe and L. C. Washington. Introduction to Cryptograpy with Coding theory. Prentice-Hall, 2ed edition, 2006.
16. M. Zhang and V. Ciesielski. Genetic programming for. multiple class object detection. In Proceedings of the 12th Australian Joint Conference on Artificial Intelligence, volume 1747 of LNAI, pages 180-192, Sydney, Australia. 1999. Springer-Verlag.
17. M. Zhang and W. Smart. Multiclass object classification using genetic programming. In Applications of Evolutionary Computing, Evo Workshops2004, volume 3005 of LNCS, pages 369-378, Portugal. 2004. Springer Verlag.