On the Time Complexity of Simple Cartesian Genetic Programming

Roman Kalkreuth; Andre Droschinsky

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

On the Time Complexity of Simple Cartesian Genetic Programming

Topics: Evolutionary Search and Meta-heuristics

In Proceedings of the 11th International Joint Conference on Computational Intelligence - Volume 0IJCCI, 172-179, 2019 , Vienna, Austria

Authors: Roman Kalkreuth and Andre Droschinsky

Affiliation: Department of Computer Science, TU Dortmund University, Otto-Hahn-Straße 14, Dortmund and Germany

Keyword(s): Cartesian Genetic Programming, Runtime Analysis, Theory.

Abstract: Since its introduction, Cartesian Genetic Programming has been mostly analyzed on an experimental level with boolean function problems. Consequently, there is still little theoretical understanding of Cartesian Genetic Programming. In this paper, we present a first time complexity analysis of Cartesian Genetic Programming. We introduce and analyze a simple mathematical problem and a simple logical boolean problem called SUM and AND. The results of our analysis show that simple CGP is able to solve SUM efficiently in time Θ(nlogn). However, our analysis of the AND problem shows that simple CGP is not able to solve AND efficiently.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 3.145.70.14

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Kalkreuth, R. and Droschinsky, A. (2019). On the Time Complexity of Simple Cartesian Genetic Programming. In Proceedings of the 11th International Joint Conference on Computational Intelligence (IJCCI 2019) - ECTA; ISBN 978-989-758-384-1; ISSN 2184-3236, SciTePress, pages 172-179. DOI: 10.5220/0008070201720179

@conference{ecta19,
author={Roman Kalkreuth and Andre Droschinsky},
title={On the Time Complexity of Simple Cartesian Genetic Programming},
booktitle={Proceedings of the 11th International Joint Conference on Computational Intelligence (IJCCI 2019) - ECTA},
year={2019},
pages={172-179},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0008070201720179},
isbn={978-989-758-384-1},
issn={2184-3236},
}

TY - CONF

JO - Proceedings of the 11th International Joint Conference on Computational Intelligence (IJCCI 2019) - ECTA
TI - On the Time Complexity of Simple Cartesian Genetic Programming
SN - 978-989-758-384-1
IS - 2184-3236
AU - Kalkreuth, R.
AU - Droschinsky, A.
PY - 2019
SP - 172
EP - 179
DO - 10.5220/0008070201720179
PB - SciTePress