Sciweavers

2407 search results - page 331 / 482
» The evolutionary forest algorithm
Sort
View
KES
1999
Springer
15 years 9 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
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 11 months ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
GECCO
2009
Springer
192views Optimization» more  GECCO 2009»
15 years 2 months ago
Improving SMT performance: an application of genetic algorithms to configure resizable caches
Simultaneous Multithreading (SMT) is a technology aimed at improving the throughput of the processor core by applying Instruction Level Parallelism (ILP) and Thread Level Parallel...
Josefa Díaz, José Ignacio Hidalgo, F...
BMCBI
2011
14 years 8 months ago
Combinatorial analysis and algorithms for quasispecies reconstruction using next-generation sequencing
Background: Next-generation sequencing (NGS) offers a unique opportunity for high-throughput genomics and has potential to replace Sanger sequencing in many fields, including de-n...
Mattia C. F. Prosperi, Luciano Prosperi, Alessandr...
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
15 years 11 months ago
Binary ant algorithm
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...