Genetic Programming
Lecture notes in computer sciencePublished 1 January 1998Open access
Wolfgang Banzhaf, Terence C. Fogarty, Marc Schoenauer, Riccardo Poli
Citations824
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
This book constitutes the refereed proceedings of the First European Workshop on Genetic Programming, EuroGP'98, held in Paris, France, in April 1998, under the sponsorship of EvoNet, the European Net
Keywords
Computer Science
Lecture notes in computer scienceGrammatical evolution: Evolving programs for an arbitrary language
736 Citations1998Conor Ryan, JJ Collins +1 more
A Genetic Algorithm that can evolve complete programs, using a variable length linear genome to govern how a Backus Naur Form grammar definition is mapped to a program, expressions and programs of arbitrary complexity may be evolved.
Lecture notes in computer scienceNon-destructive depth-dependent crossover for genetic programming
44 Citations1998Takuya Ito, Hitoshi Iba +1 more
A non-destructive depth-dependent crossover is introduced, in which each offspring is kept only if its fitness is better than that of its parent, to solve the difficulty of the blind application of the normal crossover.
Lecture notes in computer scienceEfficient evolution of asymmetric recurrent neural networks using a PDGP-inspired two-dimensional representation
24 Citations1998João Carlos Figueira Pujol, Riccardo Poli
A new method to build recurrent neural networks based on evolutionary computation is presented, which combines a linear chromosome with a two-dimensional representation inspired by Parallel Distributed Genetic Programming to evolve the architecture and the weights simultaneously.
Lecture notes in computer scienceEvolving coupled map lattices for computation
5 Citations1998Claes Andersson, Mats G. Nordahl
Genetic programming is used to evolve coupled map lattices for density classification and the most successful evolved rules depending only on nearest neighbors show better performance than existing r = 3 cellular automaton rules on this task.