BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

263 related articles for article (PubMed ID: 31120773)

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

  • 2. A Case Study of Controlling Crossover in a Selection Hyper-heuristic Framework Using the Multidimensional Knapsack Problem.
    Drake JH; Özcan E; Burke EK
    Evol Comput; 2016; 24(1):113-41. PubMed ID: 25635698
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Hyper-heuristics with low level parameter adaptation.
    Ren Z; Jiang H; Xuan J; Luo Z
    Evol Comput; 2012; 20(2):189-227. PubMed ID: 22171917
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Offline Learning with a Selection Hyper-Heuristic: An Application to Water Distribution Network Optimisation.
    Yates WB; Keedwell EC
    Evol Comput; 2021 Jun; 29(2):187-210. PubMed ID: 32567958
    [TBL] [Abstract][Full Text] [Related]  

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

  • 6. Inferring Future Landscapes: Sampling the Local Optima Level.
    Thomson SL; Ochoa G; Verel S; Veerapen N
    Evol Comput; 2020; 28(4):621-641. PubMed ID: 32101026
    [TBL] [Abstract][Full Text] [Related]  

  • 7. A hybrid Q-learning sine-cosine-based strategy for addressing the combinatorial test suite minimization problem.
    Zamli KZ; Din F; Ahmed BS; Bures M
    PLoS One; 2018; 13(5):e0195675. PubMed ID: 29771918
    [TBL] [Abstract][Full Text] [Related]  

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

  • 9. A dynamic multiarmed bandit-gene expression programming hyper-heuristic for combinatorial optimization problems.
    Sabar NR; Ayob M; Kendall G; Qu R
    IEEE Trans Cybern; 2015 Feb; 45(2):217-28. PubMed ID: 24951713
    [TBL] [Abstract][Full Text] [Related]  

  • 10. A Hyper-Heuristic Ensemble Method for Static Job-Shop Scheduling.
    Hart E; Sim K
    Evol Comput; 2016; 24(4):609-635. PubMed ID: 27120113
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A lifelong learning hyper-heuristic method for bin packing.
    Sim K; Hart E; Paechter B
    Evol Comput; 2015; 23(1):37-67. PubMed ID: 24512321
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Hybrid Self-Adaptive Evolution Strategies Guided by Neighborhood Structures for Combinatorial Optimization Problems.
    Coelho VN; Coelho IM; Souza MJ; Oliveira TA; Cota LP; Haddad MN; Mladenovic N; Silva RC; Guimarães FG
    Evol Comput; 2016; 24(4):637-666. PubMed ID: 27258842
    [TBL] [Abstract][Full Text] [Related]  

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

  • 14. Analysis of Randomised Search Heuristics for Dynamic Optimisation.
    Jansen T; Zarges C
    Evol Comput; 2015; 23(4):513-41. PubMed ID: 26241197
    [TBL] [Abstract][Full Text] [Related]  

  • 15. An Analysis of Super-Net Heuristics in Weight-Sharing NAS.
    Yu K; Ranftl R; Salzmann M
    IEEE Trans Pattern Anal Mach Intell; 2022 Nov; 44(11):8110-8124. PubMed ID: 34460367
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 18. A Hidden Markov Model Approach to the Problem of Heuristic Selection in Hyper-Heuristics with a Case Study in High School Timetabling Problems.
    Kheiri A; Keedwell E
    Evol Comput; 2017; 25(3):473-501. PubMed ID: 27258841
    [TBL] [Abstract][Full Text] [Related]  

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

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

    [Next]    [New Search]
    of 14.