路由選擇 的英文怎麼說

中文拼音 [lùyóuxuǎnzhái]
路由選擇 英文
ddr
  • 路 : 1 （道路） road; way; path 2 （路程） journey; distance 3 （途徑; 門路） way; means 4 （條理） se...
  • 由 : causereason
  • 選 : Ⅰ動詞1. （挑選） select; choose; pick 2. （選舉） elect Ⅱ名詞（挑選出來編在一起的作品） selections; anthology
  • 擇 : 擇動詞（挑選） select; pick; choose
  • 選擇 : select; choose; opt; election; choice; culling; alternative
  1. The paper will study the upper questions based on the two interconnection networks. first, we give a fault - tolerant routing algorithm under the connectivity of the crossed cube in o ( n ) time and the length of the longest routing path ; second, with the rapid progress in vlsi, the failing probability of processors and links is very low, the traditional connectivity underestimates the resilience of large networks / here by applying the concept " conditional connectivity " introduce by harary, we show that the n - crossed cube can tolerate up to 2n - 3 ( n > 2 ) processors failure and remain connected provide that all the neighbors of each processor do not ' fail at the same time, the result is the same as the hypercube. we also give a related algorithm in o ( n ) time, and the length of the longest path ; third, we apply cluster faun tolerance introduced by q. - p

    根據menger定理， n -維交叉立方體可以容納n - 1個故障頂點，我們給出了它的時間復雜度為o （ n ）的容錯路由選擇演算法及其最長路徑長度分析；在此基礎上本文證明， n -維交叉立方體的條件連通度為2n - 2 （ n 2 ） ，並給出了相應時間復雜度為o （ n ）的演算法及其最長路徑長度；除此之外，本文還證明當n -維交叉立方體中的故障簇個數不大於n - 1 ，其直徑不大於1 ，故障頂點總數不超過2n - 3 （ n 2 ）時，交叉立方體中任兩個無故障頂點都至少有一條可靠路徑。
  2. Busy no answer reroute ( or routing )

    遇忙無應答重發（或路由選擇） 。
  3. With applying dsst algorithm, mobile agent can solve the problem of selecting router. synthesizing advantages of centralized search engine and distributed search engine, through it that system obtains the best way that agents mobile does. after statistics analysis, the author gets the mathematic pattern that mobil agent clones right times

    利用idl語言定義了agent在多種平臺上移動的介面，設計了一個符合maf規范的插件，實現agent在異種平臺之間的移動；利用動態最小生成樹演算法解決移動agent的路由選擇問題，綜合集中式搜索和分散式搜索的特點，動態尋找出一條agent移動的最佳路線；通過統計分析得到移動agent克隆的數學模型，通過計算可以獲得agent克隆個數的最佳值。
  4. Dynamic non - hierarchical routing

    動態非等級路由選擇
  5. Delay - constrained least - cost routing algorithm

    時延約束的最小費用路由選擇演算法
  6. So some numbers dialed will be redialed by the mcu through the gsm modem according to customers " will, also the ip number can be added automatically, which not only reduce call fees but also make convenience and improve efficiency for customers : we design the hardware circuits first

    撥號時，在不改變使用習慣的前提下按用戶意願將部分所撥號碼從無線系統中旁路出去，在用戶端即可完成電信網路的自動路由選擇。並可在撥號過程中自動加入網路標識碼，既節約費用，還方便用戶，提高效率。
  7. Then, an improved genetic algorithm is proposed to solve this problem. this algorithm makes trees with the source and all destinations are the space of operation and filter operation. with hybrid selection operator, competition among brothers, greedy operation, filter operation

    然後給出了一種基於遺傳演算法的實時多播路由選擇方法，並用改進的遺傳演算法進行了求解，該演算法採用包含源節點和目的節點的樹作為交叉和變異的空間的方法，通過加入混合選擇、小范圍競爭擇優的交叉變異操作，提高了全局搜索能力和收斂速度。
  8. This utility is used mostly by financial institutions that wish to verify / calculate the check digit of a routing / transit number on a given document

    這個工具主要為財政機構所使用，他們希望在一個給定文檔中的校驗/計算一個路由選擇/運輸線數字的校驗數位。
  9. Check digit verification utility - this utility is used mostly by financial institutions that wish to verify / calculate the check digit of a routing / transit number on a given document

    這個工具主要為財政機構所使用，他們希望在一個給定文檔中的校驗/計算一個路由選擇/運輸線數字的校驗數位。
  10. Network protocols, remote access, and routing.

    網路協議、遠程訪問和路由選擇。
  11. Research on ip dwdm optical internet routing mechanisms

    光因特網路由選擇機制的研究
  12. A routing mechanism in ip dwdm optical internet

    光因特網中的路由選擇機制
  13. The application of genetic algorithm in multicast routing

    遺傳演算法在組播路由選擇中的應用
  14. Fault - tolerant routing mechanisms in ip dwdm optical internet

    光因特網中的容錯路由選擇機制
  15. This function is called route selection

    這部分功能稱為路由選擇。
  16. These algorithms are also known as ls ( link state ) algorithms

    這種路由選擇演算法就是我們所知的關系國家路由選擇演算法。
  17. A line or list formed by items in a system waiting for service ; for example, tasks to be performed or messages to be transmitted in a message routing system

    由系統中等待服務的項目構成的行或列表，例如等待執行的任務或在報文路由選擇系統中等待發送的報文。
  18. Visual basic for applications provides a powerful infrastructure for developing and deploying a wide variety of customized solutions that solve everyday business requirements, including advanced e - mail messaging, appointment and task management ; electronic discussions ; and tracking, routing, and document library solutions

    Visualbasicforapplications為開發和應用各種自定義解決方案，解決如高級電子郵件傳輸、約會和任務管理、電子討論、跟蹤、路由選擇和文檔庫等日常商務需求，提供了功能強大的體系結構。
  19. The routing of a call or message that is placed for a disconnected or nonexistent telephone number or terminal address to an operator position or to an especially designated terminal

    把對網路中未連接的或不存在的電話號碼（或終端地址）所進行的呼叫（或報文）轉交給操作員（或專門指定的終端）的路由選擇方法。
  20. Based on collected and read literatures, this paper gives the analysis of its characteristics, architecture, security problem, qos problem, and comparison among present popular wireless ad hoc routing algorithm as well. 4. according to the characteristics of wireless network situation of wearable computer, this paper comes up with a wireless network frame for wearable computer based on lsr ( link state routing protocol )

    （ 4 ）結合可穿戴計算機無線網路環境的特點，在對自組網路由選擇演算法比較分析的基礎上，提出了一種適用於可穿戴計算機無線網路的基於混合路由策略的lsr （ linkstateroutingprotocol ）路由協議的框架，它能夠根據網路拓撲結構變化的不同程度在先應式和后應式路由策略之間進行自然平滑的切換。
分享友人
分享到 Line

分享到臉書