These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

116 related articles for article (PubMed ID: 33480820)

  • 1. Maximizing Drift Is Not Optimal for Solving OneMax.
    Buskulic N; Doerr C
    Evol Comput; 2021 Dec; 29(4):521-541. PubMed ID: 33480820
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift.
    Doerr B
    Evol Comput; 2021 Jun; 29(2):305-329. PubMed ID: 33197211
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Unbiased Black-Box Complexities of Jump Functions.
    Doerr B; Doerr C; Kötzing T
    Evol Comput; 2015; 23(4):641-70. PubMed ID: 26135718
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Introducing Elitist Black-Box Models: When Does Elitist Behavior Weaken the Performance of Evolutionary Algorithms?
    Doerr C; Lengler J
    Evol Comput; 2017; 25(4):587-606. PubMed ID: 27700278
    [TBL] [Abstract][Full Text] [Related]  

  • 5. On Proportions of Fit Individuals in Population of Mutation-Based Evolutionary Algorithm with Tournament Selection.
    Eremeev AV
    Evol Comput; 2018; 26(2):269-297. PubMed ID: 28489414
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Fitness Probability Distribution of Bit-Flip Mutation.
    Chicano F; Sutton AM; Whitley LD; Alba E
    Evol Comput; 2015; 23(2):217-48. PubMed ID: 24885680
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Principled Design and Runtime Analysis of Abstract Convex Evolutionary Search.
    Moraglio A; Sudholt D
    Evol Comput; 2017; 25(2):205-236. PubMed ID: 26469220
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Parameterized runtime analyses of evolutionary algorithms for the planar euclidean traveling salesperson problem.
    Sutton AM; Neumann F; Nallaperuma S
    Evol Comput; 2014; 22(4):595-628. PubMed ID: 24479542
    [TBL] [Abstract][Full Text] [Related]  

  • 9. How Crossover Speeds up Building Block Assembly in Genetic Algorithms.
    Sudholt D
    Evol Comput; 2017; 25(2):237-274. PubMed ID: 26581016
    [TBL] [Abstract][Full Text] [Related]  

  • 10. When Hillclimbers Beat Genetic Algorithms in Multimodal Optimization.
    Lobo FG; Bazargani M
    Evol Comput; 2022 Dec; 30(4):535-559. PubMed ID: 35604959
    [TBL] [Abstract][Full Text] [Related]  

  • 11. On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation.
    Corus D; He J; Jansen T; Oliveto PS; Sudholt D; Zarges C
    Algorithmica; 2017; 78(2):714-740. PubMed ID: 32103848
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Analysis of (1+1) evolutionary algorithm and randomized local search with memory.
    Sung CW; Yuen SY
    Evol Comput; 2011; 19(2):287-323. PubMed ID: 20868262
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Modelling Evolutionary Algorithms with Stochastic Differential Equations.
    Heredia JP
    Evol Comput; 2018; 26(4):657-686. PubMed ID: 29155604
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Parameterized Analysis of Multiobjective Evolutionary Algorithms and the Weighted Vertex Cover Problem.
    Pourhassan M; Shi F; Neumann F
    Evol Comput; 2019; 27(4):559-575. PubMed ID: 31012735
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Co-Optimization Free Lunches: Tractability of Optimal Black-Box Algorithms for Maximizing Expected Utility.
    Popovici E
    Evol Comput; 2018; 26(1):145-175. PubMed ID: 28358647
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Stagnation Detection with Randomized Local Search.
    Rajabi A; Witt C
    Evol Comput; 2023 Mar; 31(1):1-29. PubMed ID: 35857878
    [TBL] [Abstract][Full Text] [Related]  

  • 17. The Univariate Marginal Distribution Algorithm Copes Well with Deception and Epistasis.
    Doerr B; Krejca MS
    Evol Comput; 2021 Dec; 29(4):543-563. PubMed ID: 34623434
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms.
    Friedrich T; Neumann F
    Evol Comput; 2015; 23(4):543-58. PubMed ID: 26135719
    [TBL] [Abstract][Full Text] [Related]  

  • 19. An Analytical Framework for Runtime of a Class of Continuous Evolutionary Algorithms.
    Zhang Y; Hu G
    Comput Intell Neurosci; 2015; 2015():485215. PubMed ID: 26366166
    [TBL] [Abstract][Full Text] [Related]  

  • 20. On the Runtime Analysis of the Clearing Diversity-Preserving Mechanism.
    Osuna EC; Sudholt D
    Evol Comput; 2019; 27(3):403-433. PubMed ID: 29746158
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.