A New Class of Function Sets For Solving Sequence Problems
The MIT Press eBooks · 1996
This paper presents an extension of genetic programming that facilitates the solution of problems whose instances are most naturally represented as arbitrary-length sequences (sequence problems). This new technique is simple, easy to implement, expressive, efficient, and doesn't require arbitrary time-outs. The technique is demonstrated on a concrete problem: classifying pinochle poker hands.