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

中文拼音 [zuìduǎnlùjìngyǎnsuànfǎ]
最短路徑演算法 英文
shortest path 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 （狹窄的道路; 小路） footpath; path; track 2 （達到目的的方法） way; means 3 （直徑的簡稱...
  • 演 : 動詞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
  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. Unfortunately, the problem of finding multicast routing with qos constrained is a np - complete problem. so we can not solve the problem with the classical shortest path first algorithms such as bellman - ford and dijstra

    然而研究表明，由於qos組播路由帶有多個qos約束參數，因此qos組播路由問題是一個np完全問題，這使得它與傳統的路由過程不同，難以用經典的最短路徑優先演算法求解。
  3. Topics covered include : randomized computation ; data structures ( hash tables, skip lists ) ; graph algorithms ( minimum spanning trees, shortest paths, minimum cuts ) ; geometric algorithms ( convex hulls, linear programming in fixed or arbitrary dimension ) ; approximate counting ; parallel algorithms ; online algorithms ; derandomization techniques ; and tools for probabilistic analysis of algorithms

    主題包括?隨機計算、資料結構（雜湊表、省略串列） 、圖論演演算法（最小擴張樹，最短路徑，最少切割） 、幾何演演算法（凸殼、在固定或任意維度的線性規劃） 、近似計數、平行演演算法、線上演演算法、消去隨機技術，以及演演算法的機率分析工具。
  4. Combining the international newest research result of multicast tree, this paper get a series of high efficiency arithmetic of multicast tree problem with the method of increasing storage space, and this paper also takes into account the dynamic capability of arithmetic. in many research fields of multicast tree, many high - efficiency solutions were obtained in this paper. this paper has broadly discussed about multicast tree problem and obtained dmdt ( dynamic minimum distance tree ), fmph ( fast minimum path cost heuristic ), dmph ( dynamic minimum path cost heuristic ) and fgmra ( fast group multicast routing arithmetic )

    本篇論文對多播生成樹問題進行了比較全面的討論，涉及內容包括單約束的單樹多播、單約束的成組多播等多個方面，所提出的動態最短路徑樹演算法dmdt （ dynamicminimumdistancetree ） ，最小代價多播生成樹演算法fmph （ fastminimumpathcostheuristic ）動態最小代價多播生成樹演算法dmph （ dynamicminimumpathcostheuristic ） ，成組多播快速路由演算法fgmra （ fastgroupmulticastroutingarithmetic ） ，都取得了顯著的效果，是目前同類問題中比較好的解決方案，達到了預期的目的。
  5. 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系統軟體具有完善的在線幫助和用戶交流論壇，人機界面友好。
  6. Topics covered include : sorting ; search trees, heaps, and hashing ; divide - and - conquer ; dynamic programming ; amortized analysis ; graph algorithms ; shortest paths ; network flow ; computational geometry ; number - theoretic algorithms ; polynomial and matrix calculations ; caching ; and parallel computing

    課程主題包含了：排序、搜尋樹、堆積及雜湊；各個擊破法、動態規劃、攤提分析、圖論演演算法、最短路徑、網路流量、計算幾何、數論演演算法；多項式及矩陣的運算；快取及平行計算。
  7. 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演算法是一種低復雜度的時延和時延差約束的多播路由演算法。
  8. For a given muting plane, first of all, this algorithm generates the corresponding grid group by barriers and nets ' ports, establishes initialization pheromone matrix, then the algorithm will use the character of ant colony algorithm to find out the shortest muting path only if it exits

    對于給定的布線平面，該演算法首先由障礙圖形和各個線網的端點生成一個包含最短路徑的訪問點陣，建立初始信息素矩陣，然後利用蟻群演算法所特有的路徑尋優功能來找到當前布線路徑上的最短路徑。
  9. We adopt k shortest paths into routing and choose the best route in them considering link costs, links hops and the number of no - utilized wavelength in a link

    路由選擇採用k條最短路徑演算法進行，備選路由集中首選最佳路由時考慮鏈路的代價，跳數和每一條鏈路上不可用波長數。
  10. 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

    文中應用空間內插技術實現了人口數據空間分佈化，將人口數據通過空間插值分佈於研究區域內，使人口空間分佈更接近實際；應用公交最短路徑演算法及空間相互作用模型實現了基於步行和公交出行的超市可達性，將交通對超市選址的影響定量化，方便了方案的比選；在綜合考慮人口空間分佈、超市交通可達性、現有零售商業競爭態勢的基礎上，基於拉、漢購物模式實現了超市商圈定量分析。
  11. 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條最短路徑演算法，系統的運行結果驗證了該演算法的有效性。
  12. We set focus on solutions which include the vector map representation of city road network, the abstraction and construction of the topological structure of network, and the efficient implementation of shortest path algorithm

    其中，重點解決了城市道路網的矢量地圖表達、網路拓撲結構的提取和構建、最短路徑演算法的高效實現等關鍵技術。
  13. Dijkstra ' s shortest path first algorithm

    最短路徑演算法
  14. The paper discusses the transformation problem between different types of coordinate systems, for example : the coordinate transformation between wgs - 84 coordinate system and beijing 54 coordinate system, the formula for gauss projection positive and negative computation in national stripes and any local projective stripes, and presents an algorithm. combined with some classic shortest path algorithms, this paper presents an efficient method of realize the shortest path algorithm which is based on dijkstra algorithm

    84坐標系與北京54坐標系之間的變換，國家投影帶和地方任意投影帶的高斯投影正、反算公式，並給出了具體演算法；在一些經典的最短路徑演算法的基礎上，提出了一種dijkstra最短路徑演算法的高效率實現方法。
  15. The calculating method for the actual route length of facility layout

    關于設備布局的最短路徑演算法模型
  16. Shortest path algorithm with real time traffic information in dynamic vehicle routing problem

    動態車輛路徑問題中的實時最短路徑演算法研究
  17. Shortest path algorithm based on limiting parallelogram and its application in traffic networks

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

    傳統的最短路徑演算法僅僅考慮長度這一條件，這顯然不能滿足復雜交通狀況的實際需要，因此我們引入粗集理論，利用粗集中屬性重要度的概念，綜合考慮各種條件，得到了基於粗集理論的最佳路徑選擇演算法。
  19. 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

    本文分析了城市交通管理系統在現實生活中的應用，並闡述了最短路徑演算法在城市交通管理系統中的應用。
  20. It importantly introduces the technology of analyzing the gis - network, and points out that analyzing the gis - network, is the basic function of the gis space analysis. the core of the gis space analysis is working out the short path - and the best path form the destination to the source

    並重點介紹了gis網路分析技術，指出路徑網路分析是gis空間分析最基本的功能，其核心是對最短路徑、最佳路徑的求解，並敘述了最短路徑演算法的相關知識。
分享友人
分享到 Line

分享到臉書