A Divide and Conquer strategy for improving efficiency and probability of success in Genetic Programming

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

@InProceedings{eurogp06:FillonBartoli,
  author =       "Cyril Fillon and Alberto Bartoli",
  title =        "A Divide and Conquer strategy for improving efficiency
                 and probability of success in Genetic Programming",
  editor =       "Pierre Collet and Marco Tomassini and Marc Ebner and 
                 Steven Gustafson and Anik\'o Ek\'art",
  booktitle =    "Proceedings of the 9th European Conference on Genetic
                 Programming",
  publisher =    "Springer",
  series =       "Lecture Notes in Computer Science",
  volume =       "3905",
  year =         "2006",
  address =      "Budapest, Hungary",
  month =        "10 - 12 " # apr,
  organisation = "EvoNet",
  keywords =     "genetic algorithms, genetic programming",
  ISBN =         "3-540-33143-3",
  pages =        "13--23",
  email =        "cfillon@units.it",
  DOI =          "doi:10.1007/11729976_2",
  bibsource =    "DBLP, http://dblp.uni-trier.de",
  abstract =     "A common method for improving a genetic programming
                 search on difficult problems is either multiplying the
                 number of runs or increasing the population size. We
                 propose a new search strategy which attempts to obtain
                 a higher probability of success with smaller amounts of
                 computational resources. We call this model Divide &
                 Conquer since our algorithm initially partitions the
                 search space in smaller regions that are explored
                 independently of each other. Then, our algorithm
                 collects the most competitive individuals found in each
                 partition and exploits them in order to get a solution.
                 We benchmarked our proposal on three problem domains
                 widely used in the literature. Our results show a
                 significant improvement of the likelihood of success
                 while requiring less computational resources than the
                 standard algorithm.",
  notes =        "Part of \cite{collet:2006:GP} EuroGP'2006 held in
                 conjunction with EvoCOP2006 and EvoWorkshops2006",
}

Genetic Programming entries for Cyril Fillon Alberto Bartoli

Citations