Sciweavers

135 search results - page 13 / 27
» gecco 2010
Sort
View
GECCO
2010
Springer
156views Optimization» more  GECCO 2010»
15 years 1 months ago
Elementary landscape decomposition of the quadratic assignment problem
The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP c...
J. Francisco Chicano, Gabriel Luque, Enrique Alba
GECCO
2010
Springer
222views Optimization» more  GECCO 2010»
14 years 8 months ago
Black-box optimization benchmarking of NEWUOA compared to BIPOP-CMA-ES: on the BBOB noiseless testbed
In this paper, the performances of the NEW Unconstrained Optimization Algorithm (NEWUOA) on some noiseless functions are compared to those of the BI-POPulation Covariance Matrix A...
Nikolaus Hansen, Raymond Ros
GECCO
2010
Springer
181views Optimization» more  GECCO 2010»
15 years 2 months ago
Evolving neural networks in compressed weight space
We propose a new indirect encoding scheme for neural networks in which the weight matrices are represented in the frequency domain by sets of Fourier coefficients. This scheme exp...
Jan Koutnik, Faustino J. Gomez, Jürgen Schmid...
GECCO
2010
Springer
249views Optimization» more  GECCO 2010»
14 years 11 months ago
Towards improved dispatching rules for complex shop floor scenarios: a genetic programming approach
Developing dispatching rules for manufacturing systems is a tedious process, which is time- and cost-consuming. Since there is no good general rule for different scenarios and ob...
Torsten Hildebrandt, Jens Heger, Bernd Scholz-Reit...
GECCO
2010
Springer
169views Optimization» more  GECCO 2010»
14 years 11 months ago
Stochastic local search in continuous domains: questions to be answered when designing a novel algorithm
Several population-based methods (with origins in the world of evolutionary strategies and estimation-of-distribution algorithms) for black-box optimization in continuous domains ...
Petr Posik