A performance comparison of tree-based genetic programming versus stack-based genetic programming using the Java virtual machine

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

@PhdThesis{oai:xtcat.oclc.org:OCLCNo/ocm46917449,
  title =        "A performance comparison of tree-based genetic
                 programming versus stack-based genetic programming
                 using the Java virtual machine",
  author =       "Robert J. Steinhoff",
  year =         "2000",
  description =  "Typescript.; Thesis (Ph. D.)--Nova Southeastern
                 University, 2000.; Includes bibliographical references
                 (leaves 180-184).",
  oai =          "oai:xtcat.oclc.org:OCLCNo/ocm46917449",
  school =       "Graduate School of Computer and Information Sciences,
                 Nova Southeastern University",
  address =      "Fort Lauderdale, Florida, USA",
  month =        oct,
  keywords =     "genetic algorithms, genetic programming, Java
                 (Computer program language)",
  URL =          "http://www.worldcat.org/title/performance-comparison-of-tree-based-genetic-programming-versus-stack-based-genetic-programming-using-the-java-virtual-machine/oclc/46917449",
  URL =          "http://phdtree.org/pdf/25335058-a-performance-comparison-of-tree-based-genetic-programming-versus-stack-based-genetic-programming-using-the-java-virtual-machine/",
  URL =          "http://search.proquest.com/docview/304679341",
  size =         "196 pages",
  abstract =     "Stack-based genetic programming uses variable length,
                 linear programs executing on a virtual stack machine.
                 This concept was proposed and evaluated by Timothy
                 Perkis. The Java programming language uses a
                 stack-based virtual machine to perform operations. This
                 paper examined the possibility of performing
                 stack-based genetic programming directly using the
                 stack on the Java virtual machine. The problems of
                 combining stack-based genetic programming with the Java
                 virtual machine stack were explored. Excessive runtime
                 delay on bytecode verification of the chromosome
                 carrying classes undergoing fitness evaluation was
                 identified. Another problem is that the Java virtual
                 machine stack must be tightly controlled and cannot
                 have illegal operands. Direct comparison of stack-based
                 genetic programming on the Java virtual machine to
                 common tree-based genetic programming was not performed
                 due to discovered flaws in the architecture. A
                 practical model to implement stack-based genetic
                 programming on the Java virtual machine using a class
                 bytecode assembler was proposed. This model combines
                 the GPsys genetic programming system with the JAS
                 bytecode assembler resulting in an architecture called
                 GPsys-JAS. A further recommendation to compare
                 stack-based genetic programming on the Java virtual
                 machine against stack-based genetic programming using
                 the Java Stack class was suggested.",
  notes =        "www.scis.nova.edu/Doctoral/
                 Director/dissertation/DissertationList.pdf

                 Supervisor: S. Rollins Guild

                 Robert James Steinhoff

                 p8 'I am indebted to Adil Qureshi who built the GPsys
                 genetic programming system'

                 UMI Microform 3012905",
}

Genetic Programming entries for Robert J Steinhoff

Citations