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 *

285 related articles for article (PubMed ID: 16366244)

  • 41. Shortest Path Algorithm in Dynamic Restricted Area Based on Unidirectional Road Network Model.
    Wei H; Zhang S; He X
    Sensors (Basel); 2020 Dec; 21(1):. PubMed ID: 33396895
    [TBL] [Abstract][Full Text] [Related]  

  • 42. A one-commodity pickup-and-delivery traveling salesman problem solved by a two-stage method: A sensor relocation application.
    Miao K; Duan H; Qian F; Dong Y
    PLoS One; 2019; 14(4):e0215107. PubMed ID: 30995233
    [TBL] [Abstract][Full Text] [Related]  

  • 43. Geometric decision tree.
    Manwani N; Sastry PS
    IEEE Trans Syst Man Cybern B Cybern; 2012 Feb; 42(1):181-92. PubMed ID: 21896394
    [TBL] [Abstract][Full Text] [Related]  

  • 44. Kernel-based least squares policy iteration for reinforcement learning.
    Xu X; Hu D; Lu X
    IEEE Trans Neural Netw; 2007 Jul; 18(4):973-92. PubMed ID: 17668655
    [TBL] [Abstract][Full Text] [Related]  

  • 45. The hippocampus as a cognitive graph.
    Muller RU; Stead M; Pach J
    J Gen Physiol; 1996 Jun; 107(6):663-94. PubMed ID: 8783070
    [TBL] [Abstract][Full Text] [Related]  

  • 46. A hopfield network learning method for bipartite subgraph problem.
    Wang RL; Tang Z; Cao QP
    IEEE Trans Neural Netw; 2004 Nov; 15(6):1458-65. PubMed ID: 15565773
    [TBL] [Abstract][Full Text] [Related]  

  • 47. Comments on "the 1993 DIMACS graph coloring challenge" and "energy function-based approaches to graph coloring".
    Liu J; Zhong W; Jiao L
    IEEE Trans Neural Netw; 2006 Mar; 17(2):533. PubMed ID: 16566482
    [TBL] [Abstract][Full Text] [Related]  

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

  • 49. Parameter learning from stochastic teachers and stochastic compulsive liars.
    Oommen BJ; Raghunath G; Kuipers B
    IEEE Trans Syst Man Cybern B Cybern; 2006 Aug; 36(4):820-34. PubMed ID: 16903367
    [TBL] [Abstract][Full Text] [Related]  

  • 50. Last-position elimination-based learning automata.
    Zhang J; Wang C; Zhou M
    IEEE Trans Cybern; 2014 Dec; 44(12):2484-92. PubMed ID: 24710837
    [TBL] [Abstract][Full Text] [Related]  

  • 51. Layered data association using graph-theoretic formulation with applications to tennis ball tracking in monocular sequences.
    Yan F; Christmas W; Kittler J
    IEEE Trans Pattern Anal Mach Intell; 2008 Oct; 30(10):1814-30. PubMed ID: 18703833
    [TBL] [Abstract][Full Text] [Related]  

  • 52. Nonlinear regularization path for quadratic loss support vector machines.
    Karasuyama M; Takeuchi I
    IEEE Trans Neural Netw; 2011 Oct; 22(10):1613-25. PubMed ID: 21880570
    [TBL] [Abstract][Full Text] [Related]  

  • 53. Evolution of cellular automata with memory: The Density Classification Task.
    Stone C; Bull L
    Biosystems; 2009 Aug; 97(2):108-16. PubMed ID: 19442703
    [TBL] [Abstract][Full Text] [Related]  

  • 54. Neo4j graph dataset of cycling paths in Slovenia.
    Rajšp A; Fister I
    Data Brief; 2023 Jun; 48():109251. PubMed ID: 37383783
    [TBL] [Abstract][Full Text] [Related]  

  • 55. Ordering and finding the best of K > 2 supervised learning algorithms.
    Yildiz OT; Alpaydin E
    IEEE Trans Pattern Anal Mach Intell; 2006 Mar; 28(3):392-402. PubMed ID: 16526425
    [TBL] [Abstract][Full Text] [Related]  

  • 56. Incremental social learning in particle swarms.
    de Oca MA; Stutzle T; Van den Enden K; Dorigo M
    IEEE Trans Syst Man Cybern B Cybern; 2011 Apr; 41(2):368-84. PubMed ID: 20875976
    [TBL] [Abstract][Full Text] [Related]  

  • 57. An improved real-time endovascular guidewire position simulation using shortest path algorithm.
    Qiu J; Qu Z; Qiu H; Zhang X
    Med Biol Eng Comput; 2016 Sep; 54(9):1375-82. PubMed ID: 26467345
    [TBL] [Abstract][Full Text] [Related]  

  • 58. Minimal surfaces extend shortest path segmentation methods to 3D.
    Grady L
    IEEE Trans Pattern Anal Mach Intell; 2010 Feb; 32(2):321-34. PubMed ID: 20075461
    [TBL] [Abstract][Full Text] [Related]  

  • 59. Improved algorithms for enumerating tree-like chemical graphs with given path frequency.
    Ishida Y; Zhao L; Nagamochi H; Akutsu T
    Genome Inform; 2008; 21():53-64. PubMed ID: 19425147
    [TBL] [Abstract][Full Text] [Related]  

  • 60. A heuristic method for solving the Steiner tree problem in graphs using network centralities.
    Fujita M; Shimada Y; Kimura T; Ikeguchi T
    PLoS One; 2024; 19(6):e0303764. PubMed ID: 38843249
    [TBL] [Abstract][Full Text] [Related]  

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