Sciweavers

GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
13 years 11 months ago
Rigorous analyses of simple diversity mechanisms
It is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann
CEC
2007
IEEE
13 years 11 months ago
Continuous dynamic problem generators for evolutionary algorithms
— Addressing dynamic optimization problems has attracted a growing interest from the evolutionary algorithm community in recent years due to its importance in the applications of...
Renato Tinós, Shengxiang Yang
CEC
2007
IEEE
13 years 11 months ago
An evolutionary progressive multiple sequence alignment
Abstract This paper presents a new evolutionary method, namely, a Two Phase evolutionary algorithm for multiple sequence alignments. This method is composed of different types of e...
Farhana Naznin, Morikazu Nakamura, Takeo Okazaki, ...
CEC
2007
IEEE
13 years 11 months ago
Indicator-based multi-objective local search
— This paper presents a simple and generic indicator-based multi-objective local search. This algorithm is a direct extension of the IBEA algorithm, an indicatorbased evolutionar...
Matthieu Basseur, Edmund K. Burke
CEC
2008
IEEE
13 years 11 months ago
New evaluation criteria for the convergence of continuous evolutionary algorithms
—The first hitting time (FHT) plays an important role in convergence evaluation for evolutionary algorithms. However, the current criteria of the FHT are mostly under a hypothesi...
Ying Lin, Jian Huang, Jun Zhang
CEC
2008
IEEE
13 years 11 months ago
High-level synthesis with multi-objective genetic algorithm: A comparative encoding analysis
— The high-level synthesis process involves three interdependent and NP-complete optimization problems: (i) the operation scheduling, (ii) the resource allocation, and (iii) the ...
Christian Pilato, Daniele Loiacono, Fabrizio Ferra...
CEC
2008
IEEE
13 years 11 months ago
When to use bit-wise neutrality
—Representation techniques are important issues when designing successful evolutionary algorithms. Within this field the use of neutrality plays an important role. We examine th...
Tobias Friedrich, Frank Neumann
BIBE
2008
IEEE
13 years 11 months ago
Robust parameter identification for biological circuit calibration
Abstract-The aim of this work is to compare some deterministic optimization algorithms and evolutionary algorithms on parameter estimation in a biological circuit design problem: t...
Giuseppe Nicosia, Eva Sciacca
GECCO
2009
Springer
121views Optimization» more  GECCO 2009»
13 years 11 months ago
Evolutionary algorithms and dynamic programming
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled...
Benjamin Doerr, Anton Eremeev, Christian Horoba, F...
GECCO
2009
Springer
167views Optimization» more  GECCO 2009»
13 years 11 months ago
Fixed-parameter evolutionary algorithms and the vertex cover problem
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
Stefan Kratsch, Frank Neumann