Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax (Q1725646): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57200540, #quickstatements; #temporary_batch_1707303357582
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: W3101350160 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1704.00026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sharp Uniform Bound for the Distribution of Sums of Bernoulli Trials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A rigorous analysis of the compact genetic algorithm for linear functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Benefit of Recombination in Noisy Evolutionary Search / 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: Mean, Median and Mode in Binomial Distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on the Run Time of the Univariate Marginal Distribution Algorithm on OneMax / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2769922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved time complexity analysis of the simple genetic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Successes in Independent Trials / 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

Revision as of 06:07, 18 July 2024

scientific article
Language Label Description Also known as
English
Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax
scientific article

    Statements

    Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax (English)
    0 references
    0 references
    0 references
    14 February 2019
    0 references
    randomized search heuristics
    0 references
    estimation-of-distribution algorithms
    0 references
    UMDA
    0 references
    running time analysis
    0 references

    Identifiers

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