From black-box complexity to designing new genetic algorithms (Q487994): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2014.11.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1971237725 / 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 elimination of fitness functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Convergence of Comparison-based Step-size Adaptive Randomized Search via Stability of Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3224100 / 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: Reducing the arity in unbiased black-box complexity / 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: Black-box complexities of combinatorial problems / 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: Introduction to evolutionary computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5731202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Genetic Algorithms / 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: Black-box search by unbiased variation / 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 / cites work
 
Property / cites work: On the utility of the population size for inversely fitness proportional mutation rates / rank
 
Normal rank

Latest revision as of 14:06, 9 July 2024

scientific article
Language Label Description Also known as
English
From black-box complexity to designing new genetic algorithms
scientific article

    Statements

    From black-box complexity to designing new genetic algorithms (English)
    0 references
    0 references
    0 references
    0 references
    23 January 2015
    0 references
    0 references
    heuristic search
    0 references
    theory of randomized search heuristics
    0 references
    genetic algorithms
    0 references
    runtime analysis
    0 references
    black-box complexity
    0 references
    0 references