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.


Pubmed for Handhelds

PUBMED FOR HANDHELDS

Journal Abstract Search

151 related items for PubMed ID: 21482456

  • 1. 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
    [Abstract] [Full Text] [Related]

  • 2. 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
    [Abstract] [Full Text] [Related]

  • 3. 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
    [Abstract] [Full Text] [Related]

  • 4.
    ; . PubMed ID:
    [No Abstract] [Full Text] [Related]

  • 5. 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
    [Abstract] [Full Text] [Related]

  • 6. 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
    [Abstract] [Full Text] [Related]

  • 7. An SMO algorithm for the potential support vector machine.
    Knebel T, Hochreiter S, Obermayer K.
    Neural Comput; 2008 Jan; 20(1):271-87. PubMed ID: 18045009
    [Abstract] [Full Text] [Related]

  • 8. 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
    [Abstract] [Full Text] [Related]

  • 9.
    ; . PubMed ID:
    [No Abstract] [Full Text] [Related]

  • 10. 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
    [Abstract] [Full Text] [Related]

  • 11.
    ; . PubMed ID:
    [No Abstract] [Full Text] [Related]

  • 12. A one-layer recurrent neural network for constrained nonsmooth optimization.
    Liu Q, Wang J.
    IEEE Trans Syst Man Cybern B Cybern; 2011 Oct; 41(5):1323-33. PubMed ID: 21536534
    [Abstract] [Full Text] [Related]

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

  • 14.
    ; . PubMed ID:
    [No Abstract] [Full Text] [Related]

  • 15. [MEG inverse solution using Gauss-Newton algorithm modified by Moore-Penrose inversion].
    Li J.
    Sheng Wu Yi Xue Gong Cheng Xue Za Zhi; 2001 Jun; 18(2):265-8. PubMed ID: 11450550
    [Abstract] [Full Text] [Related]

  • 16. A cooperative recurrent neural network for solving L(1) estimation problems with general linear constraints.
    Xia Y, Kamel MS.
    Neural Comput; 2008 Mar; 20(3):844-72. PubMed ID: 18370841
    [Abstract] [Full Text] [Related]

  • 17.
    ; . PubMed ID:
    [No Abstract] [Full Text] [Related]

  • 18.
    ; . PubMed ID:
    [No Abstract] [Full Text] [Related]

  • 19.
    ; . PubMed ID:
    [No Abstract] [Full Text] [Related]

  • 20. Competitive hopfield network combined with estimation of distribution for maximum diversity problems.
    Wang J, Zhou Y, Yin J, Zhang Y.
    IEEE Trans Syst Man Cybern B Cybern; 2009 Aug; 39(4):1048-66. PubMed ID: 19336334
    [Abstract] [Full Text] [Related]

    Page: [Next] [New Search]
    of 8.