BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

118 related articles for article (PubMed ID: 35857878)

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

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

  • 3. Analysis of an asymmetric mutation operator.
    Jansen T; Sudholt D
    Evol Comput; 2010; 18(1):1-26. PubMed ID: 20064023
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 7. A Dynamic Adaptive Weighted Differential Evolutionary Algorithm.
    Wu K; Liu Z; Ma N; Wang D
    Comput Intell Neurosci; 2022; 2022():1318044. PubMed ID: 35814602
    [TBL] [Abstract][Full Text] [Related]  

  • 8. A new evolutionary algorithm with structure mutation for the maximum balanced biclique problem.
    Yuan B; Li B; Chen H; Yao X
    IEEE Trans Cybern; 2015 May; 45(5):1040-53. PubMed ID: 25137737
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

  • 15. Performance up-gradation of Symbiotic Organisms Search by Backtracking Search Algorithm.
    Nama S; Saha AK; Sharma S
    J Ambient Intell Humaniz Comput; 2022; 13(12):5505-5546. PubMed ID: 33868507
    [TBL] [Abstract][Full Text] [Related]  

  • 16. A new approach to population sizing for memetic algorithms: a case study for the multidimensional assignment problem.
    Karapetyan D; Gutin G
    Evol Comput; 2011; 19(3):345-71. PubMed ID: 20868263
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem.
    Nallaperuma S; Neumann F; Sudholt D
    Evol Comput; 2017; 25(4):673-705. PubMed ID: 27893278
    [TBL] [Abstract][Full Text] [Related]  

  • 18. A cuckoo search algorithm for multimodal optimization.
    Cuevas E; Reyna-Orta A
    ScientificWorldJournal; 2014; 2014():497514. PubMed ID: 25147850
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Approximation and Parameterized Runtime Analysis of Evolutionary Algorithms for the Maximum Cut Problem.
    Zhou Y; Lai X; Li K
    IEEE Trans Cybern; 2015 Aug; 45(8):1491-8. PubMed ID: 25222964
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Automated discovery of local search heuristics for satisfiability testing.
    Fukunaga AS
    Evol Comput; 2008; 16(1):31-61. PubMed ID: 18386995
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.