Computational Complexity Results for Genetic Programming and the Sorting Problem

03/29/2011
by   Markus Wagner, et al.
0

Genetic Programming (GP) has found various applications. Understanding this type of algorithm from a theoretical point of view is a challenging task. The first results on the computational complexity of GP have been obtained for problems with isolated program semantics. With this paper, we push forward the computational complexity analysis of GP on a problem with dependent program semantics. We study the well-known sorting problem in this context and analyze rigorously how GP can deal with different measures of sortedness.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/27/2010

Computational Complexity Analysis of Simple Genetic Programming On Two Problems Modeling Isolated Program Semantics

Analyzing the computational complexity of evolutionary algorithms for bi...
research
03/22/2012

Computational Complexity Analysis of Multi-Objective Genetic Programming

The computational complexity analysis of genetic programming (GP) has be...
research
08/11/2014

Genetic Programming for Smart Phone Personalisation

Personalisation in smart phones requires adaptability to dynamic context...
research
02/07/2005

Scalability of Genetic Programming and Probabilistic Incremental Program Evolution

This paper discusses scalability of standard genetic programming (GP) an...
research
03/03/2023

Vectorial Genetic Programming – Optimizing Segments for Feature Extraction

Vectorial Genetic Programming (Vec-GP) extends GP by allowing vectors as...
research
03/20/2022

Strategic Analysis to defend against Griefing Attack in Lightning Network

Payments routed in Lightning Network are susceptible to a griefing attac...
research
09/25/2020

Semantic-based Distance Approaches in Multi-objective Genetic Programming

Semantics in the context of Genetic Program (GP) can be understood as th...

Please sign up or login with your details

Forgot password? Click here to reset