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 *

157 related articles for article (PubMed ID: 33197211)

  • 1. 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]  

  • 2. 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]  

  • 3. 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]  

  • 4. Theoretical Analyses of Multiobjective Evolutionary Algorithms on Multimodal Objectives.
    Zheng W; Doerr B
    Evol Comput; 2023 Dec; 31(4):337-373. PubMed ID: 37023353
    [TBL] [Abstract][Full Text] [Related]  

  • 5. 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]  

  • 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. Drift Analysis with Fitness Levels for Elitist Evolutionary Algorithms.
    He J; Zhou Y
    Evol Comput; 2024 Mar; ():1-25. PubMed ID: 38530750
    [TBL] [Abstract][Full Text] [Related]  

  • 8. 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]  

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

  • 10. Runtime analysis of the (mu+1) EA on simple Pseudo-Boolean functions.
    Witt C
    Evol Comput; 2006; 14(1):65-86. PubMed ID: 16536891
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Simple Hyper-Heuristics Control the Neighbourhood Size of Randomised Local Search Optimally for LeadingOnes
    Lissovoi A; Oliveto PS; Warwicker JA
    Evol Comput; 2020; 28(3):437-461. PubMed ID: 31120773
    [TBL] [Abstract][Full Text] [Related]  

  • 12. 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]  

  • 13. Speeding up evolutionary algorithms through asymmetric mutation operators.
    Doerr B; Hebbinghaus N; Neumann F
    Evol Comput; 2007; 15(4):401-10. PubMed ID: 18021012
    [TBL] [Abstract][Full Text] [Related]  

  • 14. 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]  

  • 15. Proving sequence aligners can guarantee accuracy in almost
    Shaw J; Yu YW
    Genome Res; 2023 Jul; 33(7):1175-1187. PubMed ID: 36990779
    [TBL] [Abstract][Full Text] [Related]  

  • 16. 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]  

  • 17. The Unrestricted Black-Box Complexity of Jump Functions.
    Buzdalov M; Doerr B; Kever M
    Evol Comput; 2016; 24(4):719-744. PubMed ID: 27243329
    [TBL] [Abstract][Full Text] [Related]  

  • 18. 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]  

  • 19. 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]  

  • 20. Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem.
    Pourhassan M; Neumann F
    Evol Comput; 2019; 27(3):525-558. PubMed ID: 29932364
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.