Some analyses about the time complexity of evolutionary algorithms

MaRDI QIDQ5493043zbMATH OpenFDO

Authors Lixin Ding, Jinghu Yu

Publication date 20 October 2006

zbMATH Keywords

computation timedrift analysisDynkin's formula

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms (68W40)

Recommendations

• Some analysis about the time complexity of evolutionary algorithms
• Towards an analytic framework for analysing the computation time of evolutionary algorithms
• A study of drift analysis for estimating computation time of evolutionary algorithms
• Drift analysis and average time complexity of evolutionary algorithms
• Analysis for time complexity of evolutionary algorithms

Cited in

(18)

• Finite-time performance analysis for genetic algorithms
• Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
• A study of drift analysis for estimating computation time of evolutionary algorithms
• Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem
• A new approach to estimating the expected first hitting time of evolutionary algorithms
• scientific article; zbMATH DE number 1696516 (Why is no real title available?)
• scientific article; zbMATH DE number 1703859 (Why is no real title available?)
• scientific article; zbMATH DE number 6019547 (Why is no real title available?)
• On the convergence rate and expected first fitting time of elitist evolutionary algorithms
• A generic design model for evolutionary algorithms
• Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering
• Asymptotic Hitting Time for a Simple Evolutionary Model of Protein Folding
• Analysis for time complexity of evolutionary algorithms
• Drift conditions for estimating the first hitting times of evolutionary algorithms
• Some analysis about the time complexity of evolutionary algorithms
• Foundations of Genetic Algorithms
• Drift analysis and average time complexity of evolutionary algorithms
• Towards an analytic framework for analysing the computation time of evolutionary algorithms

This page was built for publication: Some analyses about the time complexity of evolutionary algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5493043)