GECCO
2007
Springer
14 years 6 months ago
2007
Springer
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...
CEC
2007
IEEE
14 years 6 months ago
2007
IEEE
— 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...
CEC
2007
IEEE
14 years 6 months ago
2007
IEEE
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...
CEC
2007
IEEE
14 years 6 months ago
2007
IEEE
— 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...
CEC
2008
IEEE
14 years 7 months ago
2008
IEEE
—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...
CEC
2008
IEEE
14 years 7 months ago
2008
IEEE
— The high-level synthesis process involves three interdependent and NP-complete optimization problems: (i) the operation scheduling, (ii) the resource allocation, and (iii) the ...
CEC
2008
IEEE
14 years 7 months ago
2008
IEEE
—Representation techniques are important issues when designing successful evolutionary algorithms. Within this field the use of neutrality plays an important role. We examine th...
BIBE
2008
IEEE
14 years 7 months ago
2008
IEEE
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...
GECCO
2009
Springer
14 years 7 months ago
2009
Springer
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...
GECCO
2009
Springer
14 years 7 months ago
2009
Springer
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...