路徑選擇演算法 的英文怎麼說

中文拼音 [lùjìngxuǎnzháiyǎnsuànfǎ]
路徑選擇演算法 英文
routing algorithm
  • 路 : 1 （道路） road; way; path 2 （路程） journey; distance 3 （途徑; 門路） way; means 4 （條理） se...
  • 徑 : Ⅰ名詞1 （狹窄的道路; 小路） footpath; path; track 2 （達到目的的方法） way; means 3 （直徑的簡稱...
  • 選 : Ⅰ動詞1. （挑選） select; choose; pick 2. （選舉） elect Ⅱ名詞（挑選出來編在一起的作品） selections; anthology
  • 擇 : 擇動詞（挑選） select; pick; choose
  • 演 : 動詞1 （演變; 演化） develop; evolve 2 （發揮） deduce; elaborate 3 （依照程式練習或計算） drill;...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 路徑 : 1. （道路） way; route; trajectory; path; tail; travel2. （門路） method; ways and means
  • 選擇 : select; choose; opt; election; choice; culling; alternative
  1. Firstly, the connected end sets of the relay lines are got using the breadth first search algorithm and the connected relationship of wiring terms is got in the electrical circuit diagram according to different cad block structure of different element type. secondly, the appropriate specification of the relay element is chosen by using the equinoctial graph algorithm, and the panel layout diagram is generated automatically by the combining automatic layout and manual intervention. finally, the optimized path algorithm which passes each vertex in the completed non - directional graph once and only once is put forward, this algorithm and the prim minimum spanning tree algrotithm can generate the inner panel wiring diagram and terminal wiring diagram automatically

    首先，採用廣度優先搜索演算法查找電氣原理圖中的連通導線端點集，並根據不同類型的繼電元件對應的cad圖塊結構的不同，得到電氣原理圖中元件接線端子之間的連接關系;其次，根據二分圖匹配演算法為電氣原理圖中繼電元件選擇合適的型號和規格，並採用人工干預和自動布置相結合的方法完成屏面布置圖的自動生成;最後，提出了完全無向圖中經過每個頂點一次且僅一次的優化路徑演算法，利用該演算法和經過預處理的prim最小生成樹演算法自動生成屏內安裝接線圖和端子接線圖。
  2. 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 ）時，交叉立方體中任兩個無故障頂點都至少有一條可靠路徑。
  3. The algorithm is realized by c. it is indicated by simulation that the algorithm is resultful. finally, the parallel genetic algorithm is discussed and the parallel genetic algorithm for shortest route choice is given

    最後，本文還探討了遺傳演算法并行計算的實現方式及其特點和適用范圍，並選擇了適用於最優路徑計算的并行遺傳演算法。
  4. In the leach - new protocol, the mainly improvement of the leach protocol exhibits as follow : for the sake of balancing the network load, the network choose the clusters based on the residual energy ; we take multi - hop communication between sensors instead of single - hop communication, which results in the reduction of energy consumption of clusters ; the new protocol finds the path to the cluster head with the minimum cost, using an algorithm similar to flooding to propagate the cost information and greedy algorithm to find the lowest cost link ; the algorithm for assigning tdma time slot reduces overall delays of network

    在leach - new協議中，對leach協議的改進主要體現在以下幾個方面:根據節點剩餘能量選擇簇頭，以平衡網路負載;節點間採用多跳路由，降低簇頭能量消耗;節點根據能量消耗的代價來選擇至簇頭的路由，通過擴散演算法來廣播代價消息，採用貪婪演算法來選擇能量消耗最小的路徑;採用tdma時隙分配演算法減少網路時延。最後，利用ns2模擬軟體進行驗證。
  5. A multi - path routing protocol based on a hybrid criterion of choice

    一種混合路徑選擇準則下的多徑路由演算法
  6. Firstly, according to our study on the psychology of travelers, we build the passenger - route - select model with the purpose of " least change firstly, shortest distance secondly ", propose the question of bus route aggregation and the n shortest paths algorithm combining dijkstra algorithm and moore - pape " s chain table management technology, which is proved valid

    首先在對乘客出行心理研究基礎上，提出了「以換乘次數最少為第一目標，距離最短為第二目標」的公交乘客出行路徑選擇模型和公交路徑集問題以及結合dijkstra演算法和moore ? pape演算法鏈表管理技術的n條最短路徑演算法，系統的運行結果驗證了該演算法的有效性。
  7. For the next interconnection network, we proved the connectivity of the n - enhanced crossed cube is n + 1, and its conditional connectivity is 2n ( n > 3 ) provided that all the neighbors of each professor do not fail at the same time, which is better than the hypercube and the crossed cube, two related algorithms in o ( n ) time are also given ; more, we proved that the n - enhanced crossed cube can tolerate as many as n faulty clusters of diameter at most 1 with at most 2n - 1 faulty nodes in total ( n > 3 ), which is better than the hypercube and the crossed cube also

    本文證明n -維加強交叉立方體的連通度為n + l ，條件連通度為zn （ n > 3 ） ，簇容錯特徵數為（ n ， l ， zn ） ， （ : 1 > 3 ） ，這些性質都比交叉立方體的更優越。更進一步，木文也給出了加強交叉立方體的基於連通度的，條件連通度的時間復雜度為o （ n ）的容錯路由選擇演算法及最長路徑長度。
  8. A model for route selection was set up by taking population risk, average consequence and total consequence as the objectives to avoid serious transportation accidents, and by using the weighted method, the model can be solved by the shortest path algorithm

    建立了綜合考慮運輸風險、平均後果和總後果的路徑選擇模型，並利用線性加權的方法對3個目標進行處理，使模型可以利用最短路演算法進行求解。
  9. Based on how routers gather information about the structure of a network and their analysis of information to specify the best route, we have two major routing algorithms and decentralized routing algorithms

    人們基於路由器收集來的關于網路拓撲結構和傳輸信息分析報告來確定最優路由路徑，現有兩種路由選擇演算法，基於中心控制的路由選擇演算法和基於動態分散式的路由選擇演算法。
  10. First, we classify the multipath mitigation techniques into four categories, and then the presentation of principles and simulation of performances are done of three widely - used techniques of multipath mitigation, which are based on the code tracking loop with the name of narrow - correlator - spacing technique 、 els ( early late slope ) technique and medll technique. from the presentation and simulation, the medll technique is selected as the multipath mitigation algorithm in signal processing ’ s scope.

    本章首先對多徑消除技術進行了分類，然後主要對基於碼跟蹤環路的三種技術-窄相關（ narrowcorrelatorspacing ）技術、 els （ earlylateslope ）技術和medll （ multipathestimatingdelaylockloop ）技術-進行原理分析和性能模擬，從中選擇medll技術作為接收機信號處理階段的多徑消除演算法。
  11. The algorithms cannot meet the requirements above, for its intrinsic quality or reality difficulties. at the beginning of this paper, the structure, workflow, and development condition of global traffic flow guidance system are introduced. then the route optimization choice algorithms classification and structure are summarized

    本文首先介紹了國內外交通誘導系統的發展情況和交通誘導系統的結構、分類和系統的工作流程，接著總結了各種最優路徑選擇演算法的分類方法和分類體系，分析了dijkstra演算法和遺傳演算法在交通路徑尋優計算中的不足。
  12. The author discussed the four steps model and provided the ameliorative method of the logit model and the solution of the fictitious public traffic routes. firstly, the author discussed the result of survey of residents trip, concluded the primary character of residents trip and put forward the method of stratified random sampling plan on that.

    預測時採用了一種比較流行的「四階段模型法」 ，針對「四階段模型法」的出行分佈、交通分配子系統展開了深入的討論，提出了針對重慶山城交通特點的「改進的logit型的隨機路徑選擇模型」和「虛擬公交線路演算法」 。
  13. Transmission line design is a complex system project with large investment. based on data provided by digital transmission network, and combined with the genetic algorithm, the thesis puts forward a general optimization method to deal with the difficulties in transmission line design, which are path and pole selection of the transmission line. synthetically contemplating all kinds of environmental and anthropogenic factors, the method has great pragmatic meaning in saving cost of design

    輸電線路設計是一項投資巨大且相關因素復雜的系統工程，本文基於「數字輸電網路」提供的信息數據，結合遺傳演算法，對線路設計中的難點? ?路徑選擇和桿塔定位提出了全新的全局優化方法，該方法綜合地考慮了各種環境及人為因素，對節約設計成本、提高設計工作的科學性具有很大的現實意義。
  14. This dissertation analyzes cisco ' s crs - 1 system, describes and studies the properties of the path in benes network and the non - blocking conditions for benes network. according to these non - blocking conditions, some algorithms for composing routing labels are discussed

    本文對ciscocrs - 1系統交換平面內部所採用的benes結構和交換系統從1 . 2tbps到92tbps的升級過程進行理論分析;對benes拓撲路徑特性和路由選擇演算法進行理論研究。
  15. Then, it studies each group further more one by one, establishes the optimal model, and works out the solution thinking and the procedure of settling problems of each group. lastly, it takes every research achievement together to study the mobilization decision - making of emergency material on the whole, through which the optimal decision - making scheme can be attained. also, scheme includes not only the chosen place and the quantity of the mobilization, but also the optimal route from the mobilization place to the demand place

    文章採取「總?分?總」的研究思路，首先，從總體上對應急物資動員決策問題進行分析，把應急物資動員決策問題分解為應急物資需求預測與分級、應急物資籌集與應急物資調配三個子問題;然後，分別對每個子問題進行深入研究，建立每個子問題的決策優化模型，給出模型的求解思路和求解演算法;最後，綜合利用每個子問題的研究成果，對整個應急物資動員決策問題進行集成研究，得到最優的物資動員方案，該方案中不僅包含被選擇的動員點，相應的動員量，而且還包含從動員點到需求點的最佳調配路徑。
  16. The traditional shortest path algorithm only thinks about length, this ca n ' t satisfy requirements of the complicated traffic. so we introduce the theory of rough set. we use the concept of property importance, think about all the conditions, and get the optimal path selection algorithm based on rough set

    傳統的最短路徑演算法僅僅考慮長度這一條件，這顯然不能滿足復雜交通狀況的實際需要，因此我們引入粗集理論，利用粗集中屬性重要度的概念，綜合考慮各種條件，得到了基於粗集理論的最佳路徑選擇演算法。
  17. Meanwhile, the projects to realize the function of each module are discussed. the shortest route choice algorithm is an important research in drgs, in order to satisfy the real - time request of the drgs and achieve the quick and right guidance, the advantage and disadvantage of shortest route choice algorithm are discussed. the ordered genetic algorithm for shortest route choice is given in this paper, the corresponding selection, crossover and mutation operator are given

    同時，為了適應動態路徑誘導系統的實時性和全局尋優要求，實現快速而準確的路徑誘導功能，本文首先詳細討論各種最優路徑選擇演算法的優缺點及應用發展現狀，提出採用有序實數編碼的遺傳演算法進行最優路徑計算，並根據交通路網的特性設計了有序實數編碼遺傳演算法的選擇、交叉和變異運算元，並用c語言實現了該演算法。
  18. Adaptive routing algorithm

    自適應路徑選擇演算法
  19. This paper raised an optimal path selection algorithm based on rough set and a dynamic trajectory prediction algorithm based on sliding windows

    提出了適用於可穿戴計算機導航系統的基於粗集理論的最佳路徑選擇演算法和基於滑動窗口的動態軌跡預測演算法。
  20. Secondly, because the logit model applied to the traffic assignment is only suit to the problem of the trip cost independent of the number of passengers on the route and the stochastic user equilibrium model is abstruse and complex in solution, the author brought forward the ameliorative method of the logit model

    其次，在交通分配子系統中，由於logit型的隨機路徑選擇模型只適用於路徑的實際出行成本與路徑流量無關的交通分配問題，而隨機均衡配流模型（ stochasticuserequilibrium ， sue ）雖然考慮了路徑流量，但演算法復雜，難于推廣。
分享友人
分享到 Line

分享到臉書