FOGA A

19 papers

YearTitle / Authors
2009A gaussian random field model of smooth fitness landscapes.
Alberto Moraglio, Yossi Borenstein
2009Additive approximations of pareto-optimal sets by evolutionary multi-objective algorithms.
Christian Horoba, Frank Neumann
2009Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem.
Christian Horoba
2009Black-box search by elimination of fitness functions.
Gautham Anil, R. Paul Wiegand
2009Computing single source shortest paths using single-objective fitness.
Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann
2009Cooperative coevolution and univariate estimation of distribution algorithms.
Christopher Vo, Liviu Panait, Sean Luke
2009Don't be greedy when calculating hypervolume contributions.
Karl Bringmann, Tobias Friedrich
2009Foundations of Genetic Algorithms, 10th ACM SIGEVO International Workshop, FOGA 2009, Orlando, Forida, USA, January 9-11, 2009, Proceedings
Ivan I. Garibay, Thomas Jansen, R. Paul Wiegand, Annie S. Wu
2009Free lunches for function and program induction.
Riccardo Poli, Mario Graff, Nicholas Freitag McPhee
2009Monotonicity versus performance in co-optimization.
Elena Popovici, Kenneth A. De Jong
2009On the impact of the mutation-selection balance on the runtime of evolutionary algorithms.
Per Kristian Lehre, Xin Yao
2009On the size of weights in randomized search heuristics.
Joachim Reichel, Martin Skutella
2009On the utility of the population size for inversely fitness proportional mutation rates.
Christine Zarges
2009Single- and multi-objective evolutionary algorithms for graph bisectioning.
Gero Greiner
2009Stability of learning dynamics in two-agent, imperfect-information games.
John Michael Butterworth, Jonathan L. Shapiro
2009Theory of the hypervolume indicator: optimal μ-distributions and the choice of the reference point.
Anne Auger, Johannes Bader, Dimo Brockhoff, Eckart Zitzler
2009Unbiased coevolutionary solution concepts.
Travis C. Service
2009Weighted recombination evolution strategy on a class of PDQF's.
Steffen Finck, Hans-Georg Beyer
2009Why standard particle swarm optimisers elude a theoretical runtime analysis.
Carsten Witt