Self-adjusting evolutionary algorithms for multimodal optimization (Q2144276): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-022-00933-z / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: 2004.03266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight runtime analysis for the (1 + (λ, λ)) GA on leadingones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5306039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static and self-adjusting mutation strengths for multi-valued decision variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Evolutionary Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Runtime analysis for self-adaptive mutation rates / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the analysis of the \((1+1)\) evolutionary algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hitting-time and occupation-time bounds implied by drift analysis with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing evolutionary algorithms. The computer science perspective. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive population models for offspring populations and parallel evolutionary algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stagnation detection with randomized local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: The benefits and limitations of voting mechanisms in evolutionary optimisation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Population size versus runtime of a simple evolutionary algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-022-00933-Z / rank
 
Normal rank

Latest revision as of 08:55, 28 December 2024

scientific article
Language Label Description Also known as
English
Self-adjusting evolutionary algorithms for multimodal optimization
scientific article

    Statements

    Self-adjusting evolutionary algorithms for multimodal optimization (English)
    0 references
    0 references
    0 references
    0 references
    1 June 2022
    0 references
    randomized search heuristics
    0 references
    self-adjusting algorithms
    0 references
    multimodal functions
    0 references
    runtime analysis
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references