The use of tail inequalities on the probable computational time of randomized search heuristics (Q428911): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the analysis of the \((1+1)\) evolutionary algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to analyse evolutionary algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drift analysis and average time complexity of evolutionary algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards an analytic framework for analysing the computation time of evolutionary algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of drift analysis for estimating computation time of evolutionary algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to estimating the expected first hitting time of evolutionary algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The analysis of evolutionary algorithms -- A proof that crossover really can help / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real royal road functions -- where crossover provably is essential / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the impact of the mutation-selection balance on the runtime of evolutionary algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A large population size can be unhelpful in evolutionary algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / 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: Q5306039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: First steps to the runtime complexity analysis of ant colony optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Runtime analysis of ant colony optimization with best-so-far reinforcement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Runtime analysis of a simple ant colony optimization algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Runtime analysis of a binary particle swarm optimizer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ant colony optimization and the minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics. Second international workshop, SLS 2009, Brussels, Belgium, September 3--4, 2009. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4436917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the analysis of a simple evolutionary algorithm on quadratic pseudo-Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5445229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing single source shortest paths using single-objective fitness / rank
 
Normal rank

Revision as of 09:01, 5 July 2024

scientific article
Language Label Description Also known as
English
The use of tail inequalities on the probable computational time of randomized search heuristics
scientific article

    Statements

    The use of tail inequalities on the probable computational time of randomized search heuristics (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 June 2012
    0 references
    computational complexity
    0 references
    evolutionary algorithms (EAs)
    0 references
    expected running time
    0 references
    probable computational time (PCT)
    0 references
    randomized search heuristics (RSHs)
    0 references
    tail inequalities
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers