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 *

67 related articles for article (PubMed ID: 18263058)

  • 1. A unified constructive network model for problem-solving.
    Takahashi Y
    IEEE Trans Syst Man Cybern B Cybern; 1996; 26(4):606-15. PubMed ID: 18263058
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Mathematical improvement of the Hopfield model for feasible solutions to the traveling salesman problem by a synapse dynamical system.
    Takahashi Y
    IEEE Trans Syst Man Cybern B Cybern; 1998; 28(6):906-19. PubMed ID: 18256012
    [TBL] [Abstract][Full Text] [Related]  

  • 3. The generalized quadratic knapsack problem. A neuronal network approach.
    Talaván PM; Yáñez J
    Neural Netw; 2006 May; 19(4):416-28. PubMed ID: 16488117
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Meta-learning approach to neural network optimization.
    Kordík P; Koutník J; Drchal J; Kovárík O; Cepek M; Snorek M
    Neural Netw; 2010 May; 23(4):568-82. PubMed ID: 20227243
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Million city traveling salesman problem solution by divide and conquer clustering with adaptive resonance neural networks.
    Mulder SA; Wunsch DC
    Neural Netw; 2003; 16(5-6):827-32. PubMed ID: 12850040
    [TBL] [Abstract][Full Text] [Related]  

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

  • 7. Solving the problem of negative synaptic weights in cortical models.
    Parisien C; Anderson CH; Eliasmith C
    Neural Comput; 2008 Jun; 20(6):1473-94. PubMed ID: 18254696
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Neural networks for nonlinear and mixed complementarity problems and their applications.
    Dang C; Leung Y; Gao XB; Chen KZ
    Neural Netw; 2004 Mar; 17(2):271-83. PubMed ID: 15036344
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Randomized shortest-path problems: two related models.
    Saerens M; Achbany Y; Fouss F; Yen L
    Neural Comput; 2009 Aug; 21(8):2363-404. PubMed ID: 19323635
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Biologically plausible learning in neural networks: a lesson from bacterial chemotaxis.
    Shimansky YP
    Biol Cybern; 2009 Dec; 101(5-6):379-85. PubMed ID: 19844738
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization.
    Liu Q; Guo Z; Wang J
    Neural Netw; 2012 Feb; 26():99-109. PubMed ID: 22019190
    [TBL] [Abstract][Full Text] [Related]  

  • 12. The co-adaptive neural network approach to the Euclidean Travelling Salesman Problem.
    Cochrane EM; Beasley JE
    Neural Netw; 2003 Dec; 16(10):1499-525. PubMed ID: 14622879
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Multiobjective hybrid optimization and training of recurrent neural networks.
    Delgado M; Cuéllar MP; Pegalajar MC
    IEEE Trans Syst Man Cybern B Cybern; 2008 Apr; 38(2):381-403. PubMed ID: 18348922
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Analysis and test of efficient methods for building recursive deterministic perceptron neural networks.
    Elizondo DA; Birkenhead R; Góngora M; Taillard E; Luyima P
    Neural Netw; 2007 Dec; 20(10):1095-108. PubMed ID: 17904333
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Solve the problem first: constructive solution strategies can influence the accuracy of retrospective confidence judgments.
    Mitchum AL; Kelley CM
    J Exp Psychol Learn Mem Cogn; 2010 May; 36(3):699-710. PubMed ID: 20438267
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Optimization via intermittency with a self-organizing neural network.
    Kwok T; Smith KA
    Neural Comput; 2005 Nov; 17(11):2454-81. PubMed ID: 16156935
    [TBL] [Abstract][Full Text] [Related]  

  • 17. An efficient self-organizing map designed by genetic algorithms for the traveling salesman problem.
    Jin HD; Leung KS; Wong ML; Xu ZB
    IEEE Trans Syst Man Cybern B Cybern; 2003; 33(6):877-88. PubMed ID: 18238240
    [TBL] [Abstract][Full Text] [Related]  

  • 18. The loading problem for recursive neural networks.
    Gori M; Sperduti A
    Neural Netw; 2005 Oct; 18(8):1064-79. PubMed ID: 16198537
    [TBL] [Abstract][Full Text] [Related]  

  • 19. On the problem in model selection of neural network regression in overrealizable scenario.
    Hagiwara K
    Neural Comput; 2002 Aug; 14(8):1979-2002. PubMed ID: 12180410
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Exact solution of large asymmetric traveling salesman problems.
    Miller DL; Pekny JF
    Science; 1991 Feb; 251(4995):754-61. PubMed ID: 17775454
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 4.