Towards an analytic framework for analysing the computation time of evolutionary algorithms
Authors:
- 1 April 2003
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 145 (1-2) , 59-97
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- From an individual to a population: an analysis of the first hitting time of population-based evolutionary algorithmsIEEE Transactions on Evolutionary Computation, 2002
- Erratum to: Drift analysis and average time complexity of evolutionary algorithms: [Artificial Intelligence 127 (2001) 57–85]Artificial Intelligence, 2002
- An evolutionary approach to materialized views selection in a data warehouse environmentIEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews), 2001
- Statistical distribution of the convergence time of evolutionary algorithms for long-path problemsIEEE Transactions on Evolutionary Computation, 2000
- Genetic Algorithms + Data Structures = Evolution ProgramsJournal of the American Statistical Association, 2000
- Markov chain models of parallel genetic algorithmsIEEE Transactions on Evolutionary Computation, 2000
- Rigorous Hitting Times for Binary MutationsEvolutionary Computation, 1999
- Markov Chains and Stochastic StabilityJournal of the American Statistical Association, 1997
- How Mutation and Selection Solve Long-Path Problems in Polynomial Expected TimeEvolutionary Computation, 1996
- Combinatorial Optimization: Algorithms and Complexity.The American Mathematical Monthly, 1984