搜索求解 的英文怎麼說

中文拼音 [sōusuǒqiújiě]
搜索求解 英文
search finding
  • 搜 : 動詞1. （尋找） collect; gather2. （搜查） search; ransack
  • 索 : Ⅰ名詞1 （大繩子; 大鏈子） a large rope 2 （姓氏） a surname Ⅱ動詞1 （搜尋; 尋找） search 2 （要; ...
  • 求 : Ⅰ動詞1 （請求; 要求） ask; beg; request; entreat; beseech : 求人幫忙 ask sb a favour; ask a favou...
  • 解 : 解動詞（解送） send under guard
  • 搜索 : 1 （仔細尋找） search for; ferret about; hunt for; scout around 2 [電子學] hunting; scan; [控] in...
  1. Chaos algorithm of nonlinear bilevel programming problems

    利用混沌搜索求解二層非線性規劃問題
  2. A tabu search algorithm for the capacitated open vehicle routing problem is proposed

    提出了一種用於求解帶裝載能力約束的開放式車輛路徑問題的禁忌搜索演算法。
  3. Crossover tabu search for traveling salesman problem

    一種求解旅行商問題的交叉禁忌搜索
  4. 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

    進化決策主要利用了進化演算法與形式化計算模型相結合所具備的自動建模能力，它具有隱式因果模型、自學習、弱知識依賴、應用廣泛、穩健性、自適應和群體搜索等優勢。追根溯源，進化決策的基本思想正是利用大自然的決策機制（自然選擇）來解決客觀世界所提出的決策問題，而自然進化又是已知的能力最強的問題求解范型。
  5. 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技術進行文本子主題分割，利用餘弦公式來計算文本塊之間的相似度，以及利用最優匹配方法來求解文檔之間的總體相似度。
  6. The experiment results of multiuser detection problem show that both of the proposed methods not only have simpler algorithm structure, but also perform better than conventional qea and bpso in terms of ability of global optimum

    通過對多用戶檢測問題的求解表明，新的演算法不僅操作更簡單，而且全局搜索能力有了顯著的提高。
  7. Heuristics algorithm for knapsack problem based on the tabu search

    基於禁忌搜索的啟發式求解背包問題演算法
  8. In this paper, we present a system method aims at the key technique that needs solved in dimensional chain calculation, and made a in - depth research in auto search of dimensional chain graph, auto create of functional equations, calculation of functional equations etc. by the utilization of activex technique provided by cad and dll provided by mathematica we exploited tech - word computer aided dimensional chain calculation software

    本文針對尺寸鏈計算中需要解決的幾個關鍵技術，提出了復雜尺寸鏈計算的系統方法，就尺寸鏈圖自動搜索、尺寸鏈方程自動生成、功能方程的計算機求解等問題進行了深入的研究。並利用cad軟體的activex技術和專業計算軟體mathematica提供的動態連接庫技術完成了計算機輔助尺寸鏈計算軟體的構造，開發的軟體已成功應用於設計過程中。
  9. The traditional dht - p2p system has its limitations. it can only perform single keyword search and cannot understand the meanings of users requests

    傳統的dht - p2p系統有一定的局限性，如基於單特徵詞搜索，計算機不理解用戶搜索請求的含義等。
  10. 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

    在對優化的具體實現過程中，由於進化規劃著眼于整個整體的進化，對于所求解的優化問題無可微性要求，採用隨機搜索技術，能以較大的概率求解全局最優解的特點，針對電壓無功控制模型是一個多限制、多目標、非線性、離散的優化控制問題，因此應用進化規劃演算法進行模型的求解。
  11. Z - tranformation augmented fasf algorithm proposed in the dissertation can reduce the search space of integer ambiguity effectively, improve the effiency and real - time processing ability of integer ambiguity resolution ; it is essential to analyse the reliability of integer ambiguity after it was fixed, the ratio test algorithm proposed in the dissertation can reduce the time to fix new integer ambiguity after wrong fixes are detected ; to reduce further the number of epochs required for ambiguity resolution, that the baseline length constraint information which acts as observables is used to do kalman filtering to speed up ambiguity resolution is proposed

    本文提出的z變換增強fasf演算法能有效的減小模糊值搜索空間，提高整周模糊值解算的速度和實時性；整周模糊值確定后，需要對整周模糊值的可靠性進行分析，本文提出的比率檢測演算法能有效的減少整周模糊值錯誤確定后整周模糊值二次解算所需要的時間；為了進一步減少整周模糊值解算所需的歷元數目，本文提出把基線長度先驗信息作為觀測量進行卡爾曼濾波輔助整周模糊值求解。
  12. It is applicable to various structural distribution networks. while resolving the " large area restoration ", the genetic algorithm execute three same and simple genetic operators : selection, crossing and mutating. it make a self - adaptable and probability overall searching under the leading of fitness value in the whole searching scale until acquiring the best result

    在求解網路故障后重構問題時，互動式模糊遺傳演算法通過循環執行相同的、極其簡單的選擇、雜交和變異三種遺傳操作，並在適應度函數值的引導下在搜索空間進行自適應概率性全局搜索，直至獲得全局最優解。
  13. As existing approaches for computer aided conceptual design hardly take into consideration the consistency of input and output energy objects in their detailed features during the synthesis process, a heuristic approach for conceptual design of energy transforming systems was proposed based on the gene model of energy - transforming systems and the knowledge of the shortest paths between different physical objects

    摘要針對目前的概念設計方法在考慮多種能量對象細節特徵匹配性方面的不足，以能量轉換產品基因模型為基礎，提出了一種基於相異物理量間最短路徑知識的啟發式搜索求解模型。
  14. We show that under the consideration of discounted factor, jobs in the p - maximal initial set / * of module m should be processed prior to other jobs in module m, and the schedule is the optimal if the jobs in i * are n ' t be preempted by the jobs in n i *. this result is a extension of lawler ' s method for minimizing total weighted completion time with a series - parallel precedence

    證明了在考慮折扣因子的條件下，模塊m的因子最大初始集合i中的任務優先於模塊m中的其他任務，並且被連續加工所得的排序為最優排序：該結果推廣了lawler用來求解約束為串並有向圖的單機加權總完工時間問題的由底向上搜索分解樹的方法。
  15. To solve the problem of large search solution computation, an improved optimization algorithm is proposed based on the thought of advance - retreat method, and it raises the solution efficiency significantly

    為解決搜索求解計算量大的問題，進一步結合進退法提出了一種改進的優化演算法，顯著提高了求解效率。
  16. Because the design of state space of the combinatorial problem is much easier than design of the searching algorithm, the present of the general searching algorithm is the apparent progress for the searching technology

    因為組合問題的狀態空間表示比原來的搜索求解容易的多，通用搜索演算法的提出是搜索技術的一個明顯的進步。
  17. Searching of the state space is always being one of the usual ways for solving the optimal problems. the traditional ways of finding solutions only have backtracking, branch - and - bound and implicit graphs search as their theoretical introduction

    狀態空間搜索是解決優化問題的常用方法之一，傳統的狀態空間搜索求解技術有回溯法和分支限界法以及隱式圖搜索這些演算法策略作為理論指導。
  18. In chapter 4, mathematical theory about related coefficient and fitting of straighten anti - curve line is introduced at the beginning of this chapter, then how to program to calculate related coefficient is introduced including discussing the appearance of straighten anti - curve line in bitmap, searching the ends of straighten anti - curve line, calculating the angle bitmap should be turned, calculating related coefficient after bitmap has been turned

    第4章首先介紹了有關相關系數以及直線擬合的數學理論，然後闡述了求解逆直線相關系數的編程思路，其中包括對逆直線在位圖中擺放方式的分類討論、逆直線端點的搜索、求解旋轉角度、旋轉后求解相關系數等幾個環節。
  19. This result have unified the traditional explicit graph searching and implicit graph search, partial searching for one solution and complete searching for all solutions into a same model and some algorithms

    這一結果將傳統的顯式圖搜索與隱式圖搜索，求一個解的局部搜索與求全體解的遍歷搜索，全部統一到同一個模型和若干演算法中去。
  20. In ga, which uses multiple - point search instead of single - point search and works with the coded structure of variables instead of the variables themselves, the only information required for searching its solution is the objective function and it makes the method simple and powerful in solving the mixed - integer nonlinear optimization problems

    遺傳演算法的基本原則是適者生存。它採用多路徑而非單路徑搜索，在解的編碼上進行遺傳操作而非直接對解本身，從而只需要目標函數就能進行問題求解，使得它在混合整數非線性優化問題的求解上顯得簡單而強大。
分享友人
分享到 Line

分享到臉書