Empirical and Statistical Analysis of Genetic Programming with Linear Genome
Download:
|
|
by Nao Tokui, Hitoshl Iba
http://www.miv.t.u-tokyo.ac.jp/ibalab/papers/99/smc99.ps.gz
Add To MetaCart
Abstract:
The efficiency of a GP system largely depends on the representation of GP individuals. In the substitution for conventional S-expression or pointer-based systems, Linear GP, in which a program structure is represented as a linear genome, was proposed. This paper's primary research topic is the implementation of a fast, low memory consuming and ADF capable Linear GP system. In order to show the effectiveness, we statistically analyze the performance of the system with some benchmark experiments.
Citations
| 494 | Genetic Programming II: Automatic Discovery of Reusable Programs – Koza - 1994 |
| 23 | Genetic programming in C++: Implementation issues – Keith, Martin - 1994 |
| 16 | Two scientific applications of genetic programming: Stack filters and non-linear equation fitting to chaotic data – Oakley - 1994 |
| 2 | A representation scheme to perform program induction in a canonical genetic algorithm – Wineberg, Oppacher - 1994 |
| 1 | Geetie Programming: 0 the Programming of Computers by Meas of Natural lectio – Koza - 1992 |
| 1 | Genetic programming for feature discovery and image discrimination – Tackerr - 1993 |
| 1 | Recombmatimh 'electimh ad the Geodetic Cmstructim of Computer Programs – Tackerr - 1994 |
