Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift
نویسندگان
چکیده
منابع مشابه
General Lower Bounds for Evolutionary Algorithms
@inProceedings{lbes, author={O. Teytaud and S. Gelly}, title={General lower bounds for evolutionary algorithms}, booktitle = {$10^{th}$ International Conference on Parallel Problem Solving from Nature (PPSN 2006), 10 pages,},
متن کاملGeneral Lower Bounds for the Running Time of Evolutionary Algorithms
We present a new method for proving lower bounds in evolutionary computation based on fitness-level arguments and an additional condition on transition probabilities between fitness levels. The method yields exact or near-exact lower bounds for LO, OneMax, and all functions with a unique optimum. All lower bounds hold for every evolutionary algorithm that only uses standard mutation as variatio...
متن کاملLower Bounds for Heuristic Algorithms
The constraint satisfaction problem, the Boolean satisfiability problem and the graph isomorphism problem do not have efficient algorithms. In order to solve these problems, one utilizes heuristic algorithms of polynomial running time. The present thesis studies three classical heuristics for the above-mentioned decision problems and answers the question whether they can be implemented more eff...
متن کاملLower Bounds for Online Algorithms
What is an oline problem Unlike the offline problems that we get the whole input at the beginning, in an online problem we just have some part of the input in advance. The rest of the input are queries that arrive one by one. Upon the arrival of each request, we need to process as it is received. In analyzing online algorithms, we usually, do not really care about the ruing time. The source of ...
متن کاملErratum: Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation
This erratum points out an error in the simplified drift theorem (SDT) [14, 15]. It is also shown that a minor modification of one of its conditions is sufficient to establish a valid result. In many respects, the new theorem is more general than before. We no longer assume a Markov process nor a finite search space. Furthermore, the proof of the theorem is more compact than the previous ones. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Evolutionary Computation
سال: 2020
ISSN: 1063-6560,1530-9304
DOI: 10.1162/evco_a_00283