Fast Evolution of Custom Machine Representations

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

@InProceedings{huelsbergen:2005:CEC,
  author =       "Lorenz Huelsbergen",
  title =        "Fast Evolution of Custom Machine Representations",
  booktitle =    "Proceedings of the 2005 IEEE Congress on Evolutionary
                 Computation",
  year =         "2005",
  editor =       "David Corne and Zbigniew Michalewicz and 
                 Marco Dorigo and Gusz Eiben and David Fogel and Carlos Fonseca and 
                 Garrison Greenwood and Tan Kay Chen and 
                 Guenther Raidl and Ali Zalzala and Simon Lucas and Ben Paechter and 
                 Jennifier Willies and Juan J. Merelo Guervos and 
                 Eugene Eberbach and Bob McKay and Alastair Channon and 
                 Ashutosh Tiwari and L. Gwenn Volkert and 
                 Dan Ashlock and Marc Schoenauer",
  volume =       "1",
  pages =        "97--104",
  address =      "Edinburgh, UK",
  publisher_address = "445 Hoes Lane, P.O. Box 1331, Piscataway, NJ
                 08855-1331, USA",
  month =        "2-5 " # sep,
  organisation = "IEEE Computational Intelligence Society, Institution
                 of Electrical Engineers (IEE), Evolutionary Programming
                 Society (EPS)",
  publisher =    "IEEE Press",
  keywords =     "genetic algorithms, genetic programming",
  ISBN =         "0-7803-9363-5",
  URL =          "http://netlib.bell-labs.com/who/lorenz/papers/huelsbergen-cec2005.pdf",
  DOI =          "doi:10.1109/CEC.2005.1554672",
  abstract =     "Described are new approaches for evaluating computer
                 program representations for use in automated search
                 methodologies such as the evolutionary design of
                 software. Previously, program representations have been
                 either evaluated directly on raw hardware, providing
                 high speed but little control and flexibility; or,
                 programs were interpreted by a software interpreter
                 which can incorporate much flexibility into a program's
                 evaluation, but does so at a large cost in time due to
                 interpretation overheads.

                 Here we bridge this gap by providing intermediate
                 compilation techniques for machine representations that
                 approach the speed of running raw bits directly on
                 hardware, but that have all the flexibility and control
                 of custom instruction sets. In particular, we describe
                 two compilation techniques: the first uses just-in-time
                 compilation to convert a custom instruction sequence to
                 machine code; the second compiles an instruction set
                 specification into a specialised interpreter which
                 incurs only small overheads for instruction decoding.
                 We show that both techniques can provide manyfold
                 speedups over direct interpretation while retaining the
                 expressiveness of custom representations.",
  notes =        "CEC2005 - A joint meeting of the IEEE, the IEE, and
                 the EPS.

                 'complex control structures such as loops and
                 recursion'. 'branches...are always realtive to the
                 program counter' (target address fix_offset macro used
                 after crossover). JIT. 'MIPS instruction set
                 architecture as the target native machine'. Exact
                 number of instrauctions interprestted can be controlled
                 (ie limited) via termchk_macro.",
}

Genetic Programming entries for Lorenz Huelsbergen

Citations