random search 中文意思是什麼
random search
解釋
隨機搜索-
In accordance with the problem that the fcm algorithm is quite time - consuming for search out cluster cancroids and may not be suitable for on - line modeling and control. this dissertation proposed an improved fuzzy identification method based multistage random sampling fuzzy c - means clustering algorithm ( mrfcm ). it has higher approximate precision and the cpu time has slowed down sharply compared with the common fuzzy
Johnyen和liangwang介紹了幾種應用於模糊模型的信息優化準則，本論文在此基礎上對統計信息準則進行一些改進，並與快速模糊聚類和正交最小二乘方法結合，提高了模型的辨識精度和泛化能力。 -
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
因為遺傳演算法具有全局隨機搜索能力，魯棒性強、使用簡單和廣泛的特點，它不採用路徑搜索，而採用概率搜索，不用關心問題本身的內在規律，能夠在復雜的、多峰值的、不可微的大矢量空間中迅速有效地尋找到全局最優解，所以可以彌補神經網路學習演算法的不足，使陷入局部最小值的可能性大大減少，使得收斂速度提高，訓練量減小。 -
I guess she meant what she said. they ' re just doing a random search
我猜她說話算話，他們只是在做一項抽查而已。 -
On the subtrees of random binary search trees
隨機二叉搜索樹的子樹 -
It is only to supply the spinning mode of fool design ， it can store 200 fool technics and can search or transfer in random
該工藝僅為提供傻瓜式的紡紗方式，該工藝可存貯傻瓜工藝，並可隨意查詢與調用200個具體的方法。 -
Based on the comparing analysis and character of clustering algorithm the simulated annealing （ sa ） algorithms was applied to the data clustering. simulated annealing （ sa ） algorithms are random search techniques based on physical annealing process, which can prevent the optimizing process into local optimization and get the global optimization
演算法以優化過程的求解與物理退火過程的相似性為基礎，通過接受準則和對下降溫度的控制，能夠有效的克服優化過程陷入局部極小從而獲得全局最優解。 -
To overcome this difficulty, a newly proposed random search algorithm particle swarm optimization was applied to a global optimization method for the wastewater treatment network design
因此，提出了應用新型隨機型演算法粒子群優化演算法求解上述復雜非線性最優化問題。 -
A genetic algorithm ( ga ) based on building block recognition was proposed, in which building block candidates were recognized in evolving process to speed up the search so as to avoid the blindness of ga random searching
摘要提出了一種基於積木塊識別的遺傳演算法，該演算法通過對進化過程中的候選積木塊進行識別與利用來加速搜索，從而避免遺傳演算法隨機搜索的盲目性。 -
The research for key techniques of turbo codes is processed. it includes, ? the design of optimal component codes and the performance of asymmetric turbo codes are analyzed ; ? a search algorithm for short random interleaver based on the distance spectrum and ids criteria is carried out and simplified ; ? random puncturing method to improve the weight distribution of turbo codes with some special code rates is analyzed and simulated. ? the effect of different schemes of trellis termination to the performance of turbo codes is analyzed ; ? a new low complexity decoder structure is provided ; 5
對turbo碼的部分關鍵問題進行分析和改進，主要包括： ?分析了最優分量碼的設計和非對稱turbo碼的性能； ?設計了基於距離譜和ids的短隨機交織器搜索演算法並進行了簡化； ?提出了採用隨機刪余方式改善特定高碼率turbo碼重量分佈特性的方法； ?分析了不同編碼器狀態歸零方案對turbo碼性能的影響； ?提出了一種降低實現復雜性的turbo迭代譯碼器結構。 -
This paper will deeply and systemically analyze the effect of random error on the location accuracy of the artillery target - search and gun - pointing adjustment radar by using simulation method, present an approach to increase the location accuracy
本文以模擬模擬的方法深入系統地分析了隨機誤差對炮位偵察校射雷達定位精度的影響，並提出了提高定位精度的途徑。 -
A new, random optimization and search method ? gentic algorithm ( ga ) was introduced. its theory and specialty were offered. in this paper, ga was combined with the neural network to control the objects with delay. by choosing a proper form, the results are satisfactory
介紹現在正被逐漸廣泛應用的新型的、隨機性的全局優化方法? ?遺傳演算法，闡明它的基本方法、基本理論、特點，並將其與神經網路相結合，用於控制有純滯后的對象，根據問題選擇合適的具體實現形式，獲得良好效果 -
It seemed to be a genuine meeting of minds, old and new the analogue organisers of the world ' s information handing it on to a digital successor responsible for organising 8 billion web pages according to random search requests
這似乎是新老觀念的一次真正匯合：模擬格式世界信息的管理者，將這些信息傳遞給他們的數字繼任，由其按照任意搜索請求對80億張網頁進行整理。 -
In the algorithm, a real - coded genetic algorithm ( rga ) is firstly adopted to globally search for the optimal solution to the optimization problem for some steps, and then a specially designed local optimization algorithm named modifiable search space random search algorithm is adopted to intensify the search for the optimal solution in the local region determined by the rga so as to improve the search efficiency and the solution quality
該演算法首先採用實值編碼遺傳演算法對優化問題進行全局最優搜索若干步，在此基礎上，採用一種專門設計的變搜索空間隨機搜索局部優化演算法加強對重點區域的搜索，以提高搜索效率和改善解的質量。此外，為了提高遺傳演算法的搜索效率，改進了一種自適應交叉概率和變異概率的計算方法。 -
By comparing these two methods, we show the advantages of quasi - monte carlo method. we also introduce the standard monte carlo random search for optimization. the last but not least application is metropolis algorithms which is the origin of monte carlo method
第1章介紹了蒙特卡羅和擬蒙特卡羅積分的誤差估計並闡述了擬蒙特卡羅方法的優勢，同時介紹了擬蒙特卡羅的標準優化方法，最後介紹了蒙特卡羅方法的起源? metropolis模擬方法。 -
We introduce the design and realization of two - sub system, and propose a new algorithm named automatic image edge extraction and segmentation by random seed region search algorithm in chapter four
第4章介紹了精液子系統的設計和實現，就其靜態和動態圖像的分析處理給出了詳細的步驟和方法，並且給出了一種新型的基於任意種子的自動圖像分割和邊緣提取演算法。 -
Traditional optimization techniques search for the best solutions using gradients or random searching
傳統的最優化技術大多是基於梯度尋優技術或隨機搜索的方法。 -
Because the search procedure will be adjusted according to the previous result, the method not only speeds up the random search but also balances the global and local demands ( adaptive equalization )
因為在搜索過程中會根據搜索中間結果進行調整，所以此方法不僅可以加快搜索速度，而且可以平衡全局和局部搜索需求。 -
Genetic algorithm is a highly collateral, random, self - adaptive, general and globe search algorithm, which simulates biologic evolution process. in this paper, genetic algorithm is applied to optimizing the model optimum in what is evaluated by projection pursuit algorithm
採用遺傳演算法對于投影尋蹤方法在評價過程中涉及到的模型優化問題進行優化，遺傳演算法是模擬生物「優勝劣汰」進化過程而形成的一種高度并行、隨機和自適應的通用性全局搜索演算法，能夠處理非線性較強的優化問題。 -
By now, there have been a lot of methods to locate resources, such as flooding, random walk, and search on basis of distributed hash table
目前有很多資源定位方法，如泛洪，隨機漫步，基於分散式哈希表的查找等。
分享友人