Read's linear codes and genetic programming

Created by W.Langdon from gp-bibliography.bib Revision:1.7630

@InProceedings{Pelikan:1997:rlcGP,

• author = "Martin Pelikan and Vladimir Kvasnicka and Jiri Pospichal",
• title = "Read's linear codes and genetic programming",
• booktitle = "Genetic Programming 1997: Proceedings of the Second Annual Conference",
• editor = "John R. Koza and Kalyanmoy Deb and Marco Dorigo and David B. Fogel and Max Garzon and Hitoshi Iba and Rick L. Riolo",
• year = "1997",
• month = "13-16 " # jul,
• keywords = "genetic algorithms, genetic programming",
• pages = "268",
• address = "Stanford University, CA, USA",
• publisher_address = "San Francisco, CA, USA",
• publisher = "Morgan Kaufmann",
• URL = "http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/gp1997/Pelikan_1997_rlcGP.pdf",
• size = "1 page",
• abstract = "A theoretical base for efficient handling of mutation and crossover in Reads coding of rooted trees is given, which keeps correctness. Theorem for checking, whether for a given code there exists a corresponding rooted tree, is used by an algorithm for efficient generation of a correct code.",
• notes = "GP-97",

}

Genetic Programming entries for Martin Pelikan Vladimir Kvasnicka Jiri Pospichal

Citations