Recurrences with fixed base cases in genetic programming

  • Authors:

  • Stefan J. Johansson

  • Affiliations:

  • University of Karlskrona/Ronneby, Ronneby, Sweden

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new approach to how to evolve integer recurrences using Genetic Programming (GP) is taken where the recurrences fix their base cases in accordance with the set of test cases instead of evolving them. A number of experiments indicate that this approach outperforms the old one as well as random search in finding non-trivial recurrences.