Module Generation for Genetic Programming and Its Incremental Evolution

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

  author =       "Takayoshi Naemura and Tomonori Hashiyama and 
                 Shigeru Okuma",
  title =        "Module Generation for Genetic Programming and Its
                 Incremental Evolution",
  booktitle =    "Second Asia-Pacific Conference on Simulated Evolution
                 and Learning",
  year =         "1998",
  editor =       "R. I. Bob McKay and X. Yao and Charles S. Newton and 
                 J.-H. Kim and T. Furuhashi",
  address =      "Australian Defence Force Academy, Canberra,
  month =        "24-27 " # nov,
  keywords =     "genetic algorithms, genetic programming",
  broken =       "",
  URL =          "",
  URL =          "",
  abstract =     "This paper presents a new approach to acquire
                 effective modules or function nodes in Genetic
                 Programming (GP). Tree structured chromosome can be
                 handled with GP. The performance of GPs highly depends
                 on the design of primitive functions. The aim of this
                 paper is to propose a method to determine the primitive
                 function nodes. To overcome these difficulties in the
                 GP, various kinds of method were introduced,
                 Automatically Defined Function(ADF), Module
                 Acquisition(MA) and Collective ADF for...",
  notes =        "SEAL'98 Possible publication in springer-verlag LNAI
                 series SEAL98#064 Not published in LNAI 1585?

                 ADF, MA, COAST, NAND gates, parity problem (incremental

Genetic Programming entries for Takayoshi Naemura Tomonori Hashiyama Shigeru Okuma