Sciweavers

4430 search results - page 532 / 886
» Solving Optimization Problems with DLL
Sort
View
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 10 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
ACRI
2006
Springer
15 years 8 months ago
From Cells to Islands: An Unified Model of Cellular Parallel Genetic Algorithms
Abstract. This paper presents the Anisotropic selection scheme for cellular Genetic Algorithms (cGA). This new scheme allows to enhance diversity and to control the selective press...
David Simoncini, Philippe Collard, Sébastie...
SODA
2004
ACM
110views Algorithms» more  SODA 2004»
15 years 8 months ago
Probabilistic analysis of knapsack core algorithms
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
René Beier, Berthold Vöcking
ECAI
2010
Springer
15 years 8 months ago
EP for Efficient Stochastic Control with Obstacles
Abstract. We address the problem of continuous stochastic optimal control in the presence of hard obstacles. Due to the non-smooth character of the obstacles, the traditional appro...
Thomas Mensink, Jakob J. Verbeek, Bert Kappen
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
15 years 7 months ago
ASAGA: an adaptive surrogate-assisted genetic algorithm
Genetic algorithms (GAs) used in complex optimization domains usually need to perform a large number of fitness function evaluations in order to get near-optimal solutions. In rea...
Liang Shi, Khaled Rasheed