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 *

138 related articles for article (PubMed ID: 31167309)

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

  • 22. Solving Multiextremal Problems by Using Recurrent Neural Networks.
    Malek A; Hosseinipour-Mahani N
    IEEE Trans Neural Netw Learn Syst; 2018 May; 29(5):1562-1574. PubMed ID: 28328515
    [TBL] [Abstract][Full Text] [Related]  

  • 23. A path following algorithm for the graph matching problem.
    Zaslavskiy M; Bach F; Vert JP
    IEEE Trans Pattern Anal Mach Intell; 2009 Dec; 31(12):2227-42. PubMed ID: 19834143
    [TBL] [Abstract][Full Text] [Related]  

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

  • 25. On the computational complexity of binary and analog symmetric hopfield nets.
    Sima J; Orponen P; Antti-Poika T
    Neural Comput; 2000 Dec; 12(12):2965-89. PubMed ID: 11112262
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Search graph structure and its implications for multi-graph constrained routing and scheduling problems.
    Weiszer M; Burke EK; Chen J
    Sci Rep; 2022 Sep; 12(1):14860. PubMed ID: 36050342
    [TBL] [Abstract][Full Text] [Related]  

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

  • 28. Elastic Net Constraint-Based Tensor Model for High-Order Graph Matching.
    Zhu H; Cui C; Deng L; Cheung RCC; Yan H
    IEEE Trans Cybern; 2021 Aug; 51(8):4062-4074. PubMed ID: 31536028
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Cooperative updating in the Hopfield model.
    Munehisa T; Kobayashi M; Yamazaki H
    IEEE Trans Neural Netw; 2001; 12(5):1243-51. PubMed ID: 18249951
    [TBL] [Abstract][Full Text] [Related]  

  • 30. An analogue approach to the travelling salesman problem using an elastic net method.
    Durbin R; Willshaw D
    Nature; 1987 Apr 16-22; 326(6114):689-91. PubMed ID: 3561510
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Exact solution of large asymmetric traveling salesman problems.
    Miller DL; Pekny JF
    Science; 1991 Feb; 251(4995):754-61. PubMed ID: 17775454
    [TBL] [Abstract][Full Text] [Related]  

  • 32. A Projection Neural Network for Constrained Quadratic Minimax Optimization.
    Liu Q; Wang J
    IEEE Trans Neural Netw Learn Syst; 2015 Nov; 26(11):2891-900. PubMed ID: 25966485
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Learnable Graph Matching: A Practical Paradigm for Data Association.
    He J; Huang Z; Wang N; Zhang Z
    IEEE Trans Pattern Anal Mach Intell; 2024 Jul; 46(7):4880-4895. PubMed ID: 38319774
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Estimation and marginalization using the Kikuchi approximation methods.
    Pakzad P; Anantharam V
    Neural Comput; 2005 Aug; 17(8):1836-73. PubMed ID: 15969920
    [TBL] [Abstract][Full Text] [Related]  

  • 35. An Efficient Multilinear Optimization Framework for Hypergraph Matching.
    Nguyen Q; Tudisco F; Gautier A; Hein M
    IEEE Trans Pattern Anal Mach Intell; 2017 Jun; 39(6):1054-1075. PubMed ID: 27254858
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Generating subtour elimination constraints for the TSP from pure integer solutions.
    Pferschy U; Staněk R
    Cent Eur J Oper Res; 2017; 25(1):231-260. PubMed ID: 28690424
    [TBL] [Abstract][Full Text] [Related]  

  • 37. The simultaneous recurrent neural network for addressing the scaling problem in static optimization.
    Serpen G; Patwardhan A; Geib J
    Int J Neural Syst; 2001 Oct; 11(5):477-87. PubMed ID: 11709814
    [TBL] [Abstract][Full Text] [Related]  

  • 38. MISAGA: An Algorithm for Mining Interesting Subgraphs in Attributed Graphs.
    He T; Chan KCC
    IEEE Trans Cybern; 2018 May; 48(5):1369-1382. PubMed ID: 28459699
    [TBL] [Abstract][Full Text] [Related]  

  • 39. A deterministic annealing algorithm for approximating a solution of the linearly constrained nonconvex quadratic minimization problem.
    Dang C; Liang J; Yang Y
    Neural Netw; 2013 Mar; 39():1-11. PubMed ID: 23296021
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Fitting a geometric graph to a protein-protein interaction network.
    Higham DJ; Rasajski M; Przulj N
    Bioinformatics; 2008 Apr; 24(8):1093-9. PubMed ID: 18344248
    [TBL] [Abstract][Full Text] [Related]  

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