Sciweavers

220 search results - page 8 / 44
» Using genetic programming to obtain implicit diversity
Sort
View
ICIC
2009
Springer
14 years 2 months ago
Function Sequence Genetic Programming
Genetic Programming(GP) can obtain a program structure to solve complex problem. This paper presents a new form of Genetic Programming, Function Sequence Genetic Programming (FSGP)...
Shixian Wang, Yuehui Chen, Peng Wu
PRL
2010
159views more  PRL 2010»
13 years 6 months ago
Creating diverse nearest-neighbour ensembles using simultaneous metaheuristic feature selection
The nearest-neighbour (1NN) classifier has long been used in pattern recognition, exploratory data analysis, and data mining problems. A vital consideration in obtaining good res...
Muhammad Atif Tahir, Jim E. Smith
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
13 years 11 months ago
Learning recursive programs with cooperative coevolution of genetic code mapping and genotype
The Probabilistic Adaptive Mapping Developmental Genetic Programming (PAM DGP) algorithm that cooperatively coevolves a population of adaptive mappings and associated genotypes is...
Garnett Carl Wilson, Malcolm I. Heywood
GECCO
2003
Springer
14 years 27 days ago
Enhancing the Performance of GP Using an Ancestry-Based Mate Selection Scheme
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm bein...
Rodney Fry, Andrew M. Tyrrell
GECCO
2004
Springer
14 years 1 months ago
Dynamic Uniform Scaling for Multiobjective Genetic Algorithms
Before Multiobjective EvolutionaryAlgorithms (MOEAs) can be used as a widespread tool for solving arbitrary real world problems there are some salient issues which require further ...
Gerulf K. M. Pedersen, David E. Goldberg