Multiplicative up-drift (Q2240128)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Multiplicative up-drift	scientific article

Statements

scholarly article

0 references

Multiplicative up-drift (English)

0 references

0 references

0 references

0 references

publication date

5 November 2021

0 references

full work available at URL

https://arxiv.org/abs/1904.05682

0 references

zbMATH Keywords

drift theory

0 references

evolutionary computation

0 references

stochastic process

0 references

MaRDI profile type

MaRDI publication profile

0 references

Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm

0 references

Adaptive drift analysis

0 references

Multiplicative drift analysis

0 references

Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances

0 references

Runtime analysis of non-elitist populations: from classical optimisation to partial information

0 references

Level-based analysis of the univariate marginal distribution algorithm

0 references

An elementary analysis of the probability that a binomial random variable exceeds its expectation

0 references

Analyzing randomized search heuristics via stochastic domination

0 references

Theory of Evolutionary Computation

0 references

Exponential inequalities for martingales with applications

0 references

Robustness of populations in stochastic environments

0 references

Tight lower bound on the probability of a binomial exceeding its expectation

0 references

0 references

Drift analysis and average time complexity of evolutionary algorithms

0 references

A study of drift analysis for estimating computation time of evolutionary algorithms

0 references

Algorithmic analysis of a basic evolutionary algorithm for continuous optimization

0 references

On the Brittleness of Evolutionary Algorithms

0 references

(1+1) EA on Generalized Dynamic OneMax

0 references

Concentration of first hitting times under additive drift

0 references

Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links

0 references

Probability and Computing

0 references

0 references

Improved time complexity analysis of the simple genetic algorithm

0 references

On Cumulative Sums of Random Variables

0 references

0 references

On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics

0 references

Identifiers

10.1007/s00453-020-00775-7

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2240128

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2240128&oldid=36733394"