Sciweavers

213 search results - page 41 / 43
» A comparison of search heuristics for empirical code optimiz...
Sort
View
79
Voted
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
15 years 3 months ago
Intransitivity revisited coevolutionary dynamics of numbers games
Relative fitness, or “evaluation by tests” is one of the building blocks of coevolution: the only fitness information available is a comparison with other individuals in a p...
Pablo Funes, Enrique Pujals
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
14 years 7 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen
98
Voted
IAT
2009
IEEE
15 years 4 months ago
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
Yoonheui Kim, Victor R. Lesser, Deepak Ganesan, Ra...
GECCO
2007
Springer
173views Optimization» more  GECCO 2007»
15 years 3 months ago
UCSpv: principled voting in UCS rule populations
Credit assignment is a fundamental issue for the Learning Classifier Systems literature. We engage in a detailed investigation of credit assignment in one recent system called UC...
Gavin Brown, Tim Kovacs, James A. R. Marshall
87
Voted
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
15 years 2 months ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel