窮舉搜索 的英文怎麼說

中文拼音 [qióngjǔsōusuǒ]
窮舉搜索 英文
exhaustion search
  • 窮 : Ⅰ形容詞（貧窮） poor; poverty stricken Ⅱ名詞1 （窮盡） limit; end 2 （姓氏） a surname Ⅲ副詞1 （...
  • 搜 : 動詞1. （尋找） collect; gather2. （搜查） search; ransack
  • 索 : Ⅰ名詞1 （大繩子; 大鏈子） a large rope 2 （姓氏） a surname Ⅱ動詞1 （搜尋; 尋找） search 2 （要; ...
  • 搜索 : 1 （仔細尋找） search for; ferret about; hunt for; scout around 2 [電子學] hunting; scan; [控] in...
  1. And an exhaust - search sample - driven algorithm, signal compatible algorithm which can find monad patterns, was proposed, and the search algorithm was depth - limit algorithm

    在此基礎上，針對單一模式發現問題，文提出並實現了一種窮舉搜索的模式發現演算法? ?信號相容性演算法（ signalcompatiblealgorithm ， sca ） 。
  2. A process whereby up to every possible value is tried until a match is found also known as an exhaustive search

    嘗試每個可能的值直到找到匹配值為止的過程（又稱為窮舉搜索） 。
  3. The common methods include exhaustive method, member - limited method and so on. but the efficiency of these methods is very low ; even these methods cannot find feasible solution in some cases

    常用的搜索策略有：窮舉法、成員數目受限演算法等等，但是這些演算法都存在效率低下的缺點，在某種情況下甚至找不到可行解。
  4. For the exhaustion algorithm calculating quantity being excessive in the correlation match algorithm, the method of correlation match search using the genetic algorithms is proposed

    針對相關匹配演算法中的窮舉演算法計算量過大的缺點，提出利用遺傳演算法進行相關匹配搜索。
  5. Our new technique avoids the space blow up of bdds, and extends the concept of bounded model checking

    由於模型檢測技術是基於對狀態空間的窮舉搜索，狀態爆炸問題是模型檢測技術面臨的主要困難。
  6. One way to compromise data encrypted with this type of cipher is to perform an exhaustive search of every possible key

    可以危及用此類型密碼加密的數據的一個方法是，對每個可能的密鑰執行窮舉搜索。
  7. If it takes three months to perform an exhaustive search to retrieve data that is only meaningful for a few days, then the exhaustive search method is impractical

    如果執行徹底搜索來檢索只在幾天內有意義的數據需要花費三個月的時間，那麼窮舉搜索的方法是不實用的。
  8. Traveling salesman problem is combinatorial optimization problem in graph theory, it has npc computation complexity, and lots of problem can transfer to traveling salesman problem. the computation of tsp is analyzed, then the hopfield network method for solving tsp is given, at last we solve 10 - citys traveling salesman problem and chinese traveling salesman problem by using chaos neural network modeling

    首先分析了旅行商問題在窮舉搜索法下的工作量；其次給出了求解旅行商問題的hopfield神經網路方法，同時分析了利用人工神經網路求解旅行商問題所存在的問題；最後利用混飩神經網路模型求解10城市旅行商問題和中國旅行商問題。
  9. Compared with exhausitive search algorithm, the search amout is remarkable reduced by this algorithm and the algorithm is very efficiency. with the searched perfect binary array pairs and quasi - perfect binary array pairs, new perfect binary array pairs of high dimension and volume can be constructed by all kinds of construct methods

    通過與窮舉搜索演算法的比較，本演算法大大減少了搜索數量，具有較高的效率。利用搜索得到的最佳二進陣列偶和準最佳二進陣列偶，可以用各種構造方法構造出新的高維和高階的最佳二進陣列偶。
  10. 6 ruanaidh j, pun t. rotation, scale, and translation invariant digital image watermarking. signal processing, 1998, 66 : 303 - 317. 7 lin c, wu m, bloom j, cox i, miller m, lui y. rotation, scale, and translation resilient watermarking for images

    本文提出了一種數字圖像水印中的新技術，其特點是：在圖像數字水印的檢測中具有較強的識別能力避免了計算逆的對數極坐標仿射ilpm ，保證了嵌入數字水印后圖像的質量同時也避免了窮舉的搜索，減少了計算時間和誤檢率。
分享友人
分享到 Line

分享到臉書