dijkstra算法的英文

發(fā)音:

英文翻譯
造句

dijkstra's algorithm

算法 algorithm
dijkstra 戴克斯特拉
edsger dijkstra 艾茲格迪科斯徹
算法 algorithm◇算法語(yǔ)句 algorithmic statement; 算法語(yǔ)言 algorithmic language (algol)
演算法 [算法 algorithm
boor算法 de boor's algorithm
casteljau算法 de casteljau's algorithm
cyk算法 cyk algorithm
dfs算法 dfs algorithm
d算法 d algorithm; d-algorithm
knuthmorrispratt算法 knuthmorrispratt algorithm
minimax算法 minimax
paxos算法 paxos algorithm
rsa算法 rsa
zip (算法) zip (file format)
筆算法 long hand method; longhand method
倒算法 retrograde method
反算法 back-calculation
估算法 approximation method
換算法 barter; conversion
積算法 integration method
計(jì)算法 accounting method; added weight method; algorthmic method; approach; calculative method; calculus; computational method; computational technique; installation; method of calculation; numeration
簡(jiǎn)算法 contracted calculation
階算法 order algorithm
精算法 actuarial method

"查查詞典"手機(jī)版

千萬(wàn)人都在用的超大詞匯詞典翻譯APP

例句與用法

Anthinetic of dijkstra yield an effective way to solve this question
Dijkstra算法為解決這類問(wèn)題提供了一種很好的算法。
Finally i implement two location model with common di jkstra algorithm and stimulation annealing merged with gas , at the same time i give out some experiment datas and the idea of algorithm
最后對(duì)兩類選地址模型分別用傳統(tǒng)的dijkstra算法和模擬退火遺傳混合算法實(shí)現(xiàn)，并給出相應(yīng)的實(shí)驗(yàn)數(shù)據(jù)和算法思想。
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算法計(jì)算跳數(shù)最短路徑,并盡力而為地傳送數(shù)據(jù)包,沒(méi)有考慮無(wú)線鏈路時(shí)延、帶寬等狀態(tài)和節(jié)點(diǎn)擁塞程度,這樣的路徑計(jì)算方式已經(jīng)不能滿足用戶對(duì)網(wǎng)絡(luò)提供服務(wù)質(zhì)量的要求。
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
選擇路徑是公交信息系統(tǒng)中的關(guān)鍵技術(shù)，有很多經(jīng)典的算法解決最短路徑問(wèn)題，如dijkstra算法和floyd算法，但大都不適合于公交查詢最短路徑。
Base on exist hardware and network equipment the grid computing experimental environment is constituted in this paper . the parallel dijkstra algorithm to solve the short path problem is tested in the experimental environment
本文在介紹網(wǎng)格計(jì)算基本理論基礎(chǔ)上，在現(xiàn)有硬件環(huán)境下架構(gòu)了globus試驗(yàn)平臺(tái)，并在globus網(wǎng)格環(huán)境下測(cè)試了最短路徑問(wèn)題的并行dijkstra算法。
( 4 ) an efficient approach of the shortest path algorithm which is based on dijkstra algorithm is realized . a motorcade - optimized dispatching software is realized . finally , future applications of the urban traffic flow guidance system are discussed
( 4 )用dijkstra算法實(shí)現(xiàn)了城市中兩點(diǎn)間最短路徑搜索，在此基礎(chǔ)上，實(shí)現(xiàn)了基于電子地圖的大型車隊(duì)優(yōu)化調(diào)度及管理的系統(tǒng)軟件。
The theory and algorithm of shortest path in gis is studied in the dissertation . especially , the traditional dijkstra algorithm and heuristic search algorithm are discussed as well as their own characteristics and conditions
論文對(duì)gis中最短路徑理論和實(shí)現(xiàn)算法進(jìn)行了分析和研究，特別是對(duì)傳統(tǒng)的dijkstra算法和啟發(fā)式搜索算法a ~ *算法進(jìn)行了詳細(xì)的探討，并說(shuō)明了各自的特點(diǎn)及適用條件。
( 5 ) this thesis analyzes the path plan algorithms for vehicle location and navigation system . dijkstra algorithm is used to calculate the shortest path . at last some notable problems of optimum method and path plan in gis environments are proposed
( 5 )對(duì)路徑規(guī)劃算法進(jìn)行了分析，用dijkstra算法實(shí)現(xiàn)了最優(yōu)路徑的計(jì)算；提出了在gis環(huán)境下的優(yōu)化方法以及路徑規(guī)劃過(guò)程中需要注意的問(wèn)題。
At the end of this paper , the different results of pcnn algorithm and dijkstra algorithm is compared , the reason of the difference is analyzed under their internal mechanism , then the conclusion of pcnn has more advantages is drawn
最后，本文還通過(guò)計(jì)算實(shí)例將脈沖耦合神經(jīng)網(wǎng)絡(luò)算法與dijkstra算法的結(jié)果進(jìn)行了比較，從算法思想上探討了計(jì)算結(jié)果不同的原因，說(shuō)明了pcnn算法具有一定的優(yōu)越性。
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
提出了解決移動(dòng)ip中過(guò)指定點(diǎn)的路由的遺傳算法，解決了dijkstra算法需要分次計(jì)算的問(wèn)題，通過(guò)記錄遺傳算法的疊代結(jié)果還可以給出次優(yōu)解路由； 3引入了分群和分周期的操作策略，對(duì)過(guò)指點(diǎn)最短路由的遺傳算法進(jìn)行了改進(jìn)，仿真分析表明使用該遺傳算法求解過(guò)指定點(diǎn)的路由獲得了比inagaki算法更高的成功率； 4

更多例句： 1 2

推薦英語(yǔ)閱讀

dijkstra算法的英文翻譯，dijkstra算法英文怎么說(shuō)，怎么用英語(yǔ)翻譯dijkstra算法，dijkstra算法的英文意思，dijkstra算法的英文，dijkstra算法 meaning in English，dijkstra算法的英文，dijkstra算法怎么讀，發(fā)音，例句，用法和解釋由查查在線詞典提供，版權(quán)所有違者必究。