BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

174 related articles for article (PubMed ID: 18252324)

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

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

  • 23. Stability analysis of higher-order neural networks for combinatorial optimization.
    Cooper B
    Int J Neural Syst; 2002; 12(3-4):177-86. PubMed ID: 12370960
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Graph partitioning using annealed neural networks.
    Van den Bout DE; Miller TK
    IEEE Trans Neural Netw; 1990; 1(2):192-203. PubMed ID: 18282836
    [TBL] [Abstract][Full Text] [Related]  

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

  • 26. Paralleled hardware annealing for optimal solutions on electronic neural networks.
    Lee BW; Sheu BJ
    IEEE Trans Neural Netw; 1993; 4(4):588-99. PubMed ID: 18267760
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Convergence and stability of quantized Hopfield networks operating in a fully parallel mode.
    Calabuig D; Monserrat JF; Cardona N
    Neural Comput; 2010 Oct; 22(10):2507-21. PubMed ID: 20438332
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Cooperative updating in the Hopfield model.
    Munehisa T; Kobayashi M; Yamazaki H
    IEEE Trans Neural Netw; 2001; 12(5):1243-51. PubMed ID: 18249951
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Efficient convex-elastic net algorithm to solve the Euclidean traveling salesman problem.
    Al-Mulhem M; Al-Maghrabi T
    IEEE Trans Syst Man Cybern B Cybern; 1998; 28(4):618-20. PubMed ID: 18255981
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Comparison of simulated annealing and mean field annealing as applied to the generation of block designs.
    Bofill P; Guimerà R; Torras C
    Neural Netw; 2003 Dec; 16(10):1421-8. PubMed ID: 14622874
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Parameter setting of the Hopfield network applied to TSP.
    Talaván PM; Yáñez J
    Neural Netw; 2002 Apr; 15(3):363-73. PubMed ID: 12125891
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Group updates and multiscaling: an efficient neural network approach to combinatorial optimization.
    Likas A; Stafylopatis A
    IEEE Trans Syst Man Cybern B Cybern; 1996; 26(2):222-32. PubMed ID: 18263025
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Design of the inverse function delayed neural network for solving combinatorial optimization problems.
    Hayakawa Y; Nakajima K
    IEEE Trans Neural Netw; 2010 Feb; 21(2):224-37. PubMed ID: 20007029
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Functional abilities of a stochastic logic neural network.
    Kondo Y; Sawada Y
    IEEE Trans Neural Netw; 1992; 3(3):434-43. PubMed ID: 18276447
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Colored Traveling Salesman Problem.
    Li J; Zhou M; Sun Q; Dai X; Yu X
    IEEE Trans Cybern; 2015 Nov; 45(11):2390-401. PubMed ID: 25494521
    [TBL] [Abstract][Full Text] [Related]  

  • 36. A neural network model as a globally coupled map and applications based on chaos.
    Nozawa H
    Chaos; 1992 Jul; 2(3):377-386. PubMed ID: 12779987
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Annealing Ant Colony Optimization with Mutation Operator for Solving TSP.
    Mohsen AM
    Comput Intell Neurosci; 2016; 2016():8932896. PubMed ID: 27999590
    [TBL] [Abstract][Full Text] [Related]  

  • 38. "Optimal" Hopfield network for combinatorial optimization with linear cost function.
    Matsuda S
    IEEE Trans Neural Netw; 1998; 9(6):1319-30. PubMed ID: 18255812
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Combinatorial optimization with use of guided evolutionary simulated annealing.
    Yip PC; Pao YH
    IEEE Trans Neural Netw; 1995; 6(2):290-5. PubMed ID: 18263313
    [TBL] [Abstract][Full Text] [Related]  

  • 40. A genetic algorithm-based approach to flexible flow-line scheduling with variable lot sizes.
    Lee I; Sikora R; Shaw MJ
    IEEE Trans Syst Man Cybern B Cybern; 1997; 27(1):36-54. PubMed ID: 18255838
    [TBL] [Abstract][Full Text] [Related]  

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