最短路徑優先 的英文怎麼說
中文拼音 [zuìduǎnlùjìngyōuxiān]
最短路徑優先
英文
fspf- 最 : 副詞(表示某種屬性超過所有同類的人或事物) 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 (時間或次序在前的) earlier; before; first; in advance 2 (祖先; 上代) elder generation; ...
- 路徑 : 1. (道路) way; route; trajectory; path; tail; travel2. (門路) method; ways and means
-
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完全問題,這使得它與傳統的路由過程不同,難以用經典的最短路徑優先演算法求解。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
對于給定的布線平面,該演算法首先由障礙圖形和各個線網的端點生成一個包含最短路徑的訪問點陣,建立初始信息素矩陣,然後利用蟻群演算法所特有的路徑尋優功能來找到當前布線路徑上的最短路徑。Passing through the construction of a special coupled neural network, which can mimic the autowaves in the pulse - coupled neural networks ( pcnns ), we present a new approach ( auto waves approach ) for solving tsp. the autowaves spread in the network, and the path which the first arrived at the end point from the start point has passed is the optimal answer to the shortest path problem
通過構造耦合神經網路,使得由神經元點火所產生的自動波在其中傳播,最先到達目的地的波前所走過的路徑即為最短路問題的最優解,從而有效地獲得了tsp問題的最優解。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
對于航跡優化問題,採用了改進自適應遺傳演算法,首先把航跡規劃問題轉化為受約束的最短路徑問題,並採用狄克斯特拉演算法得到可以進行地形迴避和威脅迴避的粗略優化路徑,然後利用改進的自適應遺傳演算法對粗略優化路徑進行優化,得到優化航跡。Open shortest path first other file
開放系統最短路徑優先Open shortest path first protocol
優先開放最短路徑Open shortest path first
開放最短路徑優先協議Spf shortest path first
最短路徑優先Ospf ( open shorted path first ) and is - is ( inter - domain system - inter - domain system ), relating to routing ; and lmp, relating to link management
關于路由的ospf (開放最短路徑優先)協議和is - is (域間系統?域間系統)協議;Open shortest path first ( ospf ) is one of the routing protocol of internet. originally, it was developed to be the substitute for routing information protocol ( rip )
Ospf ( openshortestpathfirst ,開放最短路徑優先)是internet路由選擇協議的一種,最初是為替代rip協議開發的,目前已成為構建大型網路最常用的路由選擇協議。We presented an an model in this article. it based on the current structure of plan network, which use cost to instead of the hops to compute network path length and realize the route rule of shortest path first ( spf )
因此,在本文中提出了一個基於plan網路的現有架構,以開銷( cost )代替躍點( hops )計數計算網路路徑長度,實現最短路徑優先( shortestpathfirst , spf )路由規則的主動網路模型。This model make full use of the programmable feature of an, dynamicly install the route protocol as a service without reworking bottom protocol of network, and implement the route rule of the spf by plan active packet
該模型充分利用主動網路的可編程特性,在不修改低層網路協議的情況下,以服務的方式動態加載路由協議,並通過plan主動包加以調用,來實現最短路徑優先的路由規則。分享友人