Sciweavers

7 search results - page 1 / 2
» Rigorous analyses of fitness-proportional selection for opti...
Sort
View
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
13 years 6 months ago
Rigorous analyses of fitness-proportional selection for optimizing linear functions
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...
Edda Happ, Daniel Johannsen, Christian Klein, Fran...
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
13 years 11 months ago
Not all linear functions are equally difficult for the compact genetic algorithm
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
Stefan Droste
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 2 months ago
On the Impact of Mutation-Selection Balance on the Runtime of Evolutionary Algorithms
The interplay between the mutation operator and the selection mechanism plays a fundamental role in the behaviour of evolutionary algorithms (EAs). However, this interplay is stil...
Per Kristian Lehre, Xin Yao
ICNP
2002
IEEE
13 years 10 months ago
An Ultra-fast Shared Path Protection Scheme - Distributed Partial Information Management, Part II
— This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows...
Dahai Xu, Chunming Qiao, Yizhi Xiong
ECIS
2003
13 years 7 months ago
A multi-model algorithm for the cost-oriented design of the information technology infrastructure
Multiple combinations of hardware and network components can be selected to design an information technology (IT) infrastructure that satisfies performance requirements. The profe...
Danilo Ardagna, Chiara Francalanci, Marco Trubian