path finding algorithm 中文意思是什麼
path finding algorithm
解釋
路徑選擇規則-
For optical - layering approach, we propose an ant - based algorithm, which uses the ants " capability of finding shortest or near - shortest paths between a food source and their nests, to solve the logical topology reconfiguration problem. we give the ants routing formula based on dynamic load balancing and short path on the assumption that some conditions hold
前者適合於業務矩陣變化不是太頻繁的網路，提出利用螞蟻演算法解決業務的再路由問題，即利用螞蟻具有找到最短徑及不同種類螞蟻具有互斥的天然特性來進行邏輯拓撲重配置，從而保證了鏈路負載分佈的平衡性。 -
According to the virtual endoscopy automatic navigation, using the two - distance field - based 3d center path finding algorithm to find the path, adopting the cylindrical approximation of tubular organs to replace the center path by several approximate cylinders, while using distance transformation that is substituted by euclidean distance to calculate the approximate cylinder ' s axis and radius, the algorithm can save much time
摘要針對虛擬內窺鏡自動漫遊技術，利用基於雙距離場的三維中心路徑提取演算法進行路徑提取，採用管狀器官的圓柱狀近似，將中心路徑用多個近似的圓柱體代替，用距離變換代替歐式距離公式計算近似圓柱體的軸和半徑，節省了大量的計算時間。 -
A heuristic optimization path - finding algorithm based on dijkstra algorithm
演算法的啟發式最優路徑搜索演算法 -
This paper divides the web usage mining process into three main parts : data collecting consists of the three server logs - access, referer, and agent, the html files the make up the site, and registration data ; data preprocessing, includes data cleaning, user identification, session identification, path completion and transaction identification ; data analysis consists of mining frequent access paths and association rule. thinking about the amount of hits on homepage, this paper improves the algorithm of finding frequent items
並結合網頁特點，考慮到主頁的點擊率的影響，對生成頻繁訪問瀏覽頁的演算法做了改進；在web使用挖掘的基礎上引入部分web結構挖掘，對挖掘瀏覽頁的關聯規則做了補充，在web結構挖掘基礎上挖掘出的相關瀏覽頁也推薦給用戶，在一定程度上提高了關聯規則的精確度。 -
In which, we use cubic symbol for describing the logic function of a network in well - balanced state, then use sharp - product operation for constructing disjoint minimal path set of network. and a dps algorithm for finding out the minimal path set is also presented
研究了網路可靠性分析的不交和演算法，應用計算機輔助邏輯綜合技術實現最小路徑的不交化；並給出一個搜索網路所有最小路經的dfs演算法。 -
So this article put forward a theory that the optimal problems can be summed up to the mathematic and computing models of state space search of optimal problems. this conclusion unifies the dijstra algorithm used in finding shortest path of traditional explicit graphs and the optimal search of implicit graphs, the search of graph and the search of graphs " tree into a common model and algorithm
本文提出了將優化問題歸結為狀態空間最優化搜索問題的數學模型和通用演算法，將傳統的在顯式圖中求最短路的dijstra演算法與隱式圖的優化搜索，隱式圖搜索與隱式樹搜索全部統一到同一個模型和演算法中去。 -
This paper proposes a mobile agent - based distributed quality - of - service routing algorithm. the algorithm uses mobile agents to search the whole network to find a feasible path that meet the needs of user ' s qos requirement and makes the reservation for selected path. the algorithm combines qos finding and resource reservation
現有的internet提供的是一種「盡力而為」 （ best - effort ）的服務模型? ?一組數據可能經過不同的路徑到達同一個目的地，同時數據包的順序可能會被打亂，而且不支持資源預留。 -
A path - finding algorithm is implemented on wordnet to find semantics relations between two words
開發了一種路徑搜索演算法，藉此可以在詞對之間進行語義分析。
分享友人