2174 search results - page 74 / 435 » On the Brittleness of Evolutionary Algorithms |
175
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Abstract. Nowadays genetic algorithms stand as a trend to solve NPcomplete and NP-hard problems. In this paper, we present a new hybrid metaheuristic which uses Parallel Genetic Al...
151
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
A Quasi-Monte-Carlo method based on the computation of a surrogate model of the fitness function is proposed, and its convergence at super-linear rate 3/2 is proved under rather ...
185
click to vote
PPSN
2010
Springer
15 years 4 months ago
2010
Springer
We present methods to answer two basic questions that arise when benchmarking optimization algorithms. The first one is: which algorithm is the `best' one? and the second one:...
159
click to vote
EVOW
2008
Springer
15 years 7 months ago
2008
Springer
Recently, a new iterative optimization framework utilizing an evolutionary algorithm called "Prototype Optimization with Evolved iMprovement Steps" (POEMS) was introduced...
151
click to vote
FLAIRS
2001
15 years 7 months ago
2001
This paperaddresses the problemof algorithm discovery, via evolutionarysearch, in the context of matrix multiplication. Thetraditional multiplicationalgorithm requiresO(n3) multip...