788 search results - page 16 / 158 » GA-Optimal Fitness Functions |
GECCO
2003
Springer
14 years 1 months ago
2003
Springer
We explore the advantages of DNA-like genomes for evolutionary computation in silico. Coupled with simulations of chemical reactions, these genomes offer greater efficiency, reliab...
CGF
2010
13 years 5 months ago
2010
Signed distance functions (SDF) to explicit or implicit surface representations are intensively used in various computer graphics and visualization algorithms. Among others, they ...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
In this paper we consider sampling based fitted value iteration for discounted, large (possibly infinite) state space, finite action Markovian Decision Problems where only a gener...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
Genetic algorithms (GAs) used in complex optimization domains usually need to perform a large number of fitness function evaluations in order to get near-optimal solutions. In rea...
CEC
2007
IEEE
13 years 9 months ago
2007
IEEE
— Computational complexity is a major challenge in evolutionary algorithms due to their need for repeated fitness function evaluations. Here, we aim to reduce number of fitness f...