GECCO
2004
Springer
14 years 4 months ago
2004
Springer
Subthreshold-seeking behavior occurs when the majority of the points that an algorithm samples have an evaluation less than some target threshold. We characterize sets of functions...
GECCO
2004
Springer
14 years 4 months ago
2004
Springer
The method of evolutionary functional testing allows for the automation of testing by transforming test case design into an optimization problem. To this end it is necessary to def...
GECCO
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. The need for supporting CSCW applications with heterogeneous and varying user requirements calls for adaptive and reconfigurable schedulers accommodating a mixture of re...
GECCO
2004
Springer
14 years 4 months ago
2004
Springer
The ability to predict the quality of a software object can be viewed as a classification problem, where software metrics are the features and expert quality rankings the class lab...
GECCO
2004
Springer
14 years 4 months ago
2004
Springer
This paper presents an investigation of genetic programming fitness landscapes. We propose a new indicator of problem hardness for tree-based genetic programming, called negative ...
GECCO
2004
Springer
14 years 4 months ago
2004
Springer
In this study, a new mechanism that adapts the mutation rate for each locus on the chromosomes, based on feedback obtained from the current population is proposed. Through tests us...
GECCO
2004
Springer
14 years 4 months ago
2004
Springer
GECCO
2004
Springer
14 years 4 months ago
2004
Springer
Multiple Species Weighted Voting (MSWV) is a genetics-based machine learning (GBML) system with relatively few parameters that combines N two-class classifiers into an N -class cla...
GECCO
2004
Springer
14 years 4 months ago
2004
Springer
Verifying the published results of algorithms is part of the usual research process. This helps to both validate the existing literature, but also quite often allows for new insigh...
GECCO
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. Iterated local search (ILS) is a powerful meta-heuristic algorithm applied to a large variety of combinatorial optimization problems. Contrary to evolutionary algorithms ...