Toward Measuring the Scaling of Genetic Programming

02/13/2011
by   Mike Stimpson, et al.
0

Several genetic programming systems are created, each solving a different problem. In these systems, the median number of generations G needed to evolve a working program is measured. The behavior of G is observed as the difficulty of the problem is increased. In these systems, the density D of working programs in the universe of all possible programs is measured. The relationship G 1/sqrt(D) is observed to approximately hold for two program-like systems. For parallel systems (systems that look like several independent programs evolving in parallel), the relationship G 1/(n ln n) is observed to approximately hold. Finally, systems that are anti-parallel are considered.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/02/2011

Evolving a New Feature for a Working Program

A genetic programming system is created. A first fitness function f1 is ...
research
01/20/2023

MTGP: Combining Metamorphic Testing and Genetic Programming

Genetic programming is an evolutionary approach known for its performanc...
research
12/16/2020

Tag-based Genetic Regulation for Genetic Programming

We introduce and experimentally demonstrate tag-based genetic regulation...
research
11/30/2022

Genetic Programming with Local Scoring

We present new techniques for synthesizing programs through sequences of...
research
11/18/2017

Genetic Algorithms for Mentor-Assisted Evaluation Function Optimization

In this paper we demonstrate how genetic algorithms can be used to rever...
research
11/18/2017

Expert-Driven Genetic Algorithms for Simulating Evaluation Functions

In this paper we demonstrate how genetic algorithms can be used to rever...
research
12/01/2021

Evolving Open Complexity

Information theoretic analysis of large evolved programs produced by run...

Please sign up or login with your details

Forgot password? Click here to reset