Hierarchical Code Generators

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

  author =       "Mariusz Nowostawski",
  title =        "Hierarchical Code Generators",
  booktitle =    "ALife VIII Workshop proceedings",
  year =         "2002",
  editor =       "Eleanora Bilotta and Dominique Gross and Tom Smith and 
                 Tom Lenaerts and Seth Bullock and 
                 Henrik Hautup Lund and Jon Bird and Richard Watson and Pietro Pantano and 
                 Luigi Pagliarini and Hussein Abbass and 
                 Russell Standish and Mark Bedau",
  pages =        "63--71",
  address =      "Sydney, Australia",
  month =        "10 " # dec,
  keywords =     "genetic algorithms, genetic programming",
  ISBN =         "0-7317-0509-2",
  URL =          "http://www.alife.org/alife8/workshops/10.pdf",
  size =         "9 pages",
  abstract =     "Hierarchically organised recursive virtual machines
                 can be used as a novel dynamic hierarchies modelling
                 technique. Such a technique is based on the traditional
                 notion of computing machines. The discussed technique
                 allows a detailed analysis of different aspects of
                 hierarchical complex system decomposition, together
                 with the analysis of interactions between and within
                 different hierarchical levels. This may help to
                 understand a modelled problem or phenomenon better.
                 Comparisons with other methods from the field of
                 hierarchical evolutionary computation are provided and
                 simple examples (using Boolean algebra) are presented.
                 An approach to code generation called software growing
                 is proposed.",
  notes =        "http://alife8.alife.org

                 XOR parity growing solutions

                 Recursive functions. Cites Hastad,1989 saying prove
                 that minimal solution to n-parity is exponential in n.
                 Then uses _exhaustive search_ to solve n=2.",

Genetic Programming entries for Mariusz Nowostawski