Sciweavers

118 search results - page 6 / 24
» Fitness Clouds and Problem Hardness in Genetic Programming
Sort
View
FLAIRS
2006
13 years 9 months ago
Improving Modularity in Genetic Programming Using Graph-Based Data Mining
We propose to improve the efficiency of genetic programming, a method to automatically evolve computer programs. We use graph-based data mining to identify common aspects of highl...
Istvan Jonyer, Akiko Himes
GECCO
2006
Springer
156views Optimization» more  GECCO 2006»
13 years 11 months ago
Improving GP classifier generalization using a cluster separation metric
Genetic Programming offers freedom in the definition of the cost function that is unparalleled among supervised learning algorithms. However, this freedom goes largely unexploited...
Ashley George, Malcolm I. Heywood
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
13 years 11 months ago
A GP neutral function for the artificial ANT problem
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
Esteban Ricalde, Katya Rodríguez-Váz...
GECCO
2006
Springer
150views Optimization» more  GECCO 2006»
13 years 11 months ago
Nonlinear parametric regression in genetic programming
Genetic programming has been considered a promising approach for function approximation since it is possible to optimize both the functional form and the coefficients. However, it...
Yung-Keun Kwon, Sung-Soon Choi, Byung Ro Moon
EVOW
2005
Springer
14 years 1 months ago
Application of the Grouping Genetic Algorithm to University Course Timetabling
University Course Timetabling-Problems (UCTPs) involve the allocation of resources (such as rooms and timeslots) to all the events of a university, satisfying a set of hard-constra...
Rhydian Lewis, Ben Paechter