Sciweavers

65 search results - page 7 / 13
» Comparing evolutionary algorithms to the (1 1)-EA
Sort
View
GECCO
2006
Springer
174views Optimization» more  GECCO 2006»
13 years 11 months 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
2004
Springer
134views Optimization» more  GECCO 2004»
14 years 23 days ago
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra...
GECCO
2005
Springer
138views Optimization» more  GECCO 2005»
14 years 27 days ago
Promising infeasibility and multiple offspring incorporated to differential evolution for constrained optimization
In this paper, we incorporate a diversity mechanism to the differential evolution algorithm to solve constrained optimization problems without using a penalty function. The aim is...
Efrén Mezura-Montes, Jesús Vel&aacut...
KES
1999
Springer
13 years 11 months ago
Dynamic Demes parallel genetic algorithm
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
Mariusz Nowostawski, Riccardo Poli
BMCBI
2011
12 years 11 months ago
A mutation degree model for the identification of transcriptional regulatory elements
Background: Current approaches for identifying transcriptional regulatory elements are mainly via the combination of two properties, the evolutionary conservation and the overrepr...
Changqing Zhang, Jin Wang, Xu Hua, Jinggui Fang, H...