shortest path 中文意思是什麼

shortest path 解釋
最短道路
  • shortest : 最短的
  • path : path(ol )=pathological; pathology n (pl paths )1 (自然踏成的)路;路徑;(馬路邊上的)人行...
  1. The archipelago is a hazardous traffic median in the great circle route, the shortest path between ports on either side of the north pacific

    多島海域是大圓航線上極具危險的運輸中樞,也是連接北太平洋各端港口的最短通道。
  2. 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中的最短路徑演算法來求解。
  3. 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完全問題,這使得它與傳統的路由過程不同,難以用經典的最短路徑優先演算法求解。
  4. We performed crosswell tomography on a real crosswell seismic line from shengli oilfield by using simultaneous iterative reconstruction technique ( sirt ) based on shortest path tree ( spt ) curved ray tracing

    摘要利用基於最短路徑樹彎曲射線追蹤的聯合迭代重建層析成像( sirt )技術進行井間地震層析成像,對勝利油田的一對井間實際資料進行了處理。
  5. Secondly, according to the characteristics of few hubs in the practical hub and spoke airline network, the shortest path algorithm is improved, and an exact algorithm is proposed to solve the airline network robust optimization model, with which robust solutions suitable for various possible scenarios are obtained

    然後結合中樞輻射航線網路實際應用中樞紐個數少的特點,對最短路演算法加以改進,提出了一種求解航線網路魯棒優化設計的精確演算法,得到了適用於多種可能情景的魯棒解。
  6. 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系統軟體具有完善的在線幫助和用戶交流論壇,人機界面友好。
  7. Heuristic algorithm for shortest path problem with nonlinear constraints

    非線性約束最短路問題的啟發式演算法
  8. The application of the shortest path in land grading

    最短路徑方法在土地定級中的應用
  9. Another constrained problem is delay and delay variation constrained multicast routing problem. sp - dvma ( shortest path delay variation multicast algorithm ) algorithm based on minimum delay path is presented

    第二類是時延和時延差約束的多播路由問題,提出了以最短時延路徑為基礎的一種演算法? ? sp - dvma演算法。
  10. This subject will survey some of the applications of network flows and focus on key special cases of network flow problems including the following : the shortest path problem, the maximum flow problem, the minimum cost flow problem, and the multi - commodity flow problem

    這個主題將審視一些網流的應用並集中焦點在以下網流問題的關鍵特殊情況:最短路徑問題,最大流量問題,最少成本流量問題,和多元物品流量問題。
  11. An algorithm for maze by marking shortest path with recursive backtracking

    迷宮問題的最短距離標記法遞歸求解
  12. Research on the shortest path of material transportation in interval time

    物資調運時間為區間數的最短路問題研究
  13. Concretely we discuss the application of the shortest path problem, traveling salesman problerm and project management method on the touring itinerary improvement of travel agency. furthermore, we explore the use of minimum spanning tree problem, overlaid problerm and maximum flow problerm on the touring itinerary improvement of scenic spots. and also enclosed detailed spreadsheet solutions

    具體的,討論了最短路問題、旅行商問題和排程問題在旅行社線路優化中的應用;討論了最小支撐樹問題、覆蓋問題和最大流問題在旅遊景區線路優化中的運用,並在附錄中給出了詳細的電子表格解法。
  14. In paper [ 4 ], rule space was used to connect all knowledge states and to draw a knowledge states distribution map, thus we can use this map to direct our remedial instruction. local shortest path strategy was used in paper [ 4 ] for all case, however, we propose several more strategies for best effect in different situations

    文章[ 4 ]提出藉助規則空間將不同知識狀態聯系起來,形成知識狀態的空間分布圖,以方便實施針對學生的補救措施(指導計劃) ,但它制定教學計劃時候,只是簡單採用局部最短路徑。
  15. Shortest path is based on cumulative link costs. link costs are based on the speed of the link

    最短的路徑是依據累計的連結成本來決定的。連結成本是依據連結速度來決定的。
  16. The conceptual design of a lighting system using sea waves as the energy source demonstrates that the proposed approach can not only maintain tile consistency of input and output energy objects in detailed features, but also achieve efficient synthesis of solutions with aid of tile shortest path knowledge and other heuristic knowledge

    一種海浪照明系統的概念設計實例證明:該模型不但能在復雜能量轉換系統的概念設計過程中正確考慮輸入輸出能量對象在細節特徵上的匹配性,增強組合解的可行性,而且能藉助最短路徑知識和其他啟發式知識較迅速地從知識庫中找到合適的組合原理解。
  17. The authors established an initial velocity model based on the first break time of the actual data, then realized the forward calculation with the improved shortest path ray tracing algorithm, and applied the improved constrained damped simultaneous iterative reconstruction technique ( cdsirt ) to solve large - scale and sparse equations for inversing the near - surface velocity field

    根據實際地震數據的初至波時間建立初始速度模型;採用改進的最短路徑射線追蹤演算法進行正演;利用改進的約束帶阻尼聯合迭代重建技術( cdsirt )求解大型、稀疏的方程組來反演近地表的速度場。
  18. The shortest path analysis based on genetic algorithms

    迭代的半局部收斂性分析
  19. 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

    文中應用空間內插技術實現了人口數據空間分佈化,將人口數據通過空間插值分佈於研究區域內,使人口空間分佈更接近實際;應用公交最短路徑演算法及空間相互作用模型實現了基於步行和公交出行的超市可達性,將交通對超市選址的影響定量化,方便了方案的比選;在綜合考慮人口空間分佈、超市交通可達性、現有零售商業競爭態勢的基礎上,基於拉、漢購物模式實現了超市商圈定量分析。
  20. Standard shortest path algorithms ( such as the dijkstra algorithm ) are not valid, since travel times are random, time - dependent variables. especially, the recognition version of the stochastic shortest path problems is np - complete. k expected shortest paths problem shown in this paper is one of these problems

    傳統的最短路徑方法不能解決這種非線性路徑耗費的路徑問題,尤其是同時具有隨機性和時間依賴性的網路使得最優路徑問題成為np完全問題,本文研究的k期望最短路徑就是這樣的問題之一。
分享友人