2180 search results - page 314 / 436 » Comparing bio-inspired algorithms in constrained optimizatio... |
GECCO
2010
Springer
15 years 1 months ago
2010
Springer
We propose a novel variant of the (1 + 1)-CMA-ES that updates the distribution of mutation vectors based on both successful and unsuccessful trial steps. The computational costs o...
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
This paper describes a speciation method that allows an evolutionary process to learn several robot behaviors using a single execution. Species are created in behavioral space in ...
EOR
2010
14 years 10 months ago
2010
Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...
102
click to vote
GECCO
2011
Springer
14 years 1 months ago
2011
Springer
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
FOCS
2008
IEEE
14 years 11 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...