dijkstra 中文意思是什麼

dijkstra 解釋
戴克斯特拉
  1. In this dissertation we present a general, extensible methodology that examines cryptographic protocols. our approach is specify a protocol in cpal ( cryptographic protocol analysis language ), apply hoare and dijkstra ? theory of formal semantics to it, analysis it ? forma ] semantics, define weakest precondition of each kind of language statement

    我們的方法就是用cpal （ cryptographicprotocolanalysislanguage ）語言來表示協議，將hoare和dijkstra在形式語義方面的理論應用到該語言，分析該語言的形式語義，定義每種語句的最弱前置條件。
  2. The thesis then studies the emulation modes of routing algorithms with inaccurate network state information, proposes a simulation model based on events for routing algorithms with inaccurate network state information, and develops a routing simulation software r - ns that provides an effective environment for the research of network routing algorithms. randomized routing algorithms based on improved dijkstra and bellman - ford algorithms are proposed for the unicast routing model with inaccurate network state information

    本文研究了非精確網路狀態信息的路由演算法模擬模擬方法，提出了非精確網路狀態信息下基於事件的網路路由模擬模擬模型，設計並實現了路由模擬模擬軟體rns ，對網路路由演算法的研究提供了很好的支撐環境。
  3. Up to now, there has been ten years for the research of dynamic fuzzy logic ( dfl ) and a series of achievements have been made. in order to further expand the applications of dfl, this thesis followed dijkstra ’ s guarded commands and put forward an operational semantics model of dfl programming language which can solve dynamic fuzzy problems

    動態模糊邏輯（ dfl ）的研究已有十年的時間了，目前已取得了一系列研究成果，為了進一步拓展這些研究成果的應用，本文借鑒dijkstra的監督命令程序結構，通過結構化操作語義描述方法從軟體理論方面進行研究，提出了動態模糊邏輯程序設計語言（ dflprogramminglanguage ）的操作語義模型，以期形成解決動態模糊性問題的程序設計方法。
  4. Based on the analysis and research of current development of geographical network analysis, we summarize the limitation o f current research, and put forward making a geographical network analysis component with component technology, this method realizes geographical network analysis arithmetic and its values, improve the reuse of arithmetic. this method remedy mapx, mo etc gis component ' s geographical network analysis functipn, it also can resolve requirements for short path analysis, locating and servering analysis, material flowing analysis and connectivity analysis, at the same time this method is a beneficial reference for other gis component " design and realization. after mastered correlative theories and arithmetics, using com technology, we realize a geographical network analysis component, and apply it in system for flood material dispatch. the main content and work can be summarized as flows : 1. based on graph network model, we analysis and sum up geographical network analysis model and arithmetic, discuss the most important arithmetic - dijkstra arithmetic and improve it

    通過該思路不僅使研究成果得以應用，體現其價值，也提高了演算法的重用性；開發出來的地理網路分析控制項彌補了當前mapx 、 mo等基礎gis組件的地理網路分析功能，利用該控制項也能解決現實中對路徑分析、選址服務分析、物流分析、連通性分析等地理網路分析的迫切需求，同時該思路對gis組件設計開發也是一個有益的參考。本文在掌握相關理論和演算法基礎上，利用com技術實現了地理網路分析控制項，並在防汛物資調度系統中進行應用。本文主要內容和工作如下： 1 、以圖論中的網路模型為參考，分析總結了幾類基本的地理網路分析模型及演算法，對其中的核心演算法? ? dijkstra演算法進行了分析探討，並對該演算法進行了改進。
  5. 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演算法計算跳數最短路徑，並盡力而為地傳送數據包，沒有考慮無線鏈路時延、帶寬等狀態和節點擁塞程度，這樣的路徑計算方式已經不能滿足用戶對網路提供服務質量的要求。
  6. 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期望最短路徑就是這樣的問題之一。
  7. 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條最短路徑演算法，系統的運行結果驗證了該演算法的有效性。
  8. An efficient method of computing the shortest path algorithm which is based on dijkstra algorithm is presented ; 4

    對經典dijkstra最短路徑搜索演算法採用空間換時間的方法，提高了搜索效率； 4
  9. E. w. dijkstra. 1959. a note on two problems on conneion with graphs. numer. math. 1, 395 - 412

    陳慧琪，時間相依最短路徑問題演算方法之研究，國立交通大學運輸工程與管理學系碩士論文， 2000年。
  10. We denote many typical arithmetics with apla, such as, non - recursive tree traversals, dijkstra, topological sorting etc. the test result indicates the program transformer can improve the program ' s reliability and development efficiency. it can replace softeware blue collar to complete mechanical and creative work

    5 、實現了自動轉換系統的泛型問題中的類型參數化問題，解決了apla提供泛型機制，而java語言不支持泛型機制的矛盾。
  11. By analyzing the normal parallel method and comparing parallel routing table computation based warr and jesper ' s parallel dijkstra algorithm, propose a scheme of distributed implementation of ospf protocol. secondly, based on the warr, we propose a wholely distributed implementation method of ospf

    分析了可擴展tbit路由器結構的特點以及分散式系統協議并行的一般方法，並對基於warr方法的并行路由表計算和jesper的并行dijkstra演算法進行比較，選取加速ospf協議路由表計算的方法。
  12. Floyd - dijkstra algorithm applied to the design of cable laying

    演算法在電纜敷設設計中的應用
  13. The calculation of the shortest path using modified dijkstra algorithm in gis

    演算法實現最短路徑的計算
  14. A heuristic optimization path - finding algorithm based on dijkstra algorithm

    演算法的啟發式最優路徑搜索演算法
  15. Dijkstra ' s shortest path first algorithm

    最短路徑演算法
  16. Anthinetic of dijkstra yield an effective way to solve this question

    Dijkstra演算法為解決這類問題提供了一種很好的演算法。
  17. Choosing route for passengers is the key technology in the bus information system. there are many classic algorithms such as dijkstra algorithm and floyd algorithm to solve the problem. but they do n ' t fit for this problem

    選擇路徑是公交信息系統中的關鍵技術，有很多經典的演算法解決最短路徑問題，如dijkstra演算法和floyd演算法，但大都不適合於公交查詢最短路徑。
  18. A frame representation was chosen to express the knowledge of carqs, and c + + was used to define the data structure. aiming at the design objective of system, rote learning was chosen to improve the performance. chapter four discussed how the dijkstra ' s arithmetic was ameliorated

    在分別對知識表示、機器學習研究探討的基礎上，經過對多種知識表示方法進行分析、比較，最終確定利用框架表示法表示carqs中的知識，用c + +語言對數據結構進行了定義，並針對系統設計目標，選擇機械學習作為性能改進途徑。
  19. In the course of the design of trajectory optimization, we adopt the improved adaptive genetic algorithm. first, the route planning problem is converted into the restricted short - cut problem and dijkstra algorithm is used to get the rough optimized trajectory which makes terrain avoidance and threat avoidance effectively. then, the adaptive genetic algorithm is used to optimize the reference trajectory

    對于航跡優化問題，採用了改進自適應遺傳演算法，首先把航跡規劃問題轉化為受約束的最短路徑問題，並採用狄克斯特拉演算法得到可以進行地形迴避和威脅迴避的粗略優化路徑，然後利用改進的自適應遺傳演算法對粗略優化路徑進行優化，得到優化航跡。
  20. 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最短路徑演算法的高效率實現方法。
分享友人
分享到 Line

分享到臉書