Evolution on Neutral Networks in Genetic Programming

In . pp. 207–221 (2006)
  Copy   BIBTEX

Abstract

We examine the behavior of an evolutionary search on neutral networks in a simple linear genetic programming system of a Boolean function space problem. To this end we draw parallels between notions in RNA-folding problems and in Genetic Programming, observe parameters of neutral networks and discuss the population dynamics via the occupation probability of network nodes in runs on their way to the optimal solution.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,830

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Neutral Networks Enable Distributed Search in Evolution.Joseph Renzullo, Stephanie Forrest & Melanie Moses - 2017 - Proceedings of the 4Th International Workshop on Genetic Improvement Workshop.

Analytics

Added to PP
2023-09-18

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references