512 search results - page 21 / 103 » On Evolutionary Optimization of Large Problems Using Small P... |
108
Voted
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
Memetic algorithms are evolutionary algorithms incorporating local search to increase exploitation. This hybridization has been fruitful in countless applications. However, theory...
106
Voted
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
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...
160
Voted
EVOW
2007
Springer
15 years 8 months ago
2007
Springer
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...
115
Voted
GECCO
2010
Springer
15 years 6 months ago
2010
Springer
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 ...
119
Voted
TEC
2008
15 years 2 months ago
2008
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...