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 *

235 related articles for article (PubMed ID: 28489414)

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

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

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

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

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

  • 6. Multiobjective optimization and hybrid evolutionary algorithm to solve constrained optimization problems.
    Wang Y; Cai Z; Guo G; Zhou Y
    IEEE Trans Syst Man Cybern B Cybern; 2007 Jun; 37(3):560-75. PubMed ID: 17550112
    [TBL] [Abstract][Full Text] [Related]  

  • 7. A new approach for analyzing average time complexity of population-based evolutionary algorithms on unimodal problems.
    Chen T; He J; Sun G; Chen G; Yao X
    IEEE Trans Syst Man Cybern B Cybern; 2009 Oct; 39(5):1092-106. PubMed ID: 19336324
    [TBL] [Abstract][Full Text] [Related]  

  • 8. The hierarchical fair competition (HFC) framework for sustainable evolutionary algorithms.
    Hu J; Goodman E; Seo K; Fan Z; Rosenberg R
    Evol Comput; 2005; 13(2):241-77. PubMed ID: 15969902
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Exploring the runtime of an evolutionary algorithm for the multi-objective shortest path problem.
    Horoba C
    Evol Comput; 2010; 18(3):357-81. PubMed ID: 20560760
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

  • 14. On the Performance of Different Genetic Programming Approaches for the SORTING Problem.
    Wagner M; Neumann F; Urli T
    Evol Comput; 2015; 23(4):583-609. PubMed ID: 25870929
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Efficient and scalable Pareto optimization by evolutionary local selection algorithms.
    Menczer F; Degeratu M; Street WN
    Evol Comput; 2000; 8(2):223-47. PubMed ID: 10843522
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. On the choice of the offspring population size in evolutionary algorithms.
    Jansen T; De Jong KA; Wegener I
    Evol Comput; 2005; 13(4):413-40. PubMed ID: 16297278
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Simulated evolution and artificial selection.
    Gibson JM
    Biosystems; 1989; 23(2-3):219-28; discussion 229. PubMed ID: 2627566
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Analysis and improvement of fitness exploitation in XCS: bounding models, tournament selection, and bilateral accuracy.
    Butz MV; Goldberg DE; Tharakunnel K
    Evol Comput; 2003; 11(3):239-77. PubMed ID: 14558912
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Problem Features versus Algorithm Performance on Rugged Multiobjective Combinatorial Fitness Landscapes.
    Daolio F; Liefooghe A; Verel S; Aguirre H; Tanaka K
    Evol Comput; 2017; 25(4):555-585. PubMed ID: 27689467
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 12.