Suchergebnisse - "comparison-based algorithm"

  • Treffer 1 - 7 von 7
Treffer weiter einschränken
  1. 1

    Theoretical Analysis of Explicit Averaging and Novel Sign Averaging in Comparison-Based Search von Morinaga, Daiki, Akimoto, Youhei

    ISSN: 1089-778X, 1941-0026
    Veröffentlicht: IEEE 01.10.2025
    Veröffentlicht in IEEE transactions on evolutionary computation (01.10.2025)
    “… In black-box optimization, noise in the objective function is often inevitable. Noise disrupts the ranking of candidate solutions in comparison-based …”
    Volltext
    Journal Article
  2. 2

    An ODE method to prove the geometric convergence of adaptive stochastic algorithms von Akimoto, Youhei, Auger, Anne, Hansen, Nikolaus

    ISSN: 0304-4149, 1879-209X
    Veröffentlicht: Elsevier B.V 01.03.2022
    Veröffentlicht in Stochastic processes and their applications (01.03.2022)
    “… We consider stochastic algorithms derived from methods for solving deterministic optimization problems, especially comparison-based algorithms derived from …”
    Volltext
    Journal Article
  3. 3

    Fragile complexity of adaptive algorithms von Bose, Prosenjit, Cano, Pilar, Fagerberg, Rolf, Iacono, John, Jacob, Riko, Langerman, Stefan

    ISSN: 0304-3975, 1879-2294
    Veröffentlicht: Elsevier B.V 05.06.2022
    Veröffentlicht in Theoretical computer science (05.06.2022)
    “… The fragile complexity of a comparison-based algorithm is f(n) if each input element participates in O(f(n)) comparisons. In this paper, we explore the fragile …”
    Volltext
    Journal Article
  4. 4

    Entropy conservation for comparison-based algorithms von Schellekens, M.P.

    ISSN: 0166-8641, 1879-3207
    Veröffentlicht: Elsevier B.V 15.03.2022
    Veröffentlicht in Topology and its applications (15.03.2022)
    “… Comparison-based algorithms are algorithms for which the execution of each operation is solely based on the outcome of a series of comparisons between elements …”
    Volltext
    Journal Article
  5. 5

    Introducing Elitist Black-Box Models: When Does Elitist Behavior Weaken the Performance of Evolutionary Algorithms? von Doerr, Carola, Lengler, Johannes

    ISSN: 1530-9304, 1530-9304
    Veröffentlicht: United States 01.12.2017
    Veröffentlicht in Evolutionary computation (01.12.2017)
    “… Black-box complexity theory provides lower bounds for the runtime of black-box optimizers like evolutionary algorithms and other search heuristics and serves …”
    Weitere Angaben
    Journal Article
  6. 6

    On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures von Chan, Timothy M., Lee, Patrick

    ISSN: 0179-5376, 1432-0444
    Veröffentlicht: New York Springer US 01.04.2015
    Veröffentlicht in Discrete & computational geometry (01.04.2015)
    “… Many standard problems in computational geometry have been solved asymptotically optimally as far as comparison-based algorithms are concerned, but there has …”
    Volltext
    Journal Article
  7. 7

    Sorting with expensive comparands von Richards, Dana

    ISSN: 0020-7160, 1029-0265
    Veröffentlicht: Abingdon Gordon and Breach Science Publishers 01.01.1984
    Veröffentlicht in International journal of computer mathematics (01.01.1984)
    “… Suppose each key, of an n element list to be sorted, has a price associated with it. The cost of a comparison is the sum of the prices and the cost of a …”
    Volltext
    Journal Article