最大概率搜索 的英文怎麼說
中文拼音 [zuìdàgàilǜsōusuǒ]
最大概率搜索
英文
maximum probability search- 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
- 概 : Ⅰ名詞1 （大略） general outline 2 （神氣） manner of carrying and conducting oneself; deportment ...
- 率 : 率名詞（比值） rate; ratio; proportion
- 搜 : 動詞1. （尋找） collect; gather2. （搜查） search; ransack
- 索 : Ⅰ名詞1 （大繩子; 大鏈子） a large rope 2 （姓氏） a surname Ⅱ動詞1 （搜尋; 尋找） search 2 （要; ...
- 概率 : [數學] probability; chance概率論 probability theory; theory of chances; 概率曲線 probability curv...
- 搜索 : 1 （仔細尋找） search for; ferret about; hunt for; scout around 2 [電子學] hunting; scan; [控] in...
-
Aimed at multiple - limit, multiple - object, non - linear, discrete of voltage / var optimization and control, on account of whole evolution of evolutionary programming, no demand for differentiability of optimal function, and random search, it can obtain global optimum with mayor probability, this paper solve optimal function with evolutionary programming
在對優化的具體實現過程中，由於進化規劃著眼于整個整體的進化，對于所求解的優化問題無可微性要求，採用隨機搜索技術，能以較大的概率求解全局最優解的特點，針對電壓無功控制模型是一個多限制、多目標、非線性、離散的優化控制問題，因此應用進化規劃演算法進行模型的求解。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
因為遺傳演算法具有全局隨機搜索能力，魯棒性強、使用簡單和廣泛的特點，它不採用路徑搜索，而採用概率搜索，不用關心問題本身的內在規律，能夠在復雜的、多峰值的、不可微的大矢量空間中迅速有效地尋找到全局最優解，所以可以彌補神經網路學習演算法的不足，使陷入局部最小值的可能性大大減少，使得收斂速度提高，訓練量減小。In this case, we derive the optimal strategy with which the task could succeed with the highest detection probability
在這種情況下，我們希望有一種搜索方案使找到目標的探測概率最大。Chaotic optimization method searches optima by means of regularity, ergodicity and intrinsic stochastic properties of chaotic motion and can find out global optimum in great probability
摘要混沌優化方法利用混沌運動的隨機性、規律性、遍歷性尋優，能以較大的概率搜索到全局最優點。The reason why we integrate them is that k - means algorithm is a mountain climbing method, which is easy convergent to local extremum, and sensitive to the original condition, but its convergent speed is relatively fast, and that genetic algorithm is a random searching method, which can find the whole extremum in a rather big probability, and non - sensitive to the original condition, but its convergent speed relatively slow
之所以將：二者結合在一起，是回為k一均值演算法是一種爬山法，容易收斂到岡部極小值，對初始條件較敏感，但收斂速度較快，而遺傳演算法是卞dl隨機搜索演算法，能夠以較大概率找到全局最憂解，且對們始條件個敏感，但收斂速度較慢。In system design, we present dispatcher tactics of member search engine that user fond of. these member search engines on the basis of mobile agent, which provide an environment for parallel processing, take full advantage of ontology which expands the requirement of users to the semantic words set and provide the document analyzer that can filter the web pagers returned by the search mobile agent according to the certain algorithm. consequently wiirs presents the most relevant documents to the user
為提高系統的性能和易用性，還給出了基於用戶偏好的成員搜索引擎的調度策略，在成員搜索引擎系統結構中，不僅利用本四川大學碩士學位論文體論中概念規范、語義豐富的特點，將用戶的檢索要求擴充成語義集，並且將檢索到的文檔通過文檔分析器進一步過濾，最終得到與用戶檢索要求內容匹配度較高的文檔，而且提供了一個并行處理的環境來顯著提高搜索效率。Edges of the image are detected out firstly, labeled according to the motion that they obey then and the areas of the frame between edges are divided into regions. at last, using the bayesian framework presented determines the most likely region labeling and depth ordering with the labeled edges
首先使用經典的canny運算元檢測出一幀圖像的邊緣，然後對其進行運動估計、邊緣和區域標定，再應用最大后驗概率的貝葉斯方法搜索出不同區域的極大似然分割，給出不同運動層的相對深度標定。Meanwhile, it locates the maximum rotating angle probability in the matching of disks in order to optimize the range of the searched block and save on the matching of time
同時，對圓盤匹配中最大旋轉角度進行了概率上的最優定位，優化了搜索塊的范圍，縮短了塊的匹配時間。分享友人