A new class of function sets for solving sequence problems

  • Authors:
  • Simon Handley

  • Affiliations:
  • Stanford University, Stanford, CA

  • Venue:
  • GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.