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 *

205 related articles for article (PubMed ID: 32715123)

  • 1. Routing in triple loop circulants: A case of networks-on-chip.
    Romanov AY; Starykh VA
    Heliyon; 2020 Jul; 6(7):e04427. PubMed ID: 32715123
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Development of routing algorithms in networks-on-chip based on two-dimensional optimal circulant topologies.
    Romanov AY; Lezhnev EV; Glukhikh AY; Amerikanov AA
    Heliyon; 2020 Jan; 6(1):e03183. PubMed ID: 31956712
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Development of routing algorithms in networks-on-chip based on ring circulant topologies.
    Romanov AY
    Heliyon; 2019 Apr; 5(4):e01516. PubMed ID: 31025021
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Ring-Split: Deadlock-Free Routing Algorithm for Circulant Networks-on-Chip.
    Romanov AY; Myachin NM; Lezhnev EV; Ivannikov AD; El-Mesady A
    Micromachines (Basel); 2023 Jan; 14(1):. PubMed ID: 36677202
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Algorithm for shortest path search in Geographic Information Systems by using reduced graphs.
    Rodríguez-Puente R; Lazo-Cortés MS
    Springerplus; 2013; 2():291. PubMed ID: 24010024
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Neural network based optimal routing algorithm for communication networks.
    Venkataram P; Ghosal S; Kumar BP
    Neural Netw; 2002 Dec; 15(10):1289-98. PubMed ID: 12425444
    [TBL] [Abstract][Full Text] [Related]  

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

  • 8. A Smart Spatial Routing and Accessibility Analysis System for EMS Using Catchment Areas of Voronoi Spatial Model and Time-Based Dijkstra's Routing Algorithm.
    Alamri A
    Int J Environ Res Public Health; 2023 Jan; 20(3):. PubMed ID: 36767175
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Fuzzy-Logic Dijkstra-Based Energy-Efficient Algorithm for Data Transmission in WSNs.
    Razzaq M; Shin S
    Sensors (Basel); 2019 Feb; 19(5):. PubMed ID: 30823500
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Advanced Algorithms for Local Routing Strategy on Complex Networks.
    Lin B; Chen B; Gao Y; Tse CK; Dong C; Miao L; Wang B
    PLoS One; 2016; 11(7):e0156756. PubMed ID: 27434502
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A routing method with adaptively adjusting memory information based on local routing history.
    Kimura T; Shimada Y
    PLoS One; 2023; 18(4):e0283472. PubMed ID: 37075001
    [TBL] [Abstract][Full Text] [Related]  

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

  • 13. An Optimization Routing Algorithm Based on Segment Routing in Software-Defined Networks.
    Hou X; Wu M; Zhao M
    Sensors (Basel); 2018 Dec; 19(1):. PubMed ID: 30583564
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Hybrid Evolutionary Approaches to Maximum Lifetime Routing and Energy Efficiency in Sensor Mesh Networks.
    Rahat AA; Everson RM; Fieldsend JE
    Evol Comput; 2015; 23(3):481-507. PubMed ID: 25950392
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Self avoiding paths routing algorithm in scale-free networks.
    Rachadi A; Jedra M; Zahid N
    Chaos; 2013 Mar; 23(1):013114. PubMed ID: 23556951
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Neural networks for shortest path computation and routing in computer networks.
    Ali MM; Kamoun F
    IEEE Trans Neural Netw; 1993; 4(6):941-54. PubMed ID: 18276524
    [TBL] [Abstract][Full Text] [Related]  

  • 17. A Novel Algorithm for Routing Paths Selection in Mesh-Based Optical Networks-on-Chips.
    Yang XP; Song TT; Ye YC; Liu BC; Yan H; Zhu YC; Zheng YL; Liu Y; Xie YY
    Micromachines (Basel); 2020 Nov; 11(11):. PubMed ID: 33182518
    [TBL] [Abstract][Full Text] [Related]  

  • 18. ParRouting: An Efficient Area Partition-Based Congestion-Aware Routing Algorithm for NoCs.
    Fang J; Zhang D; Li X
    Micromachines (Basel); 2020 Nov; 11(12):. PubMed ID: 33255727
    [TBL] [Abstract][Full Text] [Related]  

  • 19. A socially aware routing based on local contact information in delay-tolerant networks.
    Kim CM; Han YH; Youn JS; Jeong YS
    ScientificWorldJournal; 2014; 2014():408676. PubMed ID: 25143978
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Use of graph algorithms in the processing and analysis of images with focus on the biomedical data.
    Zdimalova M; Roznovjak R; Weismann P; El Falougy H; Kubikova E
    Bratisl Lek Listy; 2017; 118(8):485-490. PubMed ID: 29050487
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 11.