search path algorithm 中文意思是什麼
search path algorithm
解釋
查找路徑演算法-
Firstly, the connected end sets of the relay lines are got using the breadth first search algorithm and the connected relationship of wiring terms is got in the electrical circuit diagram according to different cad block structure of different element type. secondly, the appropriate specification of the relay element is chosen by using the equinoctial graph algorithm, and the panel layout diagram is generated automatically by the combining automatic layout and manual intervention. finally, the optimized path algorithm which passes each vertex in the completed non - directional graph once and only once is put forward, this algorithm and the prim minimum spanning tree algrotithm can generate the inner panel wiring diagram and terminal wiring diagram automatically
首先，採用廣度優先搜索演算法查找電氣原理圖中的連通導線端點集，並根據不同類型的繼電元件對應的cad圖塊結構的不同，得到電氣原理圖中元件接線端子之間的連接關系;其次，根據二分圖匹配演算法為電氣原理圖中繼電元件選擇合適的型號和規格，並採用人工干預和自動布置相結合的方法完成屏面布置圖的自動生成;最後，提出了完全無向圖中經過每個頂點一次且僅一次的優化路徑演算法，利用該演算法和經過預處理的prim最小生成樹演算法自動生成屏內安裝接線圖和端子接線圖。 -
Heuristics decision algorithm for mission path planning based on tabu search
基於禁忌搜索的啟發式任務路徑規劃演算法 -
The orientation path and residual network were defined, the new maximum flow algorithm in network with both node and edge capacity confined was put forward based on feasible flow decompose theorem and by way of the search in artificial intelligence
定義了有向路徑和殘量網路的概念，依據可行流分解定理，引入人工智慧中搜索的方法，以鄰接矩陣為網路數據存儲結構，提出條件約束下的網路最大流新演算法。 -
Because ga possesses the traits of can global random search, the robustness is strong, been use briefly and broadly, it didn ’ t use path search, and use probability search, didn ’ t care inherence rule of problem itself, can search the global optimum points effectively and rapidly in great vector space of complicated, many peak values, cannot differentiable. so it can offset the shortages of nn study algorithm, can reduce the possibility that the minimum value get into local greatly, the speed of convergence can improve, interpolation time shorten greatly, the quantity of training reduce
因為遺傳演算法具有全局隨機搜索能力，魯棒性強、使用簡單和廣泛的特點，它不採用路徑搜索，而採用概率搜索，不用關心問題本身的內在規律，能夠在復雜的、多峰值的、不可微的大矢量空間中迅速有效地尋找到全局最優解，所以可以彌補神經網路學習演算法的不足，使陷入局部最小值的可能性大大減少，使得收斂速度提高，訓練量減小。 -
The algorithm for certificates path construction that it is suitable for pki with bridge certification authority and cross authentication is proposed based on the theory of breadth first search algorithms for graphs
基幹圖的寬度優先搜索理論，提出了適用於具有橋接ca和交叉認證的pki系統中的證書路徑構造演算法。 -
Abstract : a new algorithm w - ecop is presented to effect incremental changes on a standard cell layout automatically. this algorithm deals with cell inserting and cell moving based on rows instead of on cells as most placement algorithms usually do. an integer programming problem is formulated to minimize the adjustment on the initial placement and a heuristic method is presented to search for a shifting path so as to optimize the wirelength. test of w - ecop on a group of practical test cases shows that the algorithm can successfully accomplish incremental placement with good quality and high speed
文摘:提出了一種新的增量式布局方法w - ecop來滿足快速調整布局方案的要求.與以前的以單元為中心的演算法不同，演算法基於單元行劃分來進行單元的插入和位置調整，在此過程中使對原布局方案的影響最小，並且盡可能優化線長.一組從美國工業界的測試例子表明，該演算法運行速度快，調整后的布局效果好 -
According to the definitions of bottleneck bandwidth, available bandwidth and bulk transfer capacity, we analyzed the algorithms which named vps ( variable packet size ), pptd ( packet pair / train dispersion ), slops ( self - loading periodic streams ) and topp ( trains of packet pairs ) ; based on the principle of sub - path bottleneck measurement, we developed the bottleneck measurement algorithm using heterogenous packet - pair train ; after designing the three child algorithms ( demarcating bandwidth range, approaching bandwidth value and predicting the trendency of available bandwidth fluctuation ), we performed the algorithm called self - loading binary search ; applying the multi - home properties of sctp ( stream controltransmission protocol ) and measurement algorithm of available bandwidth, we presented a scheme to adjust the sctp transport path when there are network congestions or faults ; by the library of winsock and winpcap, we developed a measurement program to look for bottleneck bandwidth. in ns2 experiments, the algorithm based on heterogenous packet - pair train fitted well, and the algorithm of self - loading binary search worked quickly, and the sctp scheme improved the throughput effectively
本文根據瓶頸帶寬、可用帶寬和btc （ bulktransfercapacity ）三類網路帶寬定義，分析了vps （ variablepacketsize ）和pptd （ packetpair / traindispersion ）瓶頸帶寬測試演算法， slops （ self - loadingperiodicstreams ）和topp （ trainsofpacketpairs ）可用帶寬測試演算法;基於子路徑瓶頸測試原理，設計了異構包對序列的瓶頸測試演算法;並結合三個子演算法（界定帶寬范圍演算法、接近帶寬值演算法和帶寬變化趨勢判定演算法） ，設計了自載流折半查找的可用帶寬測試演算法;把上面的演算法應用到sctp （ streamcontroltransmissionprotocal ）的多宿性和可用帶寬測試，提出了一個網路擁塞或故障時調整sctp傳輸路徑的方案;結合winsock和winpcap兩套網路開發工具，設計了一個瓶頸帶寬測試程序;通過ns2模擬實驗，驗證了基於異構包對序列瓶頸測試演算法的準確性、自載流折半查找演算法的快速性，和sctp改進方案的有效性。 -
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
該演算法以圖的節點?弧段結構結合深度優先搜索實現了自動游覽中最優路徑的檢索。 -
The algorithm, which uses the distance relation of the nodes in the traffic network, can search information of trips, between given od points and trips which intersect groups of respective adjacent points of od points, and can analyze, evaluate, and filter these information in the light of characteristic of carpool path so that the carpool formation is convenient for ride matching
該演算法利用交通路網中各結點間的距離關系，可以檢索給定起迄點間及起迄點各自鄰近結點群之間存在的出行信息，並能根據合乘出行路徑特點對檢索出的信息進行分析、評價和優選，以方便出行者進行合乘組織。 -
( 2 ) utilizing the shortest path algorithm in graph theory to search functional dimension chains automatically in the assembly model and ascertain the functional dimensions of the part
（ 2 ）運用圖論中的最短路徑搜索演算法從裝配模型中自動搜索出功能約束尺寸鏈，確定零件的功能尺寸。 -
Then a algorithm is applied for shortest path search
然後利用a ~ *演算法實現最短路徑搜索。 -
For video images with moving objects, an optimal stitching line was found by heuristic optimal path search algorithm in mosaics of images, and the images were smoothed by multi resolution theory after mosaics of images
對存在運動物體的視頻圖像，採用啟發式最優路徑搜索演算法尋找到圖像間拼接的最佳縫合線，並使用多解析度原理進行圖像拼接后的平滑處理。 -
This thesis introduces the background about this system and solving path at first ; then emphasises to describe ideas and implementation of clustering - algorithm ; furthermore expands on the characteristics and flows of each module ; analyses how to establish security policies ; finally summary full text, and suggest further works, otherwise, it also make point of personalizing hyperlinks and personalizing search - engines based on web data mining, making personalizing application more integrate
本文首先介紹了論文所提問題的背景和解決途徑；然後說明了本系統的概念定義和目標；重點介紹了系統中聚類演算法的思想和實現；進而詳細闡述了系統各個功能模塊的特徵和流程；分析了如何通過服務器日誌建立安全策略；最後進行了總結，並提出了下一步的工作。此外，論文提出了個性化引擎、個性化鏈接與web數據挖掘的結合，使個性化應用更加全面。 -
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 ）的服務模型? ?一組數據可能經過不同的路徑到達同一個目的地，同時數據包的順序可能會被打亂，而且不支持資源預留。 -
Another algorithm dba *, which represents the environment by dynamic binary trees and reduces the search range, is also proposed to optimize algorithm ba *. the simulation of soccer games shows time saving in real - time search and an optimal path planning. 4
在此基礎上，提出將二叉樹描述環境模型動態化，在搜索中隨著智能機器人的位置變化，動態地縮小廣東工業人學丁學博上學位論義其搜索范圍的osn 」 （動態一叉樹表示環境的srt 」演算法）演算法。 -
Implementation of search for map path based on a algorithm
演算法的地圖路徑搜索的實現 -
At last, we study on robot path planning for an approach to find out a perfect path in a certain map using a heuristic search algorithm
本文最後，還對移動機器人路徑規劃進行了研究，使用啟發式搜索演算法在給出的地圖信息空間中尋找理想的路徑。
分享友人