Sciweavers

3569 search results - page 485 / 714
» On the Evolution of Evolutionary Algorithms
Sort
View
CEC
2008
IEEE
16 years 19 days ago
On the scalability of particle swarm optimisation
— Particle swarm has proven to be competitive to other evolutionary algorithms in the field of optimization, and in many cases enables a faster convergence to the ideal solution...
Sébastien Piccand, Michael O'Neill, Jacquel...
COR
2007
112views more  COR 2007»
15 years 6 months ago
The bi-objective covering tour problem
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
Nicolas Jozefowiez, Frédéric Semet, ...
PPSN
2010
Springer
15 years 4 months ago
More Effective Crossover Operators for the All-Pairs Shortest Path Problem
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
Benjamin Doerr, Daniel Johannsen, Timo Kötzin...
FOGA
2011
14 years 9 months ago
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
Greg Durrett, Frank Neumann, Una-May O'Reilly
DCC
2009
IEEE
16 years 6 months ago
Source Coding Scheme for Multiple Sequence Alignments
Rapid development of DNA sequencing technologies exponentially increases the amount of publicly available genomic data. Whole genome multiple sequence alignments represent a parti...
Pavol Hanus, Janis Dingel, Georg Chalkidis, Joachi...