BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

224 related articles for article (PubMed ID: 21609273)

  • 1. Automating the packing heuristic design process with genetic programming.
    Burke EK; Hyde MR; Kendall G; Woodward J
    Evol Comput; 2012; 20(1):63-89. PubMed ID: 21609273
    [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. 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]  

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

  • 5. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.
    Guturu P; Dantu R
    IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):645-66. PubMed ID: 18558530
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 9. Multidimensional knapsack problem: a fitness landscape analysis.
    Tavares J; Pereira FB; Costa E
    IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):604-16. PubMed ID: 18558527
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Direct heuristic dynamic programming for damping oscillations in a large power system.
    Lu C; Si J; Xie X
    IEEE Trans Syst Man Cybern B Cybern; 2008 Aug; 38(4):1008-13. PubMed ID: 18632392
    [TBL] [Abstract][Full Text] [Related]  

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

  • 12. Extending the "Open-Closed Principle" to Automated Algorithm Configuration.
    Swan J; Adriænsen S; Barwell AD; Hammond K; White DR
    Evol Comput; 2019; 27(1):173-193. PubMed ID: 30557042
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: a case study for the multidimensional knapsack problem.
    Raidl GR; Gottlieb J
    Evol Comput; 2005; 13(4):441-75. PubMed ID: 16297279
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. Automatic protein design with all atom force-fields by exact and heuristic optimization.
    Wernisch L; Hery S; Wodak SJ
    J Mol Biol; 2000 Aug; 301(3):713-36. PubMed ID: 10966779
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Learning to solve planning problems efficiently by means of genetic programming.
    Aler R; Borrajo D; Isasi P
    Evol Comput; 2001; 9(4):387-420. PubMed ID: 11709102
    [TBL] [Abstract][Full Text] [Related]  

  • 17. A Hybrid Genetic Programming Algorithm for Automated Design of Dispatching Rules.
    Nguyen S; Mei Y; Xue B; Zhang M
    Evol Comput; 2019; 27(3):467-496. PubMed ID: 29863420
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Automating software development with domain-specific modelling.
    Luoma J
    Med Device Technol; 2004 Nov; 15(9):46-7. PubMed ID: 16231789
    [TBL] [Abstract][Full Text] [Related]  

  • 19. MAWA∗-a memory-bounded anytime heuristic-search algorithm.
    Vadlamudi SG; Aine S; Chakrabarti PP
    IEEE Trans Syst Man Cybern B Cybern; 2011 Jun; 41(3):725-35. PubMed ID: 21095872
    [TBL] [Abstract][Full Text] [Related]  

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

    [Next]    [New Search]
    of 12.