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 *

174 related articles for article (PubMed ID: 18252324)

  • 61. A novel stochastic optimization algorithm.
    Li B; Jiang W
    IEEE Trans Syst Man Cybern B Cybern; 2000; 30(1):193-8. PubMed ID: 18244742
    [TBL] [Abstract][Full Text] [Related]  

  • 62. A three-phase algorithm for the pollution traveling Salesman problem.
    García-Vasquez K; Linfati R; Escobar JW
    Heliyon; 2024 May; 10(9):e29958. PubMed ID: 38694131
    [TBL] [Abstract][Full Text] [Related]  

  • 63. Optimization by quantum annealing: lessons from hard satisfiability problems.
    Battaglia DA; Santoro GE; Tosatti E
    Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Jun; 71(6 Pt 2):066707. PubMed ID: 16089911
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 66. Linear Hopfield networks and constrained optimization.
    Lendaris GG; Mathia K; Saeks R
    IEEE Trans Syst Man Cybern B Cybern; 1999; 29(1):114-8. PubMed ID: 18252285
    [TBL] [Abstract][Full Text] [Related]  

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

  • 68. A self-organizing neural network for the traveling salesman problem that is competitive with simulated annealing.
    Budinich M
    Neural Comput; 1996 Feb; 8(2):416-24. PubMed ID: 8581888
    [TBL] [Abstract][Full Text] [Related]  

  • 69. Constrained Nets for Graph Matching and Other Quadratic Assignment Problems.
    Simić PD
    Neural Comput; 1991; 3(2):268-281. PubMed ID: 31167309
    [TBL] [Abstract][Full Text] [Related]  

  • 70. Hopfield neural network implementation of the optimal CDMA multiuser detector.
    Kechriotis GI; Manolakos ES
    IEEE Trans Neural Netw; 1996; 7(1):131-41. PubMed ID: 18255563
    [TBL] [Abstract][Full Text] [Related]  

  • 71. A hybrid hopfield network-simulated annealing approach for frequency assignment in satellite communications systems.
    Salcedo-Sanz S; Santiago-Mozos R; Bousoño-Calzón C
    IEEE Trans Syst Man Cybern B Cybern; 2004 Apr; 34(2):1108-16. PubMed ID: 15376856
    [TBL] [Abstract][Full Text] [Related]  

  • 72. Generalized chromosome genetic algorithm for generalized traveling salesman problems and its applications for machining.
    Wu C; Liang Y; Lee HP; Lu C
    Phys Rev E Stat Nonlin Soft Matter Phys; 2004; 70(1 Pt 2):016701. PubMed ID: 15324198
    [TBL] [Abstract][Full Text] [Related]  

  • 73. Modified Hopfield neural networks for retrieving the optimal solution.
    Lee BW; Sheu BJ
    IEEE Trans Neural Netw; 1991; 2(1):137-42. PubMed ID: 18276360
    [TBL] [Abstract][Full Text] [Related]  

  • 74. Limitations of neural networks for solving traveling salesman problems.
    Gee AH; Prager RW
    IEEE Trans Neural Netw; 1995; 6(1):280-2. PubMed ID: 18263311
    [TBL] [Abstract][Full Text] [Related]  

  • 75. Neural Network Structure Optimization by Simulated Annealing.
    Kuo CL; Kuruoglu EE; Chan WKV
    Entropy (Basel); 2022 Feb; 24(3):. PubMed ID: 35327859
    [TBL] [Abstract][Full Text] [Related]  

  • 76. Constraint satisfaction adaptive neural network and heuristics combined approaches for generalized job-shop scheduling.
    Yang S; Wang D
    IEEE Trans Neural Netw; 2000; 11(2):474-86. PubMed ID: 18249776
    [TBL] [Abstract][Full Text] [Related]  

  • 77. Asymmetric continuous-time neural networks without local traps for solving constraint satisfaction problems.
    Molnár B; Ercsey-Ravasz M
    PLoS One; 2013; 8(9):e73400. PubMed ID: 24066045
    [TBL] [Abstract][Full Text] [Related]  

  • 78. A new method to optimize the satellite broadcasting schedules using the mean field annealing of a Hopfield neural network.
    Ansari N; Hou EH; Yu Y
    IEEE Trans Neural Netw; 1995; 6(2):470-83. PubMed ID: 18263328
    [TBL] [Abstract][Full Text] [Related]  

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

  • 80. Checking for optimal solutions in some NP-complete problems.
    Bauer M; Orland H
    Phys Rev Lett; 2005 Sep; 95(10):107202. PubMed ID: 16196960
    [TBL] [Abstract][Full Text] [Related]  

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