Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint
From MaRDI portal
Publication:2240133
Recommendations
- Analysis of the (1 + 1) EA on subclasses of linear functions under uniform and linear constraints
- Tight bounds on the optimization time of a randomized search heuristic on linear functions
- Analysis of the (1+1) EA on subclasses of linear functions under uniform and linear constraints
- Optimizing linear functions with randomized search heuristics -- the robustness of mutation
- Combining Markov-chain analysis and drift analysis. The \((1+1)\) evolutionary algorithm on linear functions reloaded
Cites work
- A study of drift analysis for estimating computation time of evolutionary algorithms
- Adaptive drift analysis
- Analysis of the (1 + 1) EA on subclasses of linear functions under uniform and linear constraints
- Analyzing evolutionary algorithms. The computer science perspective.
- Combining Markov-chain analysis and drift analysis. The \((1+1)\) evolutionary algorithm on linear functions reloaded
- Computing minimum cuts by randomized search heuristics
- Concentrated hitting times of randomized search heuristics with variable drift
- Evolutionary algorithms and matroid optimization problems
- Hitting-time and occupation-time bounds implied by drift analysis with applications
- scientific article; zbMATH DE number 1754585 (Why is no real title available?)
- scientific article; zbMATH DE number 5686753 (Why is no real title available?)
- Multiplicative drift analysis
- On the analysis of the \((1+1)\) evolutionary algorithm
- On the size of weights in randomized search heuristics
- Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
- Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links
- Tight bounds on the optimization time of a randomized search heuristic on linear functions
- When do evolutionary algorithms optimize separable functions in parallel?
Cited in
(8)- Performance analysis of randomised search heuristics operating with a fixed budget
- Optimizing linear functions with randomized search heuristics -- the robustness of mutation
- Fixed Budget Performance of the (1+1) EA on Linear Functions
- The impact of random initialization on the runtime of randomized search heuristics
- Tight bounds on the optimization time of a randomized search heuristic on linear functions
- Analysis of the (1+1) EA on subclasses of linear functions under uniform and linear constraints
- Stagnation detection in highly multimodal fitness landscapes
- Analysis of the (1+1) EA on LeadingOnes with constraints
This page was built for publication: Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2240133)
