Choosing selection pressure for wide-gap problems
type: Item
instance of: scholarly article
title: Choosing selection pressure for wide-gap problems
zbMATH Open document ID: 1191.68303
author: Tianshi Chen
author: Jun He
author: Xin Yao
author: Guoliang Chen
published in: Theoretical Computer Science
publication date: 2010-02-19T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 5673195
zbMATH Keywords: evolutionary algorithm
zbMATH Keywords: selection pressure
zbMATH Keywords: first hitting time
zbMATH Keywords: Markov chain
zbMATH Keywords: evolutionary computation theory
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.12.014
OpenAlex ID: W2058518193
cites work: On the analysis of the \((1+1)\) evolutionary algorithm
cites work: On the convergence rates of genetic algorithms
cites work: Drift analysis and average time complexity of evolutionary algorithms
cites work: Towards an analytic framework for analysing the computation time of evolutionary algorithms
cites work: A study of drift analysis for estimating computation time of evolutionary algorithms
cites work: Q3136186
cites work: A new approach to estimating the expected first hitting time of evolutionary algorithms
DOI: 10.1016/J.TCS.2009.12.014
description: scientific article; zbMATH DE number 5673195