archives

An Arithmetic Test Suite for Genetic Programming


Home 

About 

Browse 

Search 

Register 

Subscriptions 

Deposit Papers 

Help
    

Ashlock, Dan and Lathrop, James I. (1996) An Arithmetic Test Suite for Genetic Programming. Technical Report TR96-02, Department of Computer Science, Iowa State University.

Full text available as:Postscript
Adobe PDF

Abstract

In this paper we explore a number of ideas for enhancing the techniques
of genetic programming in the context of a very simple test environment
that nevertheless possesses some degree of algorithmic subtlety.  We
term this genetic programming environment plus-one-recall-store (PORS).
This genetic programming environment is quite simple having only a pair
of terminals and a pair of operations.  The terminals are the number one
and recall from an external memory.  The operations are a unary store
operation and binary addition, +, on natural numbers.  In this paper
we present the PORS environment, present a mathematical description of
its properties, and then focus on testing the use of Markov chains in
generating, crossing over, and mutating evolving programs.  We obtain a
surprising indication of the correct situations in which to use Markov
chains during evolutionary program induction.

Subjects:All uncategorized technical reports
ID code:00000124
Deposited by:Staff Account on 25 April 1996



Contact site administrator at: ssg@cs.iastate.edu