June 26 - 30, 2004
Saturday to Wednesday
Seattle, Washington, USA

 

 

Session:

MOD - Modularity, regularity and hierarchy in open-ended evolutionary computation

Title:

ACGP is a new method to explore regularity

   

Authors:

Cezary Z. Janikow

   

Abstract:

GP inherently is a technique for, and relies upon, exploration and exploitation of regularity. With ADFs, regularity translates into modularity. Regularity is explored both implicitly (evolution via crossover) and explicitly (as in ADFs). ACGP (Adaptable Constrained GP) offers a new way for GP to explore regularity of a different kind. It will have an impact on modularity as well. I will here briefly describe what kind of regularity ACGP explores, and how it differs from ADFs. As to how this is done, I will be presenting this during my regular presentation (ACGP was evolved for tree-based chromosomes, so this discussion is on trees).

Home

Program

Search

Author Index

Sponsors

Committee

Contact Us

Help