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 *

98 related articles for article (PubMed ID: 21230151)

  • 21. Multi-objective path planning for unmanned surface vehicle with currents effects.
    Ma Y; Hu M; Yan X
    ISA Trans; 2018 Apr; 75():137-156. PubMed ID: 29455891
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Optimal parallel algorithm for shortest paths problem on interval graphs.
    Mishra PK
    J Zhejiang Univ Sci; 2004 Sep; 5(9):1135-43. PubMed ID: 15323010
    [TBL] [Abstract][Full Text] [Related]  

  • 23. A minimum resource neural network framework for solving multiconstraint shortest path problems.
    Zhang J; Zhao X; He X
    IEEE Trans Neural Netw Learn Syst; 2014 Aug; 25(8):1566-82. PubMed ID: 25050952
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Efficient rewirings for enhancing synchronizability of dynamical networks.
    Rad AA; Jalili M; Hasler M
    Chaos; 2008 Sep; 18(3):037104. PubMed ID: 19045478
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Inferring meaningful pathways in weighted metabolic networks.
    Croes D; Couche F; Wodak SJ; van Helden J
    J Mol Biol; 2006 Feb; 356(1):222-36. PubMed ID: 16337962
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Cost-based multi-parameter logistics routing path optimization algorithm.
    Dang FL; Wu CX; Wu Y; Li R; Zhang S; Jiaying H; Liu ZG
    Math Biosci Eng; 2019 Jul; 16(6):6975-6989. PubMed ID: 31698599
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Method to enhance traffic capacity for scale-free networks.
    Liu Z; Hu MB; Jiang R; Wang WX; Wu QS
    Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Sep; 76(3 Pt 2):037101. PubMed ID: 17930368
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Efficient routing strategies in scale-free networks with limited bandwidth.
    Tang M; Zhou T
    Phys Rev E Stat Nonlin Soft Matter Phys; 2011 Aug; 84(2 Pt 2):026116. PubMed ID: 21929073
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Pheromone routing protocol on a scale-free network.
    Ling X; Hu MB; Jiang R; Wang R; Cao XB; Wu QS
    Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Dec; 80(6 Pt 2):066110. PubMed ID: 20365234
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Improving the efficiency of the NEB reaction path finding algorithm.
    Galván IF; Field MJ
    J Comput Chem; 2008 Jan; 29(1):139-43. PubMed ID: 17546677
    [TBL] [Abstract][Full Text] [Related]  

  • 31. A Faster, Unbiased Path Opening by Upper Skeletonization and Weighted Adjacency Graphs.
    Asplund T; Luengo Hendriks CL
    IEEE Trans Image Process; 2016 Dec; 25(12):5589-5600. PubMed ID: 27654479
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Routing strategy on a two-dimensional small-world network model.
    Li M; Liu F; Ren FY
    Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Jun; 75(6 Pt 2):066115. PubMed ID: 17677333
    [TBL] [Abstract][Full Text] [Related]  

  • 33. One-Shot Multi-Path Planning Using Fully Convolutional Networks in a Comparison to Other Algorithms.
    Kulvicius T; Herzog S; Lüddecke T; Tamosiunaite M; Wörgötter F
    Front Neurorobot; 2020; 14():600984. PubMed ID: 33584239
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Multicast tree construction algorithm for dynamic traffic on software defined networks.
    Bijur G; Ramakrishna M; Kotegar KA
    Sci Rep; 2021 Nov; 11(1):23084. PubMed ID: 34845252
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Scaling of optimal-path-lengths distribution in complex networks.
    Kalisky T; Braunstein LA; Buldyrev SV; Havlin S; Stanley HE
    Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Aug; 72(2 Pt 2):025102. PubMed ID: 16196625
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Self-organization and solution of shortest-path optimization problems with memristive networks.
    Pershin YV; Di Ventra M
    Phys Rev E Stat Nonlin Soft Matter Phys; 2013 Jul; 88(1):013305. PubMed ID: 23944581
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Improving the Scalability of the Magnitude-Based Deceptive Path-Planning Using Subgoal Graphs.
    Xu K; Hu Y; Zeng Y; Yin Q; Yang M
    Entropy (Basel); 2020 Jan; 22(2):. PubMed ID: 33285937
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Self-adjusting routing schemes for time-varying traffic in scale-free networks.
    Tang M; Liu Z; Liang X; Hui PM
    Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Aug; 80(2 Pt 2):026114. PubMed ID: 19792207
    [TBL] [Abstract][Full Text] [Related]  

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

  • 40. Shortest Paths with Higher-Order Regularization.
    Ulen J; Strandmark P; Kahl F
    IEEE Trans Pattern Anal Mach Intell; 2015 Dec; 37(12):2588-600. PubMed ID: 26539860
    [TBL] [Abstract][Full Text] [Related]  

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