3467 search results - page 30 / 694 » Function Optimization with Coevolutionary Algorithms |
115
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Simulated annealing and the (1+1) EA, a simple evolutionary algorithm, are both general randomized search heuristics that optimize any objective function with probability
129
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Existing value function approximation methods have been successfully used in many applications, but they often lack useful a priori error bounds. We propose a new approximate bili...
126
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We present a new optimization technique that yields the first FPTAS for several geometric problems. These problems reduce to optimizing a sum of non-negative, constant description...
161
click to vote
CONSTRAINTS
2008
15 years 4 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
137
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, we proposed Fittest Individual Refinement (FIR), a crossover based local search method for Differential Evolution (DE). The FIR scheme accelerates DE by enhancing...