最短通路演算法 的英文怎麼說

中文拼音 [zuìduǎntōnglùyǎnsuànfǎ]
最短通路演算法 英文
minimum path-length algorithm
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 短 : Ⅰ形容詞（空間、時間兩端之間的距離小） short; brief Ⅱ動詞（缺少; 欠） lack; owe Ⅲ名詞1 （缺點） we...
  • 通 : 通量詞（用於動作）
  • 路 : 1 （道路） road; way; path 2 （路程） journey; distance 3 （途徑; 門路） way; means 4 （條理） se...
  • 演 : 動詞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 （標...
  • 通路 : thoroughfare; highway; highroad; route; viae; lead; outlet; approach; passage; gangway; access; c...
  1. Domain ontology can be modeled a simple directed acyclic network, subsumption relation between two concepts can be computed by the ( immediate ) ancestor or descendent algorithm in a ~ ( h ), association degree between two concepts can be computed by the shortest path algorithm in a ~ ( h )

    領域本體可以模型化為一個簡單有向無環網路，概念之間的包含關系可以通過a ~ h中的（直接）前驅后繼演算法來求解，而概念之間的關聯度可以通過a ~ h中的最短路徑演算法來求解。
  2. Main technic of giss webgiso thus function modules architecture and network topological structure are confirmed webgis system implements the basic function of electronical map, such as map zoonu pan, and the abundant query of geograph and database by using maplnfo mapxtreme for java as map server and jsp., java technico this system also can implement the routing of linesx analysing of buffer and so on0 this paper advances storage model of roads and pipelines topology data, efficiently solves the maintenace problem of network topology data of webgis and implements the shortest path algorathm based on webgis by improving it0 the system has better opening by suppling database interface of map ? the system has perfect on - line help and user forum and favorable interfaces and implementation of this system makes fundament for the further research of webgiso

    本系統利用mapinfomapxtremeforjava作為地圖服務器，採用jsp和java技術，實現了基於webgis的電子地圖的縮放、漫遊等基本功能，並具有豐富的圖文定位查詢功能；實現線路路由、緩沖區分析等輔助決策功能；構建了道路管線網路拓撲數據的存儲模型，有效地解決了基於webgis的網路拓撲數據的維護問題；對dijkstra演算法進行了一些改進，實現了基於webgis的最短路徑演算法；本系統提供了電子地圖數據庫介面，使本系統具有很好的開放性和通用性； webgis系統軟體具有完善的在線幫助和用戶交流論壇，人機界面友好。
  3. Fast algorithm for calculating the minimum makespan in tree - type networks

    樹狀網路中最短接通時間的快速演算法
  4. The time complexity is low because only shortest paths connected to relay nodes is compared. simulation results show that fairly good cost performance is achieved. there is trade - off between complexity and performance

    由於比較了通過中轉節點后的最短路徑，因此運算的復雜度大大降低，且通過模擬得到了較好的性能，模擬結果表明sp - dvma演算法是一種低復雜度的時延和時延差約束的多播路由演算法。
  5. The delay and delay variation constrained minimum steiner tree problem is also researched. lcdvma ( low - cost delay variation - constrained multicast algorithm ) is proposed for this problem. low time complexity, low cost and constrained delay and low delay variation are achieved by only comparing minimum delay paths and minimum cost paths

    對于時延和時延差約束的最小steiner樹問題，提出了一種基於最小時延路徑和最小費用路徑的演算法?一lcdvma演算法，由於該演算法比較了通過中轉節點后的最低費用路徑和最短時延路徑，降低了運算復雜度，通過模擬得到了較小的網路費用和時延差，因此lcdvma演算法是一種具有低復雜度的時延和時延差約束的最小steiner樹的啟發式演算法。
  6. The soccer robot system is a dynamic environment with multiple obstacles. it is a problem of high complexity to perform path planning in such environments. the traditional methods are not efficient in such complex environments. in this paper, a self - learning method of robot navigation is proposed based on the reinforcement learning method and artificial potential field method

    本論文將增強式學習演算法和人工勢場法相結合，提出狀態評價函數和勢場的對應關系，以及控制策略和勢場力方向的對應關系，通過機器人的自適應學習，來形成優化的人工勢場，使機器人能夠以最短路徑繞過障礙，到達目標。
  7. The number of the hidden layers of mul - tilayer perceptrons ( mlps ) is analyzed, and three - layer perceptrons neural network is adopted ; by analyzing the mechanism of the neural cells in hidden layer, a method for combining genetic algorithm and bp algorithm to optimize the design of the neural networks is presented, and it solves the defects of getting into infinitesimal locally and low convergence efficiently, it can also solve the problem that it can usually obtain nearly global optimization solution within shorter time through using genetic algorithm method lonely ; several examples validate that this algorithm can simplify the neural networks effectively, and it makes the neural networks solve the practical problem of fault diagnosis more effectively

    對多層感知器隱層數進行了分析，確定採用三層感知器神經網路;通過對隱層神經元作用機理的分析，引入了遺傳演算法與bp演算法相結合以優化設計神經網路的方法，有效地解決了bp演算法收斂速度慢和易陷入局部極小的弱點，還可以解決單獨利用遺傳演算法往往只能在短時間內尋找到接近全局最優的近優解的問題;通過實例驗證了這種演算法能夠有效地簡化神經網路，使神經網路更加有效地解決實際的故障診斷問題。
  8. We got the spatial distribution map of population density by spatial interpolation, in which the population data are distributed on the grids. the results of the distribution of interpolated based on gis is closed to a real population distribution. the combination of the spatial interactive models and a shortest path algorithm for public transit network is analyzed by supermarket ' s accessibility based on pedestrianism and public transit. this methods may be used to investigate potential supermarket ' s locations. the quantitative analysis about the supermarket ' s market area is realized based on trade mode of lashmanan and hansen, which mainly includes spatial distribution of population, traffic accessibility and free competition between different firms

    文中應用空間內插技術實現了人口數據空間分佈化，將人口數據通過空間插值分佈於研究區域內，使人口空間分佈更接近實際；應用公交最短路徑演算法及空間相互作用模型實現了基於步行和公交出行的超市可達性，將交通對超市選址的影響定量化，方便了方案的比選；在綜合考慮人口空間分佈、超市交通可達性、現有零售商業競爭態勢的基礎上，基於拉、漢購物模式實現了超市商圈定量分析。
  9. The off - line program system based on cad / cam for dispensing robot is designed on the computer. in the module of trajectory planning, preliminary discussion is done about the shortest loop path and an algorithm of solving this problem is provided ; in the module of back procedure, dda ( digital differential analyzer ) is adopted in line, circle and ellipse interpolation. at last the protocol transferring program data to robot from off - line system is analyzed

    在離線編程的系統的設計中，實現了cad的建模、點膠軌跡的程序示教、工藝參數編輯、軌跡規劃、後置處理等功能，並在規劃模塊中針對平面內不規則排列點進行點膠的軌跡規劃進行了初步探討，採用圖論的方法，給出滿足實際要求且演算法復雜度較小的最短閉合迴路的程序演算法;在離線編程系統的後置處理模塊中，介紹了直線、圓弧、橢圓弧的dda插補方法以及脈沖分配不均勻的改進方法;最後對通信協議的制定進行了分析。
  10. To analyze the factors of impacting load balancing of links, which is including the number of routes between source node and destination node, the number of routes through every link, the maximum flow between source node and destination node, the maximum flow through every link, the free bandwidth of every link and so on, we present the fast dynamic routing algorithm ( fdra ) and the critical link routing algorithm ( clra ). simulation results show presented algorithms in the paper are better than other algorithms in reject ratio of the traffic requests and performance of rerouting the traffic requests when a link is failure, especially in computing time cost

    通過分析影響網路的鏈路負載均衡的因素，比如源-目的節點間的最大流，通過每條鏈路的最大流，源-目的節點間的路徑數目，通過每條鏈路的路徑數目，以及鏈路的剩餘容量等，提出了快捷動態路由演算法fdra和關鍵性鏈路路由演算法clra ，通過模擬，與最小跳演算法（ mha ） 、最寬最短路徑（ wsp ）演算法、最小干擾路由演算法（ mira ）相比較，提出的兩種演算法在業務阻塞率、資源利用率以及重路由性能方面都有很好的效果。
  11. A source routing framework is proposed to route traffic flows proactively over multiple paths, which tries to optimize routes for long - lived flows based on dispersity routing ; based on mathematical analysis, our approach disperses incoming traffic flows onto multiple paths according to path qualities. long - lived flows are detected and migrated to the shortest path if their qos could be guaranteed there. suggesting non - disjoint path set, four types of dispersion policies are analyzed, and flow classification policy which relates flow trigger with link state update period is investigated

    提出一種以業務量內在特性為基礎的前攝式多路路由演算法：以對業務量的內在特性分析為基礎，該方法在多路發送數據流的同時檢測非最短路徑上的長流，而後在保證服務質量的前提下將長流遷移到最短路徑上傳輸；前攝式多路路由使用以路徑質量評價為基礎的業務流分佈方法有效提高網路吞吐量，通過周期性的路徑質量評價適應時變網路狀況；模擬實驗表明，該方法可以有效提高「盡力而為」方式下的網路服務質量和資源利用率；浙江大學博士學位論文3
  12. Abstract : in this article an optimization method is applied to de sign open - type distribution networks. graph theory technology is used. its mathem at ical model considers both the investment of constructing lines and the cost of o peration. the main idea is getting the structure of tree network that meets with the technical constraint conditions and at the same time make the annual cost mi nimum. the examples of simulation show that this method is fast and effective

    文摘:將圖論優化技術應用於配電網路的優化設計，提出了一種適合於開式配電網路規劃的優化方法.所建的數學模型綜合考慮了待建線路的投資和運行費用.求解方法是以圖論中的最短路徑問題為基礎，配合以開式網路潮流演算法，並通過可行路徑的合理變換，得出滿足技術約束條件且使年計算費用取極小值的樹狀網路結構
  13. Secondly, the following two subjects are discussed according to the calculation of short - circuit current : ( l ) to verify the dynamic stability condition of wires by using simulated annealing algorithm ( sa ), the paper calculates the maximum value of rectangle wires " short - circuit electrodynamic stress and gets the conditions of their having the maximum value. furthermore, some concerned data about the verifying of copper wires are given by analysing vibration spectrum of the electrodynamic stress ; ( 2 ) in order to get the heat withstand conditions of wires, the paper discusses some common calculation methods, and then tries to study the problem applying artificial neural network ( ann ) based on heat principle of metals. the model is shown to be feasible

    其次，在電路中短路電流計算的基礎上， （ 1 ）進行母線的短路動穩定校驗計算：採用模擬退火演算法（ sa演算法）計算了矩形母線短路電動力的最大值及其取極值的條件，獲得了更為一般的結果，進而通過短路電動力的頻譜分析，給出了銅質母線的有關短路校驗計算數據； （ 2 ）進行母線的短路熱穩定校驗計算：討論了熱穩定校校的幾種常用計算方法，從導體或電器的發熱機理出發，運用人工神經網路理論對母線的熱穩定問題進行計算，通過算例比較，證明該方法用於熱穩定計算是可行的。
  14. Simulation results show that the developed scheme performs well in terms of qos performance metrics such as the lightpath hop length and the network maximal link load. for ip over wdm networks consist of oxcs and routers, which are inter - connected by optical fibers, chapter 3 presents a novel routing and wavelength assignment algorithm based on k - shortest path

    對于由大量路由器和oxc通過光纖互連而組成的ipoverwdm網路，第三章創新性地提出了將ip層矛咣層綜合考慮進行：路由選擇，並利用k ? ?最短路由對有長度限制的請求進行資源分配的演算法。
  15. This paper focuses on the following research work : 1. proposes a genetic algorithm based on matrix encoding for next hop route with load and time delay ; 2. proposes a genetic algorithm for shortest route via designated node, solves the problem which dijkastra algorithm need two times or more to compute ; 3. proposes a scheme of dividing populations and dividing time in order to improve the success ratio ; 4. proposes a network model for directional motion, performs evaluation for mobile ip based on wlan, and concludes some useful results

    提出了解決移動ip中過指定點的路由的遺傳演算法，解決了dijkstra演算法需要分次計算的問題，通過記錄遺傳演算法的疊代結果還可以給出次優解路由； 3引入了分群和分周期的操作策略，對過指點最短路由的遺傳演算法進行了改進，模擬分析表明使用該遺傳演算法求解過指定點的路由獲得了比inagaki演算法更高的成功率； 4
  16. So this article put forward a theory that the optimal problems can be summed up to the mathematic and computing models of state space search of optimal problems. this conclusion unifies the dijstra algorithm used in finding shortest path of traditional explicit graphs and the optimal search of implicit graphs, the search of graph and the search of graphs " tree into a common model and algorithm

    本文提出了將優化問題歸結為狀態空間最優化搜索問題的數學模型和通用演算法，將傳統的在顯式圖中求最短路的dijstra演算法與隱式圖的優化搜索，隱式圖搜索與隱式樹搜索全部統一到同一個模型和演算法中去。
  17. Computing result shows that : coevolutionary mdo algorithms are effective on this problem ; distributed coevolutionary mdo algorithm is better than cooperate coevolutionary mdo algorithm ; asynchronous parallel version of distributed coevolutionary mdo algorithm speeds up the optimization procedure greatly while maintains good convergence performance ; multiobjective distributed coevolutionary mdo algorithm approximates the whole pareto optimal front well in only one single run, saves much computing cost than constraint method to obtain pareto optimal set, and greatly shortens search time by distributed asyn

    計算結果表明：協同進化mdo演算法求解該問題是有效的，其中分散式協同進化mdo演算法優于合作協同進化mdo演算法；異步并行的分散式協同進化mdo演算法在保證收斂性能的同時大大加快了優化進程；多目標的分散式協同進化mdo演算法僅一次運行就很好的逼近了問題的整個pareto最優前沿，比用約束法求解pareto最優集節省了大量計算開銷，而且通過網路多臺微機的分散式并行執行大大縮短了搜索時間。
  18. Shortest path algorithm based on limiting parallelogram and its application in traffic networks

    平行四邊形限制最短路徑演算法及其在交通網路中的應用
  19. 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

    傳統的最短路徑演算法僅僅考慮長度這一條件，這顯然不能滿足復雜交通狀況的實際需要，因此我們引入粗集理論，利用粗集中屬性重要度的概念，綜合考慮各種條件，得到了基於粗集理論的最佳路徑選擇演算法。
  20. The example of city traffic management system in our daily lives was analyzed, and applications of shortest - path algorithm in city traffic management system were expatiatecl as well

    本文分析了城市交通管理系統在現實生活中的應用，並闡述了最短路徑演算法在城市交通管理系統中的應用。
分享友人
分享到 Line

分享到臉書