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 *

175 related articles for article (PubMed ID: 35341258)

  • 21. Memory-efficient Transformer-based network model for Traveling Salesman Problem.
    Yang H; Zhao M; Yuan L; Yu Y; Li Z; Gu M
    Neural Netw; 2023 Apr; 161():589-597. PubMed ID: 36822144
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Solving Traveling Salesman Problems Based on Artificial Cooperative Search Algorithm.
    Liu G; Xu X; Wang F; Tang Y
    Comput Intell Neurosci; 2022; 2022():1008617. PubMed ID: 35463281
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Dynamic Flying Ant Colony Optimization (DFACO) for Solving the Traveling Salesman Problem.
    Dahan F; El Hindi K; Mathkour H; AlSalman H
    Sensors (Basel); 2019 Apr; 19(8):. PubMed ID: 30999688
    [TBL] [Abstract][Full Text] [Related]  

  • 24. An inertial neural network approach for loco-manipulation trajectory tracking of mobile robot with redundant manipulator.
    Xu C; Wang M; Chi G; Liu Q
    Neural Netw; 2022 Nov; 155():215-223. PubMed ID: 36067552
    [TBL] [Abstract][Full Text] [Related]  

  • 25. A Kohonen-like decomposition method for the Euclidean traveling salesman problem-KNIES/spl I.bar/DECOMPOSE.
    Aras N; Altinel IK; Oommen J
    IEEE Trans Neural Netw; 2003; 14(4):869-90. PubMed ID: 18238067
    [TBL] [Abstract][Full Text] [Related]  

  • 26. An Investigation into the Improvement of Local Minima of the Hopfield Network.
    Armitage AF; Gupta NK; Peng M
    Neural Netw; 1996 Oct; 9(7):1241-1253. PubMed ID: 12662596
    [TBL] [Abstract][Full Text] [Related]  

  • 27. A hopfield network learning method for bipartite subgraph problem.
    Wang RL; Tang Z; Cao QP
    IEEE Trans Neural Netw; 2004 Nov; 15(6):1458-65. PubMed ID: 15565773
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Mathematical improvement of the Hopfield model for feasible solutions to the traveling salesman problem by a synapse dynamical system.
    Takahashi Y
    IEEE Trans Syst Man Cybern B Cybern; 1998; 28(6):906-19. PubMed ID: 18256012
    [TBL] [Abstract][Full Text] [Related]  

  • 29. List-Based Simulated Annealing Algorithm for Traveling Salesman Problem.
    Zhan SH; Lin J; Zhang ZJ; Zhong YW
    Comput Intell Neurosci; 2016; 2016():1712630. PubMed ID: 27034650
    [TBL] [Abstract][Full Text] [Related]  

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

  • 31. Study on a hybrid algorithm combining enhanced ant colony optimization and double improved simulated annealing via clustering in the Traveling Salesman Problem (TSP).
    Hao T; Yingnian W; Jiaxing Z; Jing Z
    PeerJ Comput Sci; 2023; 9():e1609. PubMed ID: 37810357
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Artificial dragonfly algorithm in the Hopfield neural network for optimal Exact Boolean k satisfiability representation.
    Ali GA; Abubakar H; Alzaeemi SAS; Almawgani AHM; Sulaiman A; Tay KG
    PLoS One; 2023; 18(9):e0286874. PubMed ID: 37747876
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Solving Stochastic Reaction Networks with Maximum Entropy Lagrange Multipliers.
    Vlysidis M; Kaznessis YN
    Entropy (Basel); 2018 Sep; 20(9):. PubMed ID: 33265789
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Million city traveling salesman problem solution by divide and conquer clustering with adaptive resonance neural networks.
    Mulder SA; Wunsch DC
    Neural Netw; 2003; 16(5-6):827-32. PubMed ID: 12850040
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Parameter setting of the Hopfield network applied to TSP.
    Talaván PM; Yáñez J
    Neural Netw; 2002 Apr; 15(3):363-73. PubMed ID: 12125891
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Solving time delay fractional optimal control problems via a Gudermannian neural network and convergence results.
    Kheyrinataj F; Nazemi A; Mortezaee M
    Network; 2023; 34(1-2):122-150. PubMed ID: 36825846
    [TBL] [Abstract][Full Text] [Related]  

  • 37. A hybrid Hopfield network-genetic algorithm approach for the terminal assignment problem.
    Salcedo-Sanz S; Yao X
    IEEE Trans Syst Man Cybern B Cybern; 2004 Dec; 34(6):2343-53. PubMed ID: 15619934
    [TBL] [Abstract][Full Text] [Related]  

  • 38. A theoretical investigation into the performance of the Hopfield model.
    Aiyer SB; Niranjan M; Fallside F
    IEEE Trans Neural Netw; 1990; 1(2):204-15. PubMed ID: 18282837
    [TBL] [Abstract][Full Text] [Related]  

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

  • 40. Annealing Ant Colony Optimization with Mutation Operator for Solving TSP.
    Mohsen AM
    Comput Intell Neurosci; 2016; 2016():8932896. PubMed ID: 27999590
    [TBL] [Abstract][Full Text] [Related]  

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