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 *

173 related articles for article (PubMed ID: 12125896)

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

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

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

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

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

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

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

  • 11. Approximating maximum clique with a Hopfield network.
    Jagota A
    IEEE Trans Neural Netw; 1995; 6(3):724-35. PubMed ID: 18263357
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Protein structure alignment by deterministic annealing.
    Chen L; Zhou T; Tang Y
    Bioinformatics; 2005 Jan; 21(1):51-62. PubMed ID: 15308541
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A linearly decreasing deterministic annealing algorithm for the multi-vehicle dial-a-ride problem.
    Mortazavi A; Ghasri M; Ray T
    PLoS One; 2024; 19(2):e0292683. PubMed ID: 38330021
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Deterministic global optimization algorithm based on outer approximation for the parameter estimation of nonlinear dynamic biological systems.
    Miró A; Pozo C; Guillén-Gosálbez G; Egea JA; Jiménez L
    BMC Bioinformatics; 2012 May; 13():90. PubMed ID: 22574924
    [TBL] [Abstract][Full Text] [Related]  

  • 15. A tree search algorithm towards solving Ising formulated combinatorial optimization problems.
    Cen Y; Das D; Fong X
    Sci Rep; 2022 Aug; 12(1):14755. PubMed ID: 36042250
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Stochastic Fixed Point Optimization Algorithm for Classifier Ensemble.
    Iiduka H
    IEEE Trans Cybern; 2020 Oct; 50(10):4370-4380. PubMed ID: 31247582
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 19. An Integrated Method Based on PSO and EDA for the Max-Cut Problem.
    Lin G; Guan J
    Comput Intell Neurosci; 2016; 2016():3420671. PubMed ID: 26989404
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Weighted SGD for ℓ
    Yang J; Chow YL; Ré C; Mahoney MW
    Proc Annu ACM SIAM Symp Discret Algorithms; 2016 Jan; 2016():558-569. PubMed ID: 29782626
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 9.