Sharing and Refinement for Reusable Subroutines of Genetic Programming

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

  author =       "Naohiro Hondo and Hitoshi Iba and Yukinori Kakazu",
  title =        "Sharing and Refinement for Reusable Subroutines of
                 Genetic Programming",
  booktitle =    "Proceedings of the 1996 {IEEE} International
                 Conference on Evolutionary Computation",
  year =         "1996",
  volume =       "1",
  pages =        "565--570",
  address =      "Nagoya, Japan",
  month =        "20-22 " # may,
  organisation = "IEEE Neural Network Council",
  keywords =     "genetic algorithms, genetic programming,
                 COAST,efficiency, reusable subroutines, subroutine
                 library, subroutine refinement, subroutine sharing,
                 wall-following problem, genetic algorithms, software
                 libraries, software performance evaluation, software
                 reusability, subroutines",
  ISBN =         "0-7803-2902-3",
  DOI =          "doi:10.1109/ICEC.1996.542661",
  size =         "6 pages",
  abstract =     "Presents a new approach to genetic programming (GP).
                 The aim of this study is to indicate an approach to
                 make GP fit for practical use. The objective of our
                 study originates in the fact that human-created
                 programs tend to be divided into subroutines that are
                 reused frequently. In traditional GP, the program is
                 structured as a single sequence. Moreover, there is no
                 room to reuse the subroutines in traditional GP. There
                 have been a few techniques proposed for dividing such
                 programs into subroutines, which attempt to discover
                 certain subroutines. However, the reusability of
                 genetic programs has not yet been discussed. In this
                 paper, we propose an approach for reusability. The
                 proposed method has a library for keeping the
                 subroutines in order to share and reuse them. We make
                 use of the wall-following problem to indicate the
                 efficiency of the method experimentally",
  notes =        "ICEC-96",

Genetic Programming entries for Naohiro Hondo Hitoshi Iba Yukinori Kakazu