最優路徑 的英文怎麼說

中文拼音 [zuìyōulùjìng]
最優路徑 英文
optimal path
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 路 : 1 （道路） road; way; path 2 （路程） journey; distance 3 （途徑; 門路） way; means 4 （條理） se...
  • 徑 : Ⅰ名詞1 （狹窄的道路; 小路） footpath; path; track 2 （達到目的的方法） way; means 3 （直徑的簡稱...
  • 最優 : optimal; optimum最優策略 optimal policy; optimal strategy; 最優設計 optimum design; 最優值 optima...
  • 路徑 : 1. （道路） way; route; trajectory; path; tail; travel2. （門路） method; ways and means
  1. The optimum paths for multiplications of 7 and 8 are depicted in figure 6. 17.

    圖617中描繪了倍增7倍和8倍的最優路徑。
  2. The best route of extraction of exhaustible resources

    可耗盡資源抽取的最優路徑
  3. This paper analyzes the result of simulation by using luna ' s benchmark table and indicates that the distribution of nodes with different perceptivity is a hiding order of different optimal path produced by system

    並用luna的基準表對模擬結果進行了分析，指出具有不同感知能力的節點在空間上的分佈是系統產生不同最優路徑的隱秩序體現。
  4. The optimistic arithmetic of agv move route is ratiocinated combined with the principles of archives storage, in order to the purpose of storage and fetch archives quickly

    為達到快速自動存取檔案的目的，結合論文所制定的檔案存放原則，推導了agv行走的最優路徑演算法。
  5. The algorithm is realized by c. it is indicated by simulation that the algorithm is resultful. finally, the parallel genetic algorithm is discussed and the parallel genetic algorithm for shortest route choice is given

    最後，本文還探討了遺傳演算法并行計算的實現方式及其特點和適用范圍，並選擇了適用於最優路徑計算的并行遺傳演算法。
  6. The basic thought is to divide the cities which are close to each other into a group ( physical area ) by applying sorting neural network, find out the optimal path by the improved hnn, and then calculate the local optimal path by using the same method, and finally get the whole optimal path, which are described as following : a assembly s of cities is grouped into some subsets according to their physical location and we can get, and then get the optimal, path of tsp of s = { s, i = 1, 2, n } through the given method, as well as the st

    基本思想是利用聚類神經網路先把地理位置上相互靠近的城市劃分為一個集體單位（一個物理區域） ，用改進的hopfield神經網路演算法求解各個區域間的最優（或近似最優）路徑，然後再在每一個區域內部用同樣的方法來求解其局部的最優（或近似最優）路徑，這樣可以最終得到全局的最優（或近似最優）解。描述如下：設有城市集合s ，按城市的地理位置把s劃分為若干子摘要2集，得s ijs ， ，其中廠s ； d ， i一口求得集合i叫s s ； i習， 2 ， … n的tsp最優路徑，再依次求得子集s ；內部的tsp最優路徑，即得最終優化路徑m一） s一） …一寧s ； di
  7. For a given power network model, once establishing initialization pheromone matrix, searching the path depending on the special ability of ant colony, combining with an improved method of refreshing pheromone, manhattan distance and the thought of flexibility, the best power distribution network planning path is found at a higher rate only if it exits

    對于給定的配電網模型，該演算法根據各配電網站點建立初始信息素矩陣，然後利用蟻群演算法所特有的路徑尋優功能來搜索配電網布局路徑，並結合改進信息素刷新的方式和在蟻群搜索過程中引入曼哈頓距離以及彈性伸縮調節因子，使蟻群以較快的速度找到當前布局上的最優路徑。
  8. It utilizes the vehicle on - way time composition, time delay model in crossroad, road line selection, and optimized approach calculation by urban road traffic net analyse model

    在城市道路交通網路分析模型中分析了車輛在途旅行時間構成以及交叉口時間延誤模型、行車路線選擇及其最優路徑演算法。
  9. The continually optimized connecting relation is gained via perceptron and xor function, then the optimal path graph is found

    利用感知器異或函數獲得了節點之間不斷優化的連接關系，然後得到最優路徑圖。
  10. The optimal path of rural financial system reform in china

    中國農村金融體制改革的最優路徑選擇
  11. When the arc lengths are stochastic and time - dependent, the problem becomes considerably more difficult

    由於隨機性和時間依賴性引入到網路模型中，使得最優路徑問題變得復雜化、多樣化。
  12. 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期望最短路徑就是這樣的問題之一。
  13. Technical alliance : optimized route for technology innovation in the transnational management of private enterprises

    民營企業跨國經營技術創新的最優路徑選擇
  14. Analyzed the similarity between scheme solving problem and traveling salesman problem ( tsp ), the scheme solving problem for conceptual design is transformed into an optimal path problem in combinatorial optimization, where the dynamic programming based solution space model and the longest path based optimization model are developed

    摘要通過分析概念設計方案求解問題與旅行商問題的相似性，將方案求解問題轉化為組合優化的最優路徑問題，建立了基於動態規劃的解空間模型和基於最長路徑的優化模型。
  15. Finally, devise the algorithm of optimum path

    最後設計了最優路徑選取的演算法。
  16. By establishing the direct mapping from the state set to the action set, the planning efficiency is improved. the learning converges to the optimal control strategy. the simulation result shows that the control strategy is optimized and the control performance is improved

    同基於傳統人工勢場法相比，此方法避免了不合理勢場方程所引起的局部極小值問題，而且通過學習得到的策略，可以得到從任意起始位置開始的最優路徑。
  17. Though simulating the state of packing, adopting the experience of manual packing and heuristics knowledge to control the searching way and limit the search space, it changes the packing problem into the problem of searching best path in the state space

    文中對多邊形的合成技術進行了研究，通過模擬布局狀態，吸取人工布局的經驗，採用啟發式知識控制搜索方向，限制搜索空間，把布局問題轉化為在狀態空間下尋找最優路徑的問題。
  18. The algorithm makes use of the node - arc structure of graph and depth - first - search, have realized the retrieval of optimum path in virtual navigation

    該演算法以圖的節點?弧段結構結合深度優先搜索實現了自動游覽中最優路徑的檢索。
  19. Optimal route choice algorithm is one of the key ingredients of dynamic traffic distribution theory. its major goals is to find the optimal route to destination from road net as soon as possible with lowest computing error, according to the road structure, road weight and od value

    它是根據交通控制系統提供的路網結構、路段權值和出行的od對值，在路網中找出從出發點到目的地的最優路徑，其要求是能夠盡可能快速和準確地實現誘導路徑的計算功能，滿足動態交通流誘導的全局尋優和實時性等方面的要求。
  20. At the same time, we eliminate the image blur by motion objects using optimal path finding

    另外，我們針對運動物體引起的模糊作了最優路徑的運動物體消除。
分享友人
分享到 Line

分享到臉書