Sciweavers

4229 search results - page 88 / 846
» On the Optimality of Spiral Search
Sort
View
GECCO
2009
Springer
142views Optimization» more  GECCO 2009»
15 years 4 months ago
Benchmarking the (1+1)-CMA-ES on the BBOB-2009 noisy testbed
We benchmark an independent-restart-(1+1)-CMA-ES on the BBOB-2009 noisy testbed. The (1+1)-CMA-ES is an adaptive stochastic algorithm for the optimization of objective functions d...
Anne Auger, Nikolaus Hansen
GECCO
2005
Springer
112views Optimization» more  GECCO 2005»
15 years 4 months ago
Two improved differential evolution schemes for faster global search
Differential evolution (DE) is well known as a simple and efficient scheme for global optimization over continuous spaces. In this paper we present two new, improved variants of D...
Swagatam Das, Amit Konar, Uday Kumar Chakraborty
GECCO
2010
Springer
169views Optimization» more  GECCO 2010»
15 years 1 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
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
15 years 12 days ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella
TOG
2012
232views Communications» more  TOG 2012»
13 years 1 months ago
Discovery of complex behaviors through contact-invariant optimization
We present a motion synthesis framework capable of producing a wide variety of important human behaviors that have rarely been studied, including getting up from the ground, crawl...
Igor Mordatch, Emanuel Todorov, Zoran Popovic