Sciweavers

359 search results - page 19 / 72
» gecco 2007
Sort
View
76
Voted
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 4 months ago
Geometric particle swarm optimisation on binary and real spaces: from theory to practice
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
Cecilia Di Chio, Alberto Moraglio, Riccardo Poli
GECCO
2007
Springer
184views Optimization» more  GECCO 2007»
15 years 2 months ago
Evolving kernels for support vector machine classification
While support vector machines (SVMs) have shown great promise in supervised classification problems, researchers have had to rely on expert domain knowledge when choosing the SVM&...
Keith Sullivan, Sean Luke
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
15 years 4 months ago
Pareto optimal search based refactoring at the design level
Refactoring aims to improve the quality of a software systems’ structure, which tends to degrade as the system evolves. While manually determining useful refactorings can be cha...
Mark Harman, Laurence Tratt
74
Voted
GECCO
2007
Springer
176views Optimization» more  GECCO 2007»
15 years 4 months ago
Best SubTree genetic programming
The result of the program encoded into a Genetic Programming (GP) tree is usually returned by the root of that tree. However, this is not a general strategy. In this paper we pres...
Oana Muntean, Laura Diosan, Mihai Oltean
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
15 years 4 months ago
Continuous lunches are free!
This paper investigates extensions of No Free Lunch (NFL) theorems to countably infinite and uncountable infinite domains. The original NFL due to Wolpert and Macready states th...
Anne Auger, Olivier Teytaud