Runtime analysis of the \((1+1)\) EA on computing unique input output sequences
type: Item
instance of: scholarly article
title: Runtime analysis of the \((1+1)\) EA on computing unique input output sequences
zbMATH Open document ID: 1328.68200
author: Per Kristian Lehre
author: Xin Yao
published in: Information Sciences
publication date: 2016-01-14T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6530420
zbMATH Keywords: finite state machines
zbMATH Keywords: conformance testing
zbMATH Keywords: unique input output sequences
zbMATH Keywords: evolutionary algorithms
zbMATH Keywords: random search
zbMATH Keywords: runtime analysis
MaRDI profile type: Publication
full work available at URL: j.ins.2010.01.031
OpenAlex ID: W2116902835
cites work: Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions.
cites work: Real royal road functions -- where crossover provably is essential
cites work: Real royal road functions for constant population size
cites work: Population size versus runtime of a simple evolutionary algorithm
cites work: On the impact of the mutation-selection balance on the runtime of evolutionary algorithms
cites work: Theoretical Analysis of Local Search in Software Testing
cites work: Q4264211
cites work: Formal Approaches to Software Testing
cites work: Testing finite-state machines: state identification and verification
cites work: The analysis of evolutionary algorithms on sorting and shortest paths problems
cites work: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
cites work: Introduction to algorithms
cites work: On the analysis of the \((1+1)\) evolutionary algorithm
cites work: A rigorous analysis of the compact genetic algorithm for linear functions
cites work: A study of drift analysis for estimating computation time of evolutionary algorithms
cites work: Q5606985
cites work: Q4856179
cites work: On the Brittleness of Evolutionary Algorithms
DOI: 10.1016/J.INS.2010.01.031
Recommended article: Sharp bounds on the runtime of the (1+1) EA via drift analysis and analytic combinatorial tools
Recommended article: A tight runtime analysis for the \((\mu + \lambda)\) EA
Recommended article: Running time analysis of the \((1+1)\)-EA for OneMax and LeadingOnes under bit-wise noise
Recommended article: Q4436917
Recommended article: A general Sequential Time-Space Tradeoff for Finding Unique Elements
Recommended article: Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
Recommended article: A study on the extended unique input/output sequence
Recommended article: Q3815118
Recommended article: On \(O(1)\) time algorithms for combinatorial generation
Recommended article: Runtime analysis of the \((\mu + 1)\)-EA on the dynamic BinVal function
description: scientific article; zbMATH DE number 6530420