835 search results - page 71 / 167 » Dynamic populations in genetic algorithms |
EUROGP
2009
Springer
15 years 7 months ago
2009
Springer
This paper analyses the efficiency of the Cartesian Genetic Programming (CGP) methodology in the image operator design problem at the functional level. The CGP algorithm is compare...
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. This paper studies the inducement of sequentiality in genetic algorithms (GAs) for uniformly-scaled problems. Sequentiality is a phenomenon in which sub-solutions converg...
117
Voted
EUROGP
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Turing machines are playing an increasingly significant role in Computer Science domains such as bioinformatics. Instead of directly formulating a solution to a problem, ...
89
Voted
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
We present two novel perturbation-based linkage learning algorithms that extend LINC [5]; a version of LINC optimised for decomposition tasks (oLINC) and a hierarchical version of...
103
Voted
TEC
2008
15 years 14 days ago
2008
Data mining is most commonly used in attempts to induce association rules from transaction data. Most previous studies focused on binary-valued transaction data. Transaction data i...