hierarchical routing 中文意思是什麼

hierarchical routing 解釋
分層路由選擇
  • hierarchical : adj. 1. 僧侶統治（集團）的。2. 統治集團的。3. 等級（制度）的。adv. -cally
  • routing : 安排程序
  1. Dynamic non - hierarchical routing

    動態非等級路由選擇
  2. Based on the optimal operation problem of flood control for multi - reservoir such as jiangya, zaoshi and yichongqiao reservoirs on the lishui river, a hierarchical model for optimal flood dispatching of multi - reservoir system, which includes a flood routing model and a discrete differential dynamic program model for the optimal flood dispatching of reservoir sub - system, is established : then a new decomposition - coordination algorithm is put forward

    摘要以澧水流域中上游的江埡、皂市及宜沖橋三庫聯合防洪優化調度問題為背景，建立了河道洪水演進方程與離散微分動態規劃相結合的水庫群防洪優化調度模型，提出了一種離散微分動態規劃與馬氏京根洪水演進相結合的大系統分解協調演算法。
  3. Qos - aware hierarchical multi - path multicast routing protocol

    多徑組播路由協議
  4. 4. to suitable for multicast routing in the network of internet, the hierarchical multicast routing algorithm based on clone selection algorithm is proposed in the paper

    4 、為了適應internet網中的組播路由，本文提出了基於免疫克隆選擇的層次組播路由演算法。
  5. New restricted multicast routing algorithm in triplet - based hierarchical interconnection network

    Chord改進演算法在文件共享系統的實現
  6. Firstly, this paper analyses and summarizes the routing technology, including unicast routing, multicast routing and multicast routing based on genetic algorithm, presents the research of quality of service multicast routing will be focused on simplicity, generality, extensibility, hierarchical routing and routing with imprecise state information

    本文首先對網路路由選擇技術，包括單播路由、組播路由和基於遺傳演算法的組播路由選擇技術進行了分析總結，指出簡單性、通用性、外延性、層次型路由和不精確狀態信息下的路由是未來服務質量組播路由的研究重點。
  7. 7 wang y, hong x l, jing t, yang y, hu x d, yan g y. an efficient low - degree rmst algorithm for vlsi ulsi physical design. lecture notes in computer science lncs 3254 - integrated circuits and system design, santorini, greece, sept. 2004, pp. 442 - 452. 8 xu j y, hong x l, jing t, cai y c, gu j. an efficient hierarchical timing - driven steiner tree algorithm for global routing

    對于實際電路中常見規模的線網端點個數小於50 ， aco - steiner能達到最優解，當端點數目大於50的時候， aco - steiner能夠將線長控制在精確解的1 %誤差以內，而且保持快的運行速度，而當端點個數為1000的時候， geosteiner3 . 1已經不能處理。
分享友人
分享到 Line

分享到臉書