Sciweavers

6943 search results - page 736 / 1389
» Representations for evolutionary algorithms
Sort
View
230
Voted
GECCO
2008
Springer
183views Optimization» more  GECCO 2008»
15 years 8 months ago
UMDAs for dynamic optimization problems
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designe...
Carlos M. Fernandes, Cláudio F. Lima, Agost...
COR
2008
122views more  COR 2008»
15 years 7 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr
205
Voted
CORR
2008
Springer
156views Education» more  CORR 2008»
15 years 7 months ago
Artificial Immune Systems (AIS) - A New Paradigm for Heuristic Decision Making
Over the last few years, more and more heuristic decision making techniques have been inspired by nature, e.g. evolutionary algorithms, ant colony optimisation and simulated annea...
Uwe Aickelin
COR
2007
134views more  COR 2007»
15 years 7 months ago
Portfolio selection using neural networks
In this paper we apply a heuristic method based on artificial neural networks (NN) in order to trace out the efficient frontier associated to the portfolio selection problem. We...
Alberto Fernández, Sergio Gómez
185
Voted
JACM
2006
99views more  JACM 2006»
15 years 7 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller