Learning monitoring strategies: A difficult genetic programming application   [GP]

by

Atkin, M., S. and Cohen, P., R.

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 1994 IEEE World Congress on Computational Intelligence (Conference proceedings), 1994, p. 328-332a
Keywords:genetic algorithms, genetic programming, cupcake problem
Notes:
Novel? chrome/program structure linear, close to assembly lanuage, used GOTOs and interrupt handlers. Did _not_ get performance improvement on changing to parse trees. Did evolve progs to control agents which moved to the goal without colliding with an obstacle. Finally cautions about problems with GP scaling up. "Also tried local mating (also known as fine grain parallelism)" Also available as Technical Report 94-52, Dept. of Computer Science, University of Massachusetts/Amherst, USA?
URL(s):Postscript
(G)zipped postscript

Review item:

Mark as doublet (will be reviewed)

Print entry




BibTex:
@InProceedings{Atkin:1994:LMSDGP,
  author =       "Marc S. Atkin and Paul R. Cohen",
  title =        "Learning monitoring strategies: {A} difficult genetic
                 programming application",
  booktitle =    "Proceedings of the 1994 IEEE World Congress on
                 Computational Intelligence",
  year =         "1994",
  pages =        "328--332a",
  address =      "Orlando, Florida, USA",
  month =        "27-29 " # jun,
  publisher =    "IEEE Press",
  keywords =     "genetic algorithms, genetic programming, cupcake
                 problem",
  URL =          "http://eksl-www.cs.umass.edu/papers/IEEE.ps",
  notes =        "Novel? chrome/program structure linear, close to
                 assembly lanuage, used GOTOs and interrupt handlers.
                 Did _not_ get performance improvement on changing to
                 parse trees. Did evolve progs to control agents which
                 moved to the goal without colliding with an obstacle.
                 Finally cautions about problems with GP scaling
                 up.

                 {"}Also tried local mating (also known as fine grain
                 parallelism){"}

                 Also available as Technical Report 94-52, Dept. of
                 Computer Science, University of Massachusetts/Amherst,
                 USA?",
}