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 *

102 related articles for article (PubMed ID: 25222719)

  • 1. New insights into diversification of hyper-heuristics.
    Ren Z; Jiang H; Xuan J; Hu Y; Luo Z
    IEEE Trans Cybern; 2014 Oct; 44(10):1747-61. PubMed ID: 25222719
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

  • 8. Solving the multiple competitive facilities location and design problem on the plane.
    Redondo JL; Fernández J; García I; Ortigosa PM
    Evol Comput; 2009; 17(1):21-53. PubMed ID: 19207087
    [TBL] [Abstract][Full Text] [Related]  

  • 9. A hyper-heuristic for the Longest Common Subsequence problem.
    Tabataba FS; Mousavi SR
    Comput Biol Chem; 2012 Feb; 36():42-54. PubMed ID: 22286085
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Longest common substring in Longest Common Subsequence's solution service: A novel hyper-heuristic.
    Abdi A; Hajsaeedi M; Hooshmand M
    Comput Biol Chem; 2023 Aug; 105():107882. PubMed ID: 37244077
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A review of reinforcement learning based hyper-heuristics.
    Li C; Wei X; Wang J; Wang S; Zhang S
    PeerJ Comput Sci; 2024; 10():e2141. PubMed ID: 38983203
    [TBL] [Abstract][Full Text] [Related]  

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

  • 13. Heuristic decision making.
    Gigerenzer G; Gaissmaier W
    Annu Rev Psychol; 2011; 62():451-82. PubMed ID: 21126183
    [TBL] [Abstract][Full Text] [Related]  

  • 14. A tree search algorithm towards solving Ising formulated combinatorial optimization problems.
    Cen Y; Das D; Fong X
    Sci Rep; 2022 Aug; 12(1):14755. PubMed ID: 36042250
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Evolutionary squeaky wheel optimization: a new framework for analysis.
    Li J; Parkes AJ; Burke EK
    Evol Comput; 2011; 19(3):405-28. PubMed ID: 21265626
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Experimental Matching of Instances to Heuristics for Constraint Satisfaction Problems.
    Moreno-Scott JH; Ortiz-Bayliss JC; Terashima-Marín H; Conant-Pablos SE
    Comput Intell Neurosci; 2016; 2016():7349070. PubMed ID: 26949383
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Meta-Heuristic Combining Prior Online and Offline Information for the Quadratic Assignment Problem.
    Sun J; Zhang Q; Yao X
    IEEE Trans Cybern; 2014 Mar; 44(3):429-44. PubMed ID: 23757559
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Payoff-monotonic game dynamics and the maximum clique problem.
    Pelillo M; Torsello A
    Neural Comput; 2006 May; 18(5):1215-58. PubMed ID: 16595063
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Feature-Based Diversity Optimization for Problem Instance Classification.
    Gao W; Nallaperuma S; Neumann F
    Evol Comput; 2021; 29(1):107-128. PubMed ID: 32551995
    [TBL] [Abstract][Full Text] [Related]  

  • 20. EHHR: an efficient evolutionary hyper-heuristic based recommender framework for short-text classifier selection.
    Almas B; Mujtaba H; Khan KU
    Cluster Comput; 2023; 26(2):1425-1446. PubMed ID: 36247806
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.