The \((1+1)\) elitist black-box complexity of LeadingOnes (Q1750359): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2599523157 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1604.02355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Query Complexity of Finding a Hidden Permutation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-box search by unbiased variation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster black-box algorithms through higher arity operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Playing mastermind with constant-size memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking-based black-box complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: \textsc{OneMax} in black-box models with several restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \((1+1)\) elitist black-box complexity of LeadingOnes / 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: Upper and lower bounds for randomized search heuristics in black-box optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Hitting Time for a Simple Evolutionary Model of Protein Folding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4370804 / rank
 
Normal rank

Latest revision as of 16:34, 15 July 2024

scientific article
Language Label Description Also known as
English
The \((1+1)\) elitist black-box complexity of LeadingOnes
scientific article

    Statements

    The \((1+1)\) elitist black-box complexity of LeadingOnes (English)
    0 references
    0 references
    0 references
    0 references
    18 May 2018
    0 references
    0 references
    black-box complexity
    0 references
    query complexity
    0 references
    LeadingOnes
    0 references
    elitist algorithm
    0 references
    memory restriction
    0 references
    truncation selection
    0 references
    evolutionary algorithms
    0 references
    0 references
    0 references