Theoretical Analysis of Local Search in Software Testing

DOI10.1007/978-3-642-04944-6_13zbMath1260.68121OpenAlexW1604682921MaRDI QIDQ3646126

Andrea Arcuri

Publication date: 19 November 2009

Published in: Stochastic Algorithms: Foundations and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04944-6_13

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theory of software (68N99)

Related Items (2)

Runtime analysis of the \((1+1)\) EA on computing unique input output sequences ⋮ Exploiting Binary Floating-Point Representations for Constraint Propagation

Uses Software

• R

Cites Work

• Unnamed Item
• On the analysis of the \((1+1)\) evolutionary algorithm
• A study of drift analysis for estimating computation time of evolutionary algorithms
• Upper and lower bounds for randomized search heuristics in black-box optimization
• On the Brittleness of Evolutionary Algorithms

This page was built for publication: Theoretical Analysis of Local Search in Software Testing