Analyzing randomized search heuristics: tools from probability theory
From MaRDI portal
Recommendations
Cited in
(37)- The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
- On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization
- The impact of a sparse migration topology on the runtime of island models in dynamic optimization
- Optimal static and self-adjusting parameter choices for the (1+( , )) genetic algorithm
- Static and self-adjusting mutation strengths for multi-valued decision variables
- The capture time of the hypercube
- Markov chain analysis of evolutionary algorithms on OneMax function -- from coupon collector's problem to (1 + 1) EA
- Correction to: ``Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
- Working principles of binary differential evolution
- Efficient randomized test-and-set implementations
- Performance analysis of randomised search heuristics operating with a fixed budget
- A lower bound for the discrepancy of a random point set
- Optimal strong stationary times for random walks on the chambers of a hyperplane arrangement
- Fitness levels with tail bounds for the analysis of randomized search heuristics
- Time complexity analysis of evolutionary algorithms on random satisfiable k-CNF formulas
- \textsc{OneMax} in black-box models with several restrictions
- Towards a runtime comparison of natural and artificial evolution
- Stability for vertex cycle covers
- Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem
- Simple and optimal randomized fault-tolerant rumor spreading
- The impact of random initialization on the runtime of randomized search heuristics
- Technical Note—Note on “Myopic Heuristics for the Random Yield Problem”
- scientific article; zbMATH DE number 3932819 (Why is no real title available?)
- The use of tail inequalities on the probable computational time of randomized search heuristics
- scientific article; zbMATH DE number 1054958 (Why is no real title available?)
- scientific article; zbMATH DE number 1057701 (Why is no real title available?)
- scientific article; zbMATH DE number 3453517 (Why is no real title available?)
- From black-box complexity to designing new genetic algorithms
- Improving a constant in high-dimensional discrepancy estimates
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- Direct search based on probabilistic descent
- On the integrality gap of binary integer programs with Gaussian data
- Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II)
- Sublinear Algorithms for Local Graph-Centrality Estimation
- Is this correct? Let's check!
- Selection hyper-heuristics can automatically adjust the learning period to optimally solve pseudo-Boolean problems
- Heuristics for search sequencing under time-dependent probabilities of existence
This page was built for publication: Analyzing randomized search heuristics: tools from probability theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3224100)
