Sciweavers

512 search results - page 21 / 103
» On Evolutionary Optimization of Large Problems Using Small P...
Sort
View
GECCO
2006
Springer
174views Optimization» more  GECCO 2006»
14 years 3 days ago
On the analysis of the (1+1) memetic algorithm
Memetic algorithms are evolutionary algorithms incorporating local search to increase exploitation. This hybridization has been fruitful in countless applications. However, theory...
Dirk Sudholt
GECCO
2005
Springer
174views Optimization» more  GECCO 2005»
14 years 2 months ago
Diversity as a selection pressure in dynamic environments
Evolutionary algorithms (EAs) are widely used to deal with optimization problems in dynamic environments (DE) [3]. When using EAs to solve DE problems, we are usually interested i...
Lam Thu Bui, Jürgen Branke, Hussein A. Abbass
EVOW
2007
Springer
14 years 2 months ago
Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
Thomas Fischer, Peter Merz
GECCO
2010
Springer
157views Optimization» more  GECCO 2010»
13 years 12 months ago
Speeding up the evaluation of evolutionary learning systems using GPGPUs
In this paper we introduce a method for computing fitness in evolutionary learning systems based on NVIDIA’s massive parallel technology using the CUDA library. Both the match ...
María A. Franco, Natalio Krasnogor, Jaume B...
TEC
2008
98views more  TEC 2008»
13 years 8 months ago
Opposition-Based Differential Evolution
Evolutionary Algorithms (EAs) are well-known optimization approaches to cope with non-linear, complex problems. These population-based algorithms, however, suffer from a general we...
Shahryar Rahnamayan, Hamid R. Tizhoosh, Magdy M. A...