Sciweavers

6 search results - page 1 / 2
» Rigorous analyses of simple diversity mechanisms
Sort
View
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
13 years 10 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
GECCO
2008
Springer
118views Optimization» more  GECCO 2008»
13 years 5 months ago
Theoretical analysis of diversity mechanisms for global exploration
Maintaining diversity is important for the performance of evolutionary algorithms. Diversity mechanisms can enhance global exploration of the search space and enable crossover to ...
Tobias Friedrich, Pietro Simone Oliveto, Dirk Sudh...
CEC
2007
IEEE
13 years 11 months ago
Plateaus can be harder in multi-objective optimization
—In recent years a lot of progress has been made in understanding the behavior of evolutionary computation methods for single- and multi-objective problems. Our aim is to analyze...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
13 years 10 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...
SSDBM
2003
IEEE
160views Database» more  SSDBM 2003»
13 years 9 months ago
The Virtual Data Grid: A New Model and Architecture for Data-Intensive Collaboration
It is now common to encounter communities engaged in the collaborative analysis and transformation of large quantities of data over extended time periods. We argue that these comm...
Ian T. Foster