Rigorous Runtime Analysis of the (1+1) ES: 1/5-Rule and Ellipsoidal Fitness Landscapes

2005 ◽  
pp. 260-281 ◽  
Author(s):  
Jens Jägersküpper
Keyword(s):  
Fitness Landscapes ◽  
Runtime Analysis

scholarly journals Principled Design and Runtime Analysis of Abstract Convex Evolutionary Search

2017 ◽  
Vol 25 (2) ◽  
pp. 205-236 ◽  
Author(s):  
Alberto Moraglio ◽  
Dirk Sudholt
Keyword(s):  
Evolutionary Algorithms ◽  
Search Algorithm ◽  
Geometric Theory ◽  
Search Space ◽  
Fitness Landscapes ◽  
Runtime Analysis ◽  
Evolutionary Search ◽  
Search Spaces ◽  
Underlying Space ◽  
Geometric Crossover

Geometric crossover is a formal class of crossovers that includes many well-known recombination operators across representations. In previous work, it was shown that all evolutionary algorithms with geometric crossover (but no mutation) do the same form of convex search regardless of the underlying representation, the specific selection mechanism, offspring distribution, search space, and problem at hand. Furthermore, it was suggested that the generalised convex search could perform well on generalised forms of concave and approximately concave fitness landscapes regardless of the underlying space and representation. In this article, we deepen this line of enquiry and study the runtime of generalised convex search on concave fitness landscapes. This is a first step toward linking a geometric theory of representations and runtime analysis in the attempt to (1) set the basis for a more general, unified approach for the runtime analysis of evolutionary algorithms across representations, and (2) identify the essential matching features of evolutionary search behaviour and landscape topography that cause polynomial performance. We present a general runtime result that can be systematically instantiated to specific search spaces and representations and present its specifications to three search spaces. As a corollary, we obtain that the convex search algorithm optimises LeadingOnes in [Formula: see text] fitness evaluations, which is faster than all unbiased unary black box algorithms.

Preventing SQL Code Injection by Combining Static and Runtime Analysis

2008 ◽  
Author(s):  
Alessandro Orso ◽  
Wenke Lee ◽  
Adam Shostack
Keyword(s):  
Runtime Analysis ◽  
Code Injection

scholarly journals Fixed-target runtime analysis

2020 ◽  
Author(s):  
Maxim Buzdalov ◽  
Benjamin Doerr ◽  
Carola Doerr ◽  
Dmitry Vinokurov
Keyword(s):  
Runtime Analysis ◽  
Fixed Target

scholarly journals The fitness landscapes of translation

2021 ◽  
Vol 569 ◽  
pp. 125768
Author(s):  
Mario Josupeit ◽  
Joachim Krug
Keyword(s):  
Fitness Landscapes
Sign in / Sign up

Export Citation Format

Share Document