最短路徑法 的英文怎麼說

中文拼音 [zuìduǎnlùjìngfǎ]
最短路徑法 英文
minimum 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 （由國家制定或認可的行為規則的總稱） 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. After knowing fully the present situation of business operation of the golden cereal company and development characteristics in logistic - system field, the mathematics model of logistics system has been established in the article with the application of linear program method in operational research, as well as the strategy of minimum route in graph theory and the thought of transiting all over ; meanwhile, on the foundation of internet network technology and structure of b / s, the online optimization design and production of web page have been carried out for the logistic - system of the golden grain farming capital company with adoption of jsp ( java server page ) technology and sql server database technology

    本文在充分了解金色谷農資公司的業務運行現狀和物流配送行業發展特點的基礎上，應用運籌學的線形規劃方法，以及圖論中最短路徑的策略和圖的遍歷的思想，建立了配送系統數學模型；並基於internet網路技術b s結構基礎上，採用jsp （ javaserverpage ）技術和sqlserver數據庫技術，對金色谷農資公司物流配送系統進行了網上優化設計及網頁製作，研製開發了金色谷農資智能配送網。
  7. Solution of the shortcut problem in graph algorithms

    圖論中最短路徑問題的解法
  8. 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

    課程主題包含了：排序、搜尋樹、堆積及雜湊；各個擊破法、動態規劃、攤提分析、圖論演演算法、最短路徑、網路流量、計算幾何、數論演演算法；多項式及矩陣的運算；快取及平行計算。
  9. As existing approaches for computer aided conceptual design hardly take into consideration the consistency of input and output energy objects in their detailed features during the synthesis process, a heuristic approach for conceptual design of energy transforming systems was proposed based on the gene model of energy - transforming systems and the knowledge of the shortest paths between different physical objects

    摘要針對目前的概念設計方法在考慮多種能量對象細節特徵匹配性方面的不足，以能量轉換產品基因模型為基礎，提出了一種基於相異物理量間最短路徑知識的啟發式搜索求解模型。
  10. The application of the shortest path in land grading

    最短路徑方法在土地定級中的應用
  11. 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演算法是一種低復雜度的時延和時延差約束的多播路由演算法。
  12. 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

    對于給定的布線平面，該演算法首先由障礙圖形和各個線網的端點生成一個包含最短路徑的訪問點陣，建立初始信息素矩陣，然後利用蟻群演算法所特有的路徑尋優功能來找到當前布線路徑上的最短路徑。
  13. 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

    本論文將增強式學習演算法和人工勢場法相結合，提出狀態評價函數和勢場的對應關系，以及控制策略和勢場力方向的對應關系，通過機器人的自適應學習，來形成優化的人工勢場，使機器人能夠以最短路徑繞過障礙，到達目標。
  14. 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條最短路徑演算法進行，備選路由集中首選最佳路由時考慮鏈路的代價，跳數和每一條鏈路上不可用波長數。
  15. The dijkstra algorithm of the least of hops is used for path calculated in olsr. but the protocol only tries its best to transmit data, not considering the state of wireless link

    它採用dijkstra演算法計算跳數最短路徑，並盡力而為地傳送數據包，沒有考慮無線鏈路時延、帶寬等狀態和節點擁塞程度，這樣的路徑計算方式已經不能滿足用戶對網路提供服務質量的要求。
  16. 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 ）求解大型、稀疏的方程組來反演近地表的速度場。
  17. 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

    文中應用空間內插技術實現了人口數據空間分佈化，將人口數據通過空間插值分佈於研究區域內，使人口空間分佈更接近實際；應用公交最短路徑演算法及空間相互作用模型實現了基於步行和公交出行的超市可達性，將交通對超市選址的影響定量化，方便了方案的比選；在綜合考慮人口空間分佈、超市交通可達性、現有零售商業競爭態勢的基礎上，基於拉、漢購物模式實現了超市商圈定量分析。
  18. 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期望最短路徑就是這樣的問題之一。
  19. 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條最短路徑演算法，系統的運行結果驗證了該演算法的有效性。
  20. Users plot a coarse outline of video objects in the graphic user interface ( gui ) using the mouse at the first step, then fill the outline to obtain a binary model, using seed growing and wavelet edge correct the outline. in tracking video objects, we obtain an initial segmentation uses motion information and the model of previous frame, and correct by the information of space. finally, we obtain an accurate segmentation

    利用視覺系統的周邊抑制機制對模板外的象素進行屏蔽，消除背景影響，由自動閾值選取的小波邊緣提取獲得視頻對象的邊界，利用種子生長法進行輪廓擬合，由最短路徑法校正模板，在進行視頻對象的跟蹤時，利用運動信息和上一幀的模板，得到一個初始分割，利用空間信息對邊界象素調整，最後得到精確分割的視頻對象。
分享友人
分享到 Line

分享到臉書