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 *

186 related articles for article (PubMed ID: 20365234)

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

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

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

  • 4. Investigation of both local and global topological ingredients on transport efficiency in scale-free networks.
    Huang W; Chow TW
    Chaos; 2009 Dec; 19(4):043124. PubMed ID: 20059220
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Optimal structure of complex networks for minimizing traffic congestion.
    Zhao L; Cupertino TH; Park K; Lai YC; Jin X
    Chaos; 2007 Dec; 17(4):043103. PubMed ID: 18163767
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Solving the multicommodity flow problem using an evolutionary routing algorithm in a computer network environment.
    Farrugia N; Briffa JA; Buttigieg V
    PLoS One; 2023; 18(4):e0278317. PubMed ID: 37075013
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Collectively optimal routing for congested traffic limited by link capacity.
    Danila B; Sun Y; Bassler KE
    Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Dec; 80(6 Pt 2):066116. PubMed ID: 20365240
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Global dynamic routing for scale-free networks.
    Ling X; Hu MB; Jiang R; Wu QS
    Phys Rev E Stat Nonlin Soft Matter Phys; 2010 Jan; 81(1 Pt 2):016113. PubMed ID: 20365438
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Integrating local static and dynamic information for routing traffic.
    Wang WX; Yin CY; Yan G; Wang BH
    Phys Rev E Stat Nonlin Soft Matter Phys; 2006 Jul; 74(1 Pt 2):016101. PubMed ID: 16907145
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Greedy data transportation scheme with hard packet deadlines for wireless ad hoc networks.
    Lee H
    ScientificWorldJournal; 2014; 2014():815123. PubMed ID: 25258736
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Abrupt transition to complete congestion on complex networks and control.
    Wang WX; Wu ZX; Jiang R; Chen G; Lai YC
    Chaos; 2009 Sep; 19(3):033106. PubMed ID: 19791986
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Traffic dynamics based on local routing protocol on a scale-free network.
    Wang WX; Wang BH; Yin CY; Xie YB; Zhou T
    Phys Rev E Stat Nonlin Soft Matter Phys; 2006 Feb; 73(2 Pt 2):026111. PubMed ID: 16605402
    [TBL] [Abstract][Full Text] [Related]  

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

  • 14. Dynamic source routing strategy for two-level flows on scale-free networks.
    Jiang ZY; Liang MG; Wu JJ
    PLoS One; 2013; 8(12):e82162. PubMed ID: 24349207
    [TBL] [Abstract][Full Text] [Related]  

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

  • 16. Inferring the background traffic arrival process in the Internet.
    Hága P; Csabai I; Vattay G
    Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Dec; 80(6 Pt 2):066103. PubMed ID: 20365227
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Energy-Balanced Routing Algorithm Based on Ant Colony Optimization for Mobile Ad Hoc Networks.
    Yang D; Xia H; Xu E; Jing D; Zhang H
    Sensors (Basel); 2018 Oct; 18(11):. PubMed ID: 30373294
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Fast-Convergence Reinforcement Learning for Routing in LEO Satellite Networks.
    Ding Z; Liu H; Tian F; Yang Z; Wang N
    Sensors (Basel); 2023 May; 23(11):. PubMed ID: 37299907
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Effective strategy of adding nodes and links for maximizing the traffic capacity of scale-free network.
    Huang W; Chow TW
    Chaos; 2010 Sep; 20(3):033123. PubMed ID: 20887063
    [TBL] [Abstract][Full Text] [Related]  

  • 20. The RapidIO Routing Strategy Based on the Double-Antibody Group Multi-Objective Artificial Immunity Algorithm.
    Fu Y; Jia Y; Huang B; Zhou X; Qin X
    Sensors (Basel); 2022 Jan; 22(3):. PubMed ID: 35161657
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 10.