Selection hyper-heuristics can automatically adjust the learning period to optimally solve pseudo-Boolean problems
From MaRDI portal
Cites work
- (1+1) EA on Generalized Dynamic OneMax
- A runtime analysis of simple hyper-heuristics: to mix or not to mix operators
- Adaptive population models for offspring populations and parallel evolutionary algorithms
- Analyzing evolutionary algorithms. The computer science perspective.
- Analyzing randomized search heuristics via stochastic domination
- Analyzing randomized search heuristics: tools from probability theory
- Evolution strategies. A comprehensive introduction
- From black-box complexity to designing new genetic algorithms
- scientific article; zbMATH DE number 1728538 (Why is no real title available?)
- scientific article; zbMATH DE number 2079883 (Why is no real title available?)
- Learning probability distributions in continuous evolutionary algorithms -- a comparative review
- Probability Inequalities for Sums of Bounded Random Variables
- Recent advances in selection hyper-heuristics
- Runtime analysis for self-adaptive mutation rates
- Self-adaptation Can Improve the Noise-tolerance of Evolutionary Algorithms
- Self-adjusting evolutionary algorithms for multimodal optimization
- Self-adjusting offspring population sizes outperform fixed parameters on the Cliff function
- Stagnation detection meets fast mutation
- The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
- When move acceptance selection hyper-heuristics outperform metropolis and elitist evolutionary algorithms and when not
This page was built for publication: Selection hyper-heuristics can automatically adjust the learning period to optimally solve pseudo-Boolean problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7304010)
