Results 1 
4 of
4
Operator Adaptation in Evolutionary Computation and its Application to Structure Optimization of Neural Networks
, 2001
"... In this study, we give a brief overview of search strategy adaptation in evolutionary computation. The ..."
Abstract

Cited by 17 (7 self)
 Add to MetaCart
In this study, we give a brief overview of search strategy adaptation in evolutionary computation. The
Reducing the Number of Fitness Evaluations in Graph Genetic Programming Using a Canonical Graph Indexed Database
 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION
, 2007
"... We describe the genetic programming system GGP operating on graphs and introduce the notion of graph isomorphisms to explain how they influence the dynamics of GP. It is shown empirically how fitness databases can improve the performance of GP and how mapping graphs to a canonical form can increase ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
We describe the genetic programming system GGP operating on graphs and introduce the notion of graph isomorphisms to explain how they influence the dynamics of GP. It is shown empirically how fitness databases can improve the performance of GP and how mapping graphs to a canonical form can increase these improvements by saving considerable evaluation time.
Evolving springmass models: a testbed for graph encoding schemes
 in Proceedings of Congress on Evolutionary Computation, 2002
, 1952
"... For many interesting design problems the solution is most naturally represented as a type of graph. This paper proposes that the problem of evolving springmass models for a set of design challenges makes an excellent testbed for evaluating the performance of various graph encoding schemes. We desc ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
For many interesting design problems the solution is most naturally represented as a type of graph. This paper proposes that the problem of evolving springmass models for a set of design challenges makes an excellent testbed for evaluating the performance of various graph encoding schemes. We describe how the problem is set up, and introduce a planar graph coding scheme. Results demonstrate that the planar graph encoding scheme significantly outperforms a simple direct encoding scheme on a heightchallenge design problem. 1