![]() |
CiteULike | ![]() |
mcphee's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Phenotypical Building Blocks for Genetic Programmingby: Thomas Haynes
edited by: Thomas BackIn Genetic Algorithms: Proceedings of the Seventh International Conference (JanuarySeptember-FebruaryMarch 1997), pp. 26-33.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractThe theoretical foundations of genetic algorithms (GA) rest on the shoulders of the Schema Theorem, which states that the building blocks, highly fit compact subsets of the chromosome, are more likely to survive from one generation to the next. The theory of genetic programming (GP) is tenuous, borrowing heavily from that of GA. As the GP can be considered to be a GA operating on a tree structure, this borrowing is adequate for most. Part of the problem of tying GP theory to the schema theorem...
BibTeX record
RIS record