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 *

198 related articles for article (PubMed ID: 26949383)

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

  • 2. Exploring the Impact of Early Decisions in Variable Ordering for Constraint Satisfaction Problems.
    Ortiz-Bayliss JC; Amaya I; Conant-Pablos SE; Terashima-Marín H
    Comput Intell Neurosci; 2018; 2018():6103726. PubMed ID: 29681923
    [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. Metaheuristic Algorithms for Convolution Neural Network.
    Rere LM; Fanany MI; Arymurthy AM
    Comput Intell Neurosci; 2016; 2016():1537325. PubMed ID: 27375738
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 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. Constraint Handling Guided by Landscape Analysis in Combinatorial and Continuous Search Spaces.
    Malan KM; Moser I
    Evol Comput; 2019; 27(2):267-289. PubMed ID: 29528726
    [TBL] [Abstract][Full Text] [Related]  

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

  • 12. Multi-Objectivising Combinatorial Optimisation Problems by Means of Elementary Landscape Decompositions.
    Ceberio J; Calvo B; Mendiburu A; Lozano JA
    Evol Comput; 2019; 27(2):291-311. PubMed ID: 29446983
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Constraint satisfaction adaptive neural network and heuristics combined approaches for generalized job-shop scheduling.
    Yang S; Wang D
    IEEE Trans Neural Netw; 2000; 11(2):474-86. PubMed ID: 18249776
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Stochastic matching problem.
    Altarelli F; Braunstein A; Ramezanpour A; Zecchina R
    Phys Rev Lett; 2011 May; 106(19):190601. PubMed ID: 21668134
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 17. Parameter identification of robot manipulators: a heuristic particle swarm search approach.
    Yan D; Lu Y; Levy D
    PLoS One; 2015; 10(6):e0129157. PubMed ID: 26039090
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Using Stochastic Spiking Neural Networks on SpiNNaker to Solve Constraint Satisfaction Problems.
    Fonseca Guerra GA; Furber SB
    Front Neurosci; 2017; 11():714. PubMed ID: 29311791
    [TBL] [Abstract][Full Text] [Related]  

  • 19. When is Psychology Research Useful in Artificial Intelligence? A Case for Reducing Computational Complexity in Problem Solving.
    Hélie S; Pizlo Z
    Top Cogn Sci; 2022 Oct; 14(4):687-701. PubMed ID: 34467642
    [TBL] [Abstract][Full Text] [Related]  

  • 20. An experimental study of hybridizing cultural algorithms and local search.
    Nguyen TT; Yao X
    Int J Neural Syst; 2008 Feb; 18(1):1-17. PubMed ID: 18344219
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 10.