Sciweavers

2147 search results - page 288 / 430
» Evolutionary Algorithms
Sort
View
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
16 years 16 days 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 4 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...
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
16 years 16 days 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...
GECCO
2009
Springer
152views Optimization» more  GECCO 2009»
15 years 11 months ago
A data-based coding of candidate strings in the closest string problem
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
Bryant A. Julstrom
GECCO
2007
Springer
185views Optimization» more  GECCO 2007»
16 years 16 days ago
SNDL-MOEA: stored non-domination level MOEA
There exist a number of high-performance Multi-Objective Evolutionary Algorithms (MOEAs) for solving MultiObjective Optimization (MOO) problems; two of the best are NSGA-II and -M...
Matt D. Johnson, Daniel R. Tauritz, Ralph W. Wilke...