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 *

122 related articles for article (PubMed ID: 30161217)

  • 1. A PageRank-based heuristic for the minimization of open stacks problem.
    Frinhani RMD; de Carvalho MAM; Soma NY
    PLoS One; 2018; 13(8):e0203076. PubMed ID: 30161217
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 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. Faster heuristics for graph burning.
    Gautam RK; Kare AS; S DB
    Appl Intell (Dordr); 2022; 52(2):1351-1361. PubMed ID: 34764602
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

  • 11. Comparison between a quantum annealer and a classical approximation algorithm for computing the ground state of an Ising spin glass.
    Yaacoby R; Schaar N; Kellerhals L; Raz O; Hermelin D; Pugatch R
    Phys Rev E; 2022 Mar; 105(3-2):035305. PubMed ID: 35428085
    [TBL] [Abstract][Full Text] [Related]  

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

  • 13. Iterated Local Search and Other Algorithms for Buffered Two-Machine Permutation Flow Shops with Constant Processing Times on One Machine.
    Le HT; Geser P; Middendorf M
    Evol Comput; 2021 Sep; 29(3):415-439. PubMed ID: 34467994
    [TBL] [Abstract][Full Text] [Related]  

  • 14. HA-CCP: A Hybrid Algorithm for Solving Capacitated Clustering Problem.
    Liu Y; Guo P; Zeng Y
    Comput Intell Neurosci; 2022; 2022():6400318. PubMed ID: 35096045
    [TBL] [Abstract][Full Text] [Related]  

  • 15. A heuristic method for solving the Steiner tree problem in graphs using network centralities.
    Fujita M; Shimada Y; Kimura T; Ikeguchi T
    PLoS One; 2024; 19(6):e0303764. PubMed ID: 38843249
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Numerical solution to generalized Burgers'-Fisher equation using Exp-function method hybridized with heuristic computation.
    Malik SA; Qureshi IM; Amir M; Malik AN; Haq I
    PLoS One; 2015; 10(3):e0121728. PubMed ID: 25811858
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Multi-start heuristic approaches for one-to-one pickup and delivery problems with shortest-path transport along real-life paths.
    Qi X; Fu Z; Xiong J; Zha W
    PLoS One; 2020; 15(2):e0227702. PubMed ID: 32027655
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 20. Heuristic Tree-Partition-Based Parallel Method for Biophysically Detailed Neuron Simulation.
    Zhang Y; Du K; Huang T
    Neural Comput; 2023 Mar; 35(4):627-644. PubMed ID: 36746142
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.