Sciweavers

5331 search results - page 662 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
GECCO
2005
Springer
162views Optimization» more  GECCO 2005»
16 years 11 days ago
An autonomous explore/exploit strategy
In reinforcement learning problems it has been considered that neither exploitation nor exploration can be pursued exclusively without failing at the task. The optimal balance bet...
Alex McMahon, Dan Scott, William N. L. Browne
CGO
2003
IEEE
16 years 4 days ago
Addressing Mode Selection
Many processor architectures provide a set of addressing modes in their address generation units. For example DSPs (digital signal processors) have powerful addressing modes for e...
Erik Eckstein, Bernhard Scholz
GECCO
2010
Springer
197views Optimization» more  GECCO 2010»
15 years 11 months ago
Adaptive strategy selection in differential evolution
Differential evolution (DE) is a simple yet powerful evolutionary algorithm for global numerical optimization. Different strategies have been proposed for the offspring generation...
Wenyin Gong, Álvaro Fialho, Zhihua Cai
CDC
2009
IEEE
173views Control Systems» more  CDC 2009»
15 years 11 months ago
Sequentially updated Probability Collectives
— Multi-agent coordination problems can be cast as distributed optimization tasks. Probability Collectives (PCs) are techniques that deal with such problems in discrete and conti...
Michalis Smyrnakis, David S. Leslie
GECCO
2009
Springer
103views Optimization» more  GECCO 2009»
15 years 11 months ago
Using performance fronts for parameter setting of stochastic metaheuristics
In this work, we explore the idea that parameter setting of stochastic metaheuristics should be considered as a multiobjective problem. The so-called “performance fronts” pres...
Johann Dréo