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 *

121 related articles for article (PubMed ID: 12662596)

  • 41. Nonlinear system identification using a Gabor/Hopfield network.
    Zhang CQ; Sami Fadali M
    IEEE Trans Syst Man Cybern B Cybern; 1996; 26(1):124-34. PubMed ID: 18263012
    [TBL] [Abstract][Full Text] [Related]  

  • 42. Efficient Training of Recurrent Neural Network with Time Delays.
    Marom E; Saad D; Cohen B
    Neural Netw; 1997 Jan; 10(1):51-59. PubMed ID: 12662886
    [TBL] [Abstract][Full Text] [Related]  

  • 43. Dynamic Flying Ant Colony Optimization (DFACO) for Solving the Traveling Salesman Problem.
    Dahan F; El Hindi K; Mathkour H; AlSalman H
    Sensors (Basel); 2019 Apr; 19(8):. PubMed ID: 30999688
    [TBL] [Abstract][Full Text] [Related]  

  • 44. Leap-frog is a robust algorithm for training neural networks.
    Holm JE; Botha EC
    Network; 1999 Feb; 10(1):1-13. PubMed ID: 10372759
    [TBL] [Abstract][Full Text] [Related]  

  • 45. Non-linear global optimization via parameterization and inverse function approximation: an artificial neural networks approach.
    Mayorga RV; Arriaga M
    Int J Neural Syst; 2007 Oct; 17(5):353-68. PubMed ID: 18098368
    [TBL] [Abstract][Full Text] [Related]  

  • 46. Inter-domain routing based on simulated annealing algorithm in optical mesh networks.
    Wang L; Zhang H; Zheng X
    Opt Express; 2004 Jul; 12(14):3095-107. PubMed ID: 19483829
    [TBL] [Abstract][Full Text] [Related]  

  • 47. An efficient approach to the travelling salesman problem using self-organizing maps.
    Vieira FC; Dória Neto AD; Costa JA
    Int J Neural Syst; 2003 Apr; 13(2):59-66. PubMed ID: 12923918
    [TBL] [Abstract][Full Text] [Related]  

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

  • 49. Effective Backpropagation Training with Variable Stepsize.
    Androulakis GS; Vrahatis MN; Magoulas GD
    Neural Netw; 1997 Jan; 10(1):69-82. PubMed ID: 12662888
    [TBL] [Abstract][Full Text] [Related]  

  • 50. Chaotic Potts Spin Model for Combinatorial Optimization Problems.
    Sato M; Ishii S
    Neural Netw; 1997 Jul; 10(5):941-963. PubMed ID: 12662881
    [TBL] [Abstract][Full Text] [Related]  

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

  • 52. Evaluation of a particle swarm algorithm for biomechanical optimization.
    Schutte JF; Koh BI; Reinbolt JA; Haftka RT; George AD; Fregly BJ
    J Biomech Eng; 2005 Jun; 127(3):465-74. PubMed ID: 16060353
    [TBL] [Abstract][Full Text] [Related]  

  • 53. A local linearized least squares algorithm for training feedforward neural networks.
    Stan O; Kamen E
    IEEE Trans Neural Netw; 2000; 11(2):487-95. PubMed ID: 18249777
    [TBL] [Abstract][Full Text] [Related]  

  • 54. On the stability of the Travelling Salesman Problem algorithm of Hopfield and Tank.
    Wilson GV; Pawley GS
    Biol Cybern; 1988; 58(1):63-70. PubMed ID: 3345321
    [TBL] [Abstract][Full Text] [Related]  

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

  • 56. Spatio-temporal EEG source localization using simulated annealing.
    Khosla D; Singh M; Don M
    IEEE Trans Biomed Eng; 1997 Nov; 44(11):1075-91. PubMed ID: 9353987
    [TBL] [Abstract][Full Text] [Related]  

  • 57. Heuristic-based tabu search algorithm for folding two-dimensional AB off-lattice model proteins.
    Liu J; Sun Y; Li G; Song B; Huang W
    Comput Biol Chem; 2013 Dec; 47():142-8. PubMed ID: 24077543
    [TBL] [Abstract][Full Text] [Related]  

  • 58. Methodology of Recurrent Laguerre-Volterra Network for Modeling Nonlinear Dynamic Systems.
    Geng K; Marmarelis VZ
    IEEE Trans Neural Netw Learn Syst; 2017 Sep; 28(9):2196-2208. PubMed ID: 27352401
    [TBL] [Abstract][Full Text] [Related]  

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

  • 60. Ant colonies for the travelling salesman problem.
    Dorigo M; Gambardella LM
    Biosystems; 1997; 43(2):73-81. PubMed ID: 9231906
    [TBL] [Abstract][Full Text] [Related]  

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