Evolving Coupled Map Lattices for Computation

by

Andersson, C. and Nordahl, M., G.

Literature search on Evolutionary ComputationBBase ©1999-2013, Rasmus K. Ursem
     Home · Search · Adv. search · Authors · Login · Add entries   Webmaster
Note to authors: Please submit your bibliography and contact information - online papers are more frequently cited.

Info: Proceedings of the First European Workshop on Genetic Programming (Conference proceedings), 1998, p. 151-162
Keywords:genetic algorithms, genetic programming
Abstract:
Genetic Programming [GP] is used to evolve coupled map lattices for density classification. The most successful evolved rules depending only on nearest neighbors (r=1) show better performance than existing r=3 cellular automaton rules [CA] on this task.
Notes:
EuroGP'98

LNCS E-print:
Volume   first page   
NB: Papers are in PDF, not all are online, and you need access to Springer's Link archive.
Internet search:Search Google
Search Google Scholar
Search Citeseer using Google
Search Google for PDF
Search Google Scholar for PDF
Search Citeseer for PDF using Google

Review item:

Mark as doublet (will be reviewed)

Print entry



BibTex:
@InProceedings{Andersson:1998:ecmlc,
  author =       "Claes Andersson and Mats G. Nordahl",
  title =        "Evolving Coupled Map Lattices for Computation",
  booktitle =    "Proceedings of the First European Workshop on Genetic
                 Programming",
  year =         "1998",
  editor =       "Wolfgang Banzhaf and Riccardo Poli and Marc Schoenauer
                 and Terence C. Fogarty",
  volume =       "1391",
  series =       "LNCS",
  pages =        "151--162",
  address =      "Paris",
  publisher_address = "Berlin",
  month =        "14-15 " # apr,
  publisher =    "Springer-Verlag",
  keywords =     "genetic algorithms, genetic programming",
  ISBN =         "3-540-64360-5",
  abstract =     "Genetic Programming is used to evolve coupled map
                 lattices for density classification. The most
                 successful evolved rules depending only on nearest
                 neighbors (r=1) show better performance than existing
                 r=3 cellular automaton rules on this task.",
  notes =        "EuroGP'98",
}