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 *

284 related articles for article (PubMed ID: 16366244)

  • 1. Dynamic algorithms for the shortest path routing problem: learning automata-based solutions.
    Misra S; Oommen BJ
    IEEE Trans Syst Man Cybern B Cybern; 2005 Dec; 35(6):1179-92. PubMed ID: 16366244
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. An efficient dynamic system for real-time robot-path planning.
    Willms AR; Yang SX
    IEEE Trans Syst Man Cybern B Cybern; 2006 Aug; 36(4):755-66. PubMed ID: 16903362
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Tight analysis of the (1+1)-EA for the single source shortest path problem.
    Doerr B; Happ E; Klein C
    Evol Comput; 2011; 19(4):673-91. PubMed ID: 21838552
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Incremental Multi-Scale Search Algorithm for Dynamic Path Planning With Low Worst-Case Complexity.
    Yibiao Lu ; Xiaoming Huo ; Arslan O; Tsiotras P
    IEEE Trans Syst Man Cybern B Cybern; 2011 Dec; 41(6):1556-70. PubMed ID: 21690015
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Multiple Manifold Clustering Using Curvature Constrained Path.
    Babaeian A; Bayestehtashk A; Bandarabadi M
    PLoS One; 2015; 10(9):e0137986. PubMed ID: 26375819
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Distributed algorithms from arboreal ants for the shortest path problem.
    Garg S; Shiragur K; Gordon DM; Charikar M
    Proc Natl Acad Sci U S A; 2023 Feb; 120(6):e2207959120. PubMed ID: 36716366
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Dynamic graph cuts for efficient inference in Markov Random Fields.
    Kohli P; Torr PH
    IEEE Trans Pattern Anal Mach Intell; 2007 Dec; 29(12):2079-88. PubMed ID: 17934219
    [TBL] [Abstract][Full Text] [Related]  

  • 9. The Edge-Disjoint Path Problem on Random Graphs by Message-Passing.
    Altarelli F; Braunstein A; Dall'Asta L; De Bacco C; Franz S
    PLoS One; 2015; 10(12):e0145222. PubMed ID: 26710102
    [TBL] [Abstract][Full Text] [Related]  

  • 10. The approximability of shortest path-based graph orientations of protein-protein interaction networks.
    Blokh D; Segev D; Sharan R
    J Comput Biol; 2013 Dec; 20(12):945-57. PubMed ID: 24073924
    [TBL] [Abstract][Full Text] [Related]  

  • 11. BootGraph: probabilistic fiber tractography using bootstrap algorithms and graph theory.
    Vorburger RS; Reischauer C; Boesiger P
    Neuroimage; 2013 Feb; 66():426-35. PubMed ID: 23110883
    [TBL] [Abstract][Full Text] [Related]  

  • 12. On robotic optimal path planning in polygonal regions with pseudo-Euclidean metrics.
    Sun Z; Reif JH
    IEEE Trans Syst Man Cybern B Cybern; 2007 Aug; 37(4):925-36. PubMed ID: 17702290
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Path planning for autonomous mobile robots using multi-objective evolutionary particle swarm optimization.
    Thammachantuek I; Ketcham M
    PLoS One; 2022; 17(8):e0271924. PubMed ID: 35984778
    [TBL] [Abstract][Full Text] [Related]  

  • 14. A relative reward-strength algorithm for the hierarchical structure learning automata operating in the general nonstationary multiteacher environment.
    Baba N; Mogami Y
    IEEE Trans Syst Man Cybern B Cybern; 2006 Aug; 36(4):781-94. PubMed ID: 16903364
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Network orientation via shortest paths.
    Silverbush D; Sharan R
    Bioinformatics; 2014 May; 30(10):1449-55. PubMed ID: 24470573
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Implementing online natural gradient learning: problems and solutions.
    Wan W
    IEEE Trans Neural Netw; 2006 Mar; 17(2):317-29. PubMed ID: 16566461
    [TBL] [Abstract][Full Text] [Related]  

  • 17. An improved Physarum polycephalum algorithm for the shortest path problem.
    Zhang X; Wang Q; Adamatzky A; Chan FT; Mahadevan S; Deng Y
    ScientificWorldJournal; 2014; 2014():487069. PubMed ID: 24982960
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Efficient shortest-path-tree computation in network routing based on pulse-coupled neural networks.
    Qu H; Yi Z; Yang SX
    IEEE Trans Cybern; 2013 Jun; 43(3):995-1010. PubMed ID: 23144039
    [TBL] [Abstract][Full Text] [Related]  

  • 19. A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation.
    Wang Z; Huang D; Meng H; Tang C
    Biosystems; 2013 Oct; 114(1):1-7. PubMed ID: 23871964
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Associating approximate paths and temporal sequences of noisy detections: Application to the recovery of spatio-temporal cancer cell trajectories.
    Dorfer M; Kazmar T; Šmíd M; Sing S; Kneißl J; Keller S; Debeir O; Luber B; Mattes J
    Med Image Anal; 2016 Jan; 27():72-83. PubMed ID: 25987193
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 15.