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 *

248 related articles for article (PubMed ID: 27034650)

  • 61. Solving traveling salesman problems with DNA molecules encoding numerical values.
    Lee JY; Shin SY; Park TH; Zhang BT
    Biosystems; 2004 Dec; 78(1-3):39-47. PubMed ID: 15555757
    [TBL] [Abstract][Full Text] [Related]  

  • 62. Parameter incremental learning algorithm for neural networks.
    Wan S; Banta LE
    IEEE Trans Neural Netw; 2006 Nov; 17(6):1424-38. PubMed ID: 17131658
    [TBL] [Abstract][Full Text] [Related]  

  • 63. Using hysteresis for optimization.
    Zaránd G; Pázmándi F; Pál KF; Zimányi GT
    Phys Rev Lett; 2002 Oct; 89(15):150201. PubMed ID: 12365973
    [TBL] [Abstract][Full Text] [Related]  

  • 64. On approximating a new generalization of traveling salesman problem.
    Huang Z; Liao X; Naik PA; Lu X
    Heliyon; 2024 May; 10(10):e31297. PubMed ID: 38818174
    [TBL] [Abstract][Full Text] [Related]  

  • 65. Multi-objective simulated annealing for hyper-parameter optimization in convolutional neural networks.
    Gülcü A; Kuş Z
    PeerJ Comput Sci; 2021; 7():e338. PubMed ID: 33816989
    [TBL] [Abstract][Full Text] [Related]  

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

  • 67. Broadcast scheduling in wireless multihop networks using a neural-network-based hybrid algorithm.
    Shi H; Wang L
    Neural Netw; 2005; 18(5-6):765-71. PubMed ID: 16087313
    [TBL] [Abstract][Full Text] [Related]  

  • 68. Scheduling multiprocessor job with resource and timing constraints using neural networks.
    Huang YM; Chen RM
    IEEE Trans Syst Man Cybern B Cybern; 1999; 29(4):490-502. PubMed ID: 18252324
    [TBL] [Abstract][Full Text] [Related]  

  • 69. Approximating a solution of the s-t max-cut problem with a deterministic annealing algorithm.
    Dang C
    Neural Netw; 2000 Sep; 13(7):801-10. PubMed ID: 11152210
    [TBL] [Abstract][Full Text] [Related]  

  • 70. Slow Heat-Based Hybrid Simulated Annealing Algorithm in Vehicular Ad Hoc Network.
    Pagadala PK; Kumari PLS; Thakur D; Bhardwaj V; Shahid M; Buradi A; Razak A; Ketema A
    Comput Intell Neurosci; 2023; 2023():9918748. PubMed ID: 36844694
    [TBL] [Abstract][Full Text] [Related]  

  • 71. An approximation algorithm for graph partitioning via deterministic annealing neural network.
    Wu Z; Karimi HR; Dang C
    Neural Netw; 2019 Sep; 117():191-200. PubMed ID: 31174047
    [TBL] [Abstract][Full Text] [Related]  

  • 72. Automatic Combination of Operators in a Genetic Algorithm to Solve the Traveling Salesman Problem.
    Contreras-Bolton C; Parada V
    PLoS One; 2015; 10(9):e0137724. PubMed ID: 26367182
    [TBL] [Abstract][Full Text] [Related]  

  • 73. [The utility boiler low NOx combustion optimization based on ANN and simulated annealing algorithm].
    Zhou H; Qian X; Zheng L; Weng A; Cen K
    Huan Jing Ke Xue; 2003 Nov; 24(6):63-7. PubMed ID: 14768567
    [TBL] [Abstract][Full Text] [Related]  

  • 74. Hybrid simulated annealing and its application to optimization of hidden Markov models for visual speech recognition.
    Lee JS; Park CH
    IEEE Trans Syst Man Cybern B Cybern; 2010 Aug; 40(4):1188-96. PubMed ID: 20064758
    [TBL] [Abstract][Full Text] [Related]  

  • 75. An Enhanced Artificial Bee Colony Algorithm with Solution Acceptance Rule and Probabilistic Multisearch.
    Yurtkuran A; Emel E
    Comput Intell Neurosci; 2016; 2016():8085953. PubMed ID: 26819591
    [TBL] [Abstract][Full Text] [Related]  

  • 76. Multi-Objective Neural Evolutionary Algorithm for Combinatorial Optimization Problems.
    Shao Y; Lin JC; Srivastava G; Guo D; Zhang H; Yi H; Jolfaei A
    IEEE Trans Neural Netw Learn Syst; 2023 Apr; 34(4):2133-2143. PubMed ID: 34473629
    [TBL] [Abstract][Full Text] [Related]  

  • 77. Simulated annealing and weight decay in adaptive learning: the SARPROP algorithm.
    Treadgold NK; Gedeon TD
    IEEE Trans Neural Netw; 1998; 9(4):662-8. PubMed ID: 18252489
    [TBL] [Abstract][Full Text] [Related]  

  • 78. Information theory inspired optimization algorithm for efficient service orchestration in distributed systems.
    Lima MS
    PLoS One; 2021; 16(1):e0242285. PubMed ID: 33395689
    [TBL] [Abstract][Full Text] [Related]  

  • 79. Ant Colony Optimization With Local Search for Dynamic Traveling Salesman Problems.
    Mavrovouniotis M; Muller FM; Shengxiang Yang
    IEEE Trans Cybern; 2017 Jul; 47(7):1743-1756. PubMed ID: 27323387
    [TBL] [Abstract][Full Text] [Related]  

  • 80. A robust periodic capacitated arc routing problem for urban waste collection considering drivers and crew's working time.
    Tirkolaee EB; Mahdavi I; Mehdi Seyyed Esfahani M
    Waste Manag; 2018 Jun; 76():138-146. PubMed ID: 29599022
    [TBL] [Abstract][Full Text] [Related]  

    [Previous]   [Next]    [New Search]
    of 13.