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 *

181 related articles for article (PubMed ID: 31174047)

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

  • 2. A deterministic annealing algorithm for approximating a solution of the min-bisection problem.
    Dang C; Ma W; Liang J
    Neural Netw; 2009 Jan; 22(1):58-66. PubMed ID: 18995985
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 5. A deterministic annealing algorithm for approximating a solution of the max-bisection problem.
    Dang C; He L; Hui IK
    Neural Netw; 2002 Apr; 15(3):441-58. PubMed ID: 12125896
    [TBL] [Abstract][Full Text] [Related]  

  • 6. A deterministic annealing algorithm for the minimum concave cost network flow problem.
    Dang C; Sun Y; Wang Y; Yang Y
    Neural Netw; 2011 Sep; 24(7):699-708. PubMed ID: 21482456
    [TBL] [Abstract][Full Text] [Related]  

  • 7. A globally convergent Lagrange and barrier function iterative algorithm for the traveling salesman problem.
    Dang C; Xu L
    Neural Netw; 2001 Mar; 14(2):217-30. PubMed ID: 11316235
    [TBL] [Abstract][Full Text] [Related]  

  • 8. A Lagrange multiplier and Hopfield-type barrier function method for the traveling salesman problem.
    Dang C; Xu L
    Neural Comput; 2002 Feb; 14(2):303-24. PubMed ID: 11802914
    [TBL] [Abstract][Full Text] [Related]  

  • 9. A Deterministic Annealing Neural Network Algorithm for the Minimum Concave Cost Transportation Problem.
    Wu Z; Karimi HR; Dang C
    IEEE Trans Neural Netw Learn Syst; 2020 Oct; 31(10):4354-4366. PubMed ID: 31869806
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Graph partitioning using annealed neural networks.
    Van den Bout DE; Miller TK
    IEEE Trans Neural Netw; 1990; 1(2):192-203. PubMed ID: 18282836
    [TBL] [Abstract][Full Text] [Related]  

  • 11. An annealed chaotic maximum neural network for bipartite subgraph problem.
    Wang J; Tang Z; Wang R
    Int J Neural Syst; 2004 Apr; 14(2):107-16. PubMed ID: 15112368
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Detection of the dominant direction of information flow and feedback links in densely interconnected regulatory networks.
    Ispolatov I; Maslov S
    BMC Bioinformatics; 2008 Oct; 9():424. PubMed ID: 18842147
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A noisy chaotic neural network for solving combinatorial optimization problems: stochastic chaotic simulated annealing.
    Wang L; Li S; Tian F; Fu X
    IEEE Trans Syst Man Cybern B Cybern; 2004 Oct; 34(5):2119-25. PubMed ID: 15503507
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. A one-layer recurrent neural network for constrained nonsmooth invex optimization.
    Li G; Yan Z; Wang J
    Neural Netw; 2014 Feb; 50():79-89. PubMed ID: 24292024
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. Finite-time convergent recurrent neural network with a hard-limiting activation function for constrained optimization with piecewise-linear objective functions.
    Liu Q; Wang J
    IEEE Trans Neural Netw; 2011 Apr; 22(4):601-13. PubMed ID: 21402513
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Neural network for constrained nonsmooth optimization using Tikhonov regularization.
    Qin S; Fan D; Wu G; Zhao L
    Neural Netw; 2015 Mar; 63():272-81. PubMed ID: 25590563
    [TBL] [Abstract][Full Text] [Related]  

  • 19. A one-layer recurrent neural network for constrained nonconvex optimization.
    Li G; Yan Z; Wang J
    Neural Netw; 2015 Jan; 61():10-21. PubMed ID: 25462630
    [TBL] [Abstract][Full Text] [Related]  

  • 20. A Graph Partition-Based Large-Scale Distribution Network Reconfiguration Method.
    Sha Y
    Comput Intell Neurosci; 2022; 2022():3169065. PubMed ID: 35321458
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 10.