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 *

344 related articles for article (PubMed ID: 18263004)

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

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

  • 63. A New Approach Based on Collective Intelligence to Solve Traveling Salesman Problems.
    Kiran MS; Beskirli M
    Biomimetics (Basel); 2024 Feb; 9(2):. PubMed ID: 38392165
    [TBL] [Abstract][Full Text] [Related]  

  • 64. Optimal Selection of Parameters for Nonuniform Embedding of Chaotic Time Series Using Ant Colony Optimization.
    Shen M; Chen WN; Zhang J; Chung HS; Kaynak O
    IEEE Trans Cybern; 2013 Apr; 43(2):790-802. PubMed ID: 23144038
    [TBL] [Abstract][Full Text] [Related]  

  • 65. Efficient and scalable Pareto optimization by evolutionary local selection algorithms.
    Menczer F; Degeratu M; Street WN
    Evol Comput; 2000; 8(2):223-47. PubMed ID: 10843522
    [TBL] [Abstract][Full Text] [Related]  

  • 66. Solving large scale traveling salesman problems by chaotic neurodynamics.
    Hasegawa M; Ikeguch T; Aihara K
    Neural Netw; 2002 Mar; 15(2):271-83. PubMed ID: 12022514
    [TBL] [Abstract][Full Text] [Related]  

  • 67. A methodology to find the elementary landscape decomposition of combinatorial optimization problems.
    Chicano F; Whitley LD; Alba E
    Evol Comput; 2011; 19(4):597-637. PubMed ID: 21469972
    [TBL] [Abstract][Full Text] [Related]  

  • 68. A Kohonen-like decomposition method for the Euclidean traveling salesman problem-KNIES/spl I.bar/DECOMPOSE.
    Aras N; Altinel IK; Oommen J
    IEEE Trans Neural Netw; 2003; 14(4):869-90. PubMed ID: 18238067
    [TBL] [Abstract][Full Text] [Related]  

  • 69. A multiresolution stochastic level set method for Mumford-Shah image segmentation.
    Law YN; Lee HK; Yip AM
    IEEE Trans Image Process; 2008 Dec; 17(12):2289-300. PubMed ID: 19004702
    [TBL] [Abstract][Full Text] [Related]  

  • 70. Using hysteresis for optimization.
    Zaránd G; Pázmándi F; Pál KF; Zimányi GT
    Phys Rev Lett; 2002 Oct; 89(15):150201. PubMed ID: 12365973
    [TBL] [Abstract][Full Text] [Related]  

  • 71. Chemotaxis can provide biological organisms with good solutions to the travelling salesman problem.
    Reynolds AM
    Phys Rev E Stat Nonlin Soft Matter Phys; 2011 May; 83(5 Pt 1):052901. PubMed ID: 21728597
    [TBL] [Abstract][Full Text] [Related]  

  • 72. A Novel Algorithm for Solving the Prize Collecting Traveling Salesman Problem Based on DNA Computing.
    Wang ZC; Liang K; Bao XG; Wu TH
    IEEE Trans Nanobioscience; 2024 Apr; 23(2):220-232. PubMed ID: 37607150
    [TBL] [Abstract][Full Text] [Related]  

  • 73. Reinforcement interval type-2 fuzzy controller design by online rule generation and q-value-aided ant colony optimization.
    Juang CF; Hsu CH
    IEEE Trans Syst Man Cybern B Cybern; 2009 Dec; 39(6):1528-42. PubMed ID: 19482582
    [TBL] [Abstract][Full Text] [Related]  

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

  • 75. A Hybrid Ant Colony Optimization Algorithm for the Extended Capacitated Arc Routing Problem.
    Li-Ning Xing ; Rohlfshagen P; Ying-Wu Chen ; Xin Yao
    IEEE Trans Syst Man Cybern B Cybern; 2011 Aug; 41(4):1110-23. PubMed ID: 21324786
    [TBL] [Abstract][Full Text] [Related]  

  • 76. Cumulative Capacitated Colored Traveling Salesman Problem.
    Xu X; Cao J; Shi X; Gorbachev S
    IEEE Trans Cybern; 2023 Dec; PP():. PubMed ID: 38117629
    [TBL] [Abstract][Full Text] [Related]  

  • 77. Application of improved ant colony optimization in mobile robot trajectory planning.
    Li X; Wang L
    Math Biosci Eng; 2020 Sep; 17(6):6756-6774. PubMed ID: 33378876
    [TBL] [Abstract][Full Text] [Related]  

  • 78. Magnetoelectric oxide based stochastic spin device towards solving combinatorial optimization problems.
    Sharmin S; Shim Y; Roy K
    Sci Rep; 2017 Sep; 7(1):11276. PubMed ID: 28900224
    [TBL] [Abstract][Full Text] [Related]  

  • 79. Verification and rectification of the physical analogy of simulated annealing for the solution of the traveling salesman problem.
    Hasegawa M
    Phys Rev E Stat Nonlin Soft Matter Phys; 2011 Mar; 83(3 Pt 2):036708. PubMed ID: 21517626
    [TBL] [Abstract][Full Text] [Related]  

  • 80. An ant algorithm for the conformational analysis of flexible molecules.
    Daeyaert F; De Jonge M; Koymans L; Vinkers M
    J Comput Chem; 2007 Apr; 28(5):890-8. PubMed ID: 17238172
    [TBL] [Abstract][Full Text] [Related]  

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