最優搜索 的英文怎麼說

中文拼音 [zuìyōusōusuǒ]
最優搜索 英文
optimal search
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 搜 : 動詞1. （尋找） collect; gather2. （搜查） search; ransack
  • 索 : Ⅰ名詞1 （大繩子; 大鏈子） a large rope 2 （姓氏） a surname Ⅱ動詞1 （搜尋; 尋找） search 2 （要; ...
  • 最優 : optimal; optimum最優策略 optimal policy; optimal strategy; 最優設計 optimum design; 最優值 optima...
  • 搜索 : 1 （仔細尋找） search for; ferret about; hunt for; scout around 2 [電子學] hunting; scan; [控] in...
  1. Ts can avoid circuit searching by using the flexible memory mechanism and respective tabu criteria. also according to aspiration criteria, ts can assoil some good solution status which have been tabued, in doing so it can ensure the diversification search and obtain the globe optimum

    Ts通過引入一個靈活的存儲結構和相應的禁忌準則來避免迂迴搜索，並通過藐視準則來赦免一些被禁忌的優良狀態，進而保證多樣化的有效探索以最終實現全局優化。
  2. By utilizing self - diagnosis method and diagnosis method based on dt, it become more convenience for fault orientation. considering about fuzzy relation between fault cause and symptom, commix fuzzy diagnosis module was set up by means of fuzzy synthesize judge

    將診斷樹應用於電噴發動機故障診斷專家系統可以優化搜索過程，實現對故障起因的最佳搜索。採用模糊綜合評判的方法進行模糊推理，有效地解決了故障原因與徵兆之間不確定性問題。
  3. 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最小生成樹演算法自動生成屏內安裝接線圖和端子接線圖。
  4. A rate - dependent damage evolution modified zwt nonlinear constitutive ralation is adopted, an object function of least square was established according to the experimental results. the searching space of each decision variable was foreordained with conventional optimizing method, and all parameters in zwt model for solidified pf resin were determined with generic algorithms

    基於實驗曲線構建了最小二乘形式的目標函數，並採用傳統優化方法輔助設計了各個決策變量的搜索空間，進而用遺傳演算法確定了損傷型zwt非線性粘彈性本構關系中的材料參數。
  5. Edm has some remarkable advantages over traditional models, includes using implicit causal models, self - learning capacity, weak dependence on domain knowledge, wide applicability, robustness, self - adaptability, and population - based searching, etc. tracing back its intrinsical ideas, edm is just making use of the nature ' s decision making strategy, natural selection, to solve the decision making problems faced by human or the intelligent agents

    進化決策主要利用了進化演算法與形式化計算模型相結合所具備的自動建模能力，它具有隱式因果模型、自學習、弱知識依賴、應用廣泛、穩健性、自適應和群體搜索等優勢。追根溯源，進化決策的基本思想正是利用大自然的決策機制（自然選擇）來解決客觀世界所提出的決策問題，而自然進化又是已知的能力最強的問題求解范型。
  6. The hybrid algorithm raises the convergence rate of the conjugate gradient method and solves the problem for which the convergence rate of the steepest descent method get slower when the isopleth of goal function is oblong

    這種混合優化演算法結合了共扼梯度法和最速下降法產生搜索方向，既提高了共扼梯度演算法的收斂速度，又解決了目標函數的等值線是扁長橢球時，最速下降法下降緩慢的問題，具有收斂速度快、收斂范圍大、適應面廣等特點。
  7. Search for optimal launch window for small celestial body exploration mission using genetic algorithm

    利用遺傳演算法搜索小天體探測最優發射機會
  8. Experiments are performed and results show : 1 the popular retrieval models the okapi s bm25 model and the smart s vector space model with length normalization do not perform well for document similarity search ; 2 the proposed model based on texttiling is effective and outperforms other models, including the cosine measure ; 3 the methods for the three components in the proposed model are validated to be appropriately employed

    我們通過實驗驗證了以下三點： 1 trec中的常用信息檢索模型不能很好地解決文檔相似搜索2我們提出的基於texttiling技術的模型是有效的，性能優于其他模型3我們提出的模型中所採用的方法是有效的，包括利用texttiling技術進行文本子主題分割，利用餘弦公式來計算文本塊之間的相似度，以及利用最優匹配方法來求解文檔之間的總體相似度。
  9. In particular, we give the method to compute the initial probability distribution of target ’ s location and the form of detection function. thus we formulate the original problem as an optimal search problem

    本文給出了對目標初始概率分佈函數和探測函數的具體形式，並且將三維模型檢索問題轉化為最優搜索問題。
  10. To find an efficient strategy for 3d model retrieval task, we refer to optimal search theory

    本文研究了利用最優搜索理論尋找有效的三維模型檢索方案。
  11. Optimal search theory is a theory of finding the " best " way to detect a pre - claimed object, usually called the " target "

    最優搜索理論是研究用最優的方法搜索預定目標的理論。
  12. Our system model is a simplified one which is convenient for simulation experiment. our research is the first one which use optimal search theory to optimize the resource retrieval system. we focused on the optimal mobile agent dispatching, the initial searching parameters dicision and updating mothods. we extended ns2 network simulator to support mobile agent simulation and did several experiments under this simulation

    本文首次將最優搜索理論用於資源檢索系統的優化，通過在系統中增加最優分派器進行移動agent的最優分派，重點研究了使用最優搜索理論進行系統優化的方法，並對最優搜索演算法的初始參數確定、動態參數更新以及具體實現做了深入研究，實現了一致最優演算法。
  13. We can use optimal search theory to solve this problem. optimal search theory is a subject developed during the world wide war ii. the optimal search problem involves computing how resources can be allocated so as to maximize the probability of detection, or to minimize the comsumption of resources used

    最優搜索理論是二戰期間發展起來的一門學科，最優搜索理論要解決的核心問題就是在總搜索資源有限的情況下，如何分配搜索資源使得成功搜索到目標的可能性最大或花費的搜索代價最小。
  14. In this paper ， an optimal search strategy by dividing the whole surveillance area into regions is presented so that the optimal search can be adaptively implemented in phased array radar. firstly ， the inherent relationship among average discovering time ， radar resources consumption ， search frame period and target distribution density is studied. secondly ， parameters for the region search are optimized to achieve the optimal search performance inside regions. then ， the optimal search frame period for each region is derived to minimize the average discovering time of targets ， where the constraint of radar time resource and the importance of each region are taken into account. finally ， the adaptability of this search strategy is discussed. only if the optimal parameters for each region are utilized and the beams are scheduled according to the optimal frame period under the radar time constraint ， the optimal distribution and the optimal scanning sequence of beams can be implemented adaptively. thus ， optimal search is adaptively implemented in the whole surveillance area

    本文提出一種分區搜索演算法，實現了相控陣雷達的自適應最優搜索.首先，研究了各區域平均發現一個目標消耗的雷達資源和目標被發現的平均時間同搜索幀周期以及目標強度的關系；然後，研究了在各區域採用兩步搜索演算法的最優參數設計，實現了局部區域的最優搜索；其次，在雷達時間資源有限和區域重要性加權的約束條件下，導出了使目標被發現的平均時間最小的區域最優幀周期；最後，討論了分區搜索演算法的自適應性.只要採用各區域的最優參數，按最優幀周期調度雷達波束，就可以自適應地實現使目標被發現的平均時間最短的波束的最優分佈和掃描順序，即自適應最優搜索
  15. Optimal search of three counterfeit coins problem

    三偽幣問題的最優搜索
  16. Our experimental results show that the optimal search strategy is efficient for information retrieval on structured database

    實驗結果表明我們的最優搜索策略在專用數據庫中能夠有效地完成檢索工作。
  17. The best search direction was decided by the new swarm which was built by the best individual of each chromosome

    通過搜索各種群中各染色體的最優個體，組成一個新的種群，並以此種群作為當前最優種群來確定量子門的全局最優搜索方向。
  18. We may categorize optimal search problems according to whether the space and time are discrete or continuous, and whether the target is stationary or mobile

    按照搜索空間是離散或者連續的，目標是靜止還是運動的，可以將最優搜索問題分成幾個不同的類型。
  19. However, the neural network easily falls into local minimum, and weakly search the overall situation. the genetic algorithm ( ga ) has the ability of searching overall situation. the genetic neural network recombines the genetic algorithm ’ s of seeking the superior overall situation and the neural network ’ s nonlinear characteristic and rapid convergence

    但神經網路具有易陷入局部極小值以及全局搜索能力弱等缺點;而遺傳演算法具有較好的全局最優搜索能力，遺傳神經網路將兩者結合，既保留了遺傳演算法的全局尋優的特點，又兼有神經網路的非線性特性和收斂的快速性。
  20. 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

    該演算法首先採用實值編碼遺傳演算法對優化問題進行全局最優搜索若干步，在此基礎上，採用一種專門設計的變搜索空間隨機搜索局部優化演算法加強對重點區域的搜索，以提高搜索效率和改善解的質量。此外，為了提高遺傳演算法的搜索效率，改進了一種自適應交叉概率和變異概率的計算方法。
分享友人
分享到 Line

分享到臉書