限制搜索 的英文怎麼說

中文拼音 [xiànzhìsōusuǒ]
限制搜索 英文
limiting search
  • : Ⅰ名詞(指定的范圍; 限度) limit; bounds Ⅱ動詞(指定范圍, 不許超過) set a limit; limit; restrict
  • : Ⅰ動詞1 (製造) make; manufacture 2 (擬訂; 規定) draw up; establish 3 (用強力約束; 限定; 管束...
  • : 動詞1. (尋找) collect; gather2. (搜查) search; ransack
  • : Ⅰ名詞1 (大繩子; 大鏈子) a large rope 2 (姓氏) a surname Ⅱ動詞1 (搜尋; 尋找) search 2 (要; ...
  • 限制 : place [impose] restrictions on [to]; astrict; restrict; limit; confine; shut down on [upon]: 限制...
  • 搜索 : 1 (仔細尋找) search for; ferret about; hunt for; scout around 2 [電子學] hunting; scan; [控] in...
  1. 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

    在對優化的具體實現過程中,由於進化規劃著眼于整個整體的進化,對于所求解的優化問題無可微性要求,採用隨機技術,能以較大的概率求解全局最優解的特點,針對電壓無功控模型是一個多、多目標、非線性、離散的優化控問題,因此應用進化規劃演算法進行模型的求解。
  2. Allows you to limit the search scope to include only symbols

    允許將范圍為僅包含符號。
  3. This paper presents an efficient optimization algorithm and complicated code for airciraft landing scheduling problem, based on depth - first - search implicit emumeration algorithm, subject to mps limiting, position lock limiting and optimization depth limiting

    摘要以深度優先的隱枚舉演算法為基礎,結合mps約束、位置凍結、優化深度,使用復雜的軟體編碼實現了特定於飛機著陸調度問題的優化排序演算法。
  4. Search tree, which is restricted by search depth, is the traditional algorithm in dealing with game

    摘要解決博弈問題的傳統演算法樹法所無法克服的對深度的
  5. Optimal periodic control with the lowest operational cost by limiting total substrate discharge mass was studied. through adding new state variable and using supplement functions, the problem with restriction conditions was converted into nonrestriction problem. in addition, the dynamic searching method of optimal step coefficient was developed to modify the conventional gradient method, consequently the calculation problem of the multivariable optimal periodic control was able to be resolved better. it was found that the operational costs of optimal control under various initial states are distinctly different. a new concept of optimal control under optimal initial state was presented. it is pointed out emphatically that to the treatment system without optimal control condition, the suboptimal control with extensive practical value can be realized according to the results of optima control

    著重研究了在有機物排放總量時,使其運行費用最低的最優周期控問題.通過增加新的狀態變量和用補償函數法,將本課題的有約束條件問題化為無約束條件問題,並提出了最優步長參數的動態法來修改傳統的梯度法,從而較完善地解決了多變量最優周期控的計算問題.研究中還發現了不同初始條件下最優控所需要的運行費用也大不相同,進而提出了最優初始狀態下最優周期控的新概念,這對保證出水質量的同時進一步降低污水處理成本來說具有更重要的意義.本文還強調指出:對于尚不具備實現最優控條件的處理系統,可根據最優控的研究結果實現具有廣泛實用價值的準最優控
  6. Abstract : in this paper, we propose an improved lagrangian relaxation algorithm to solve job - shop scheduling problems. besides the addition of augmented objective, we expand the search scope of near - optimal solutions and improve the computational efficiency greatly by restricting the solution scope of sub - problems and modifying the search method of dual problem. at the same time, we develop a genetic algorithm combining with the lr ( lagrangian relaxation ) method. using the numerous useful solutions we get in the lagrangian relaxation as the original genes, we can improve the solution further. test results show that these methods achieve satisfied outcome for job - shop problems. they can also be applyed to other programming problems with constraints

    文摘:針對車間調度問題,提出了一種改進的拉氏鬆弛演算法.在增加輔助目標函數的基礎上,通過對子問題的策略的改變,使拉氏演算法的計算量減少,近優解的能力有很大改善.本文還提出了一種基因優化演算法,充分利用拉氏演算法得到的多個近優解,進一步優化結果.模擬結果表明對車間調度問題得到了較好的結果.本方法也可用於其它有約束的規劃問題
  7. You can search the xml column for the target zip code and restrict the returned result set accordingly

    ,可以從xml列中目標郵政編碼,並相應地返回的結果集。
  8. Today, most internet users limit their searches to the web, so we ' ll limit this article to search engines that focus on the contents of web pages

    現在,大量的網路用戶了他們在網路上的尋(大多數的網路用戶把他們的對象集中到了網頁的上) ,因此我們也將焦點轉移到網頁。
  9. Because of limited memory resource in spce061a, the whole section ’ s dtw algorithm is simplified to segment dtw algorithm. the segment dtw algorithm reduces the memory spending for the matching paths. in addition, early termination technique is adopted, thus the calculating amounts are greatly reduced

    根據spce061a的存儲資源,將全段dtw匹配簡化為分段dtw匹配,從而減少了對路徑的存儲開銷;另外在匹配過程中採用早期終止策略,即在匹配過程中,一旦部分累積失真距離超過判決閾值,立即終止匹配,拒絕該說話人,從而減少了計算量。
  10. In chapter 3, by minimizing a quadratic model restricting next search direction to a subset of span { - g _ ( k ), d _ ( k - 1 ) }, we propose other formula of parameter ~ ( * ) k convergences of the new method and its hybrid formula are proved under monotone line search. their numerical results show that they are efficient

    在第三章中,通過最小化一個下次方向在span { - g _ k , d _ ( k - 1 ) }子集上的二次模型,我們提出了_ k ~ *取新形式或其雜交形式的共軛梯度法是有效的。
  11. Quadrants sensor based on silicon are now widely used in many fields, such as laser collimation, homing, tracking and searching devices, precision measurement et al

    基於硅光電傳感的象傳感器廣泛應用於激光的瞄準、導、跟蹤,裝置,精密測量,如激光微定位、位移監控、精密機床的光電控等領域。
  12. You can further restrict the information returned by a search using filters

    可以使用篩選器進一步限制搜索所返回的信息。
  13. With filtering, you can restrict your search to include only those topics or articles that include example code or samples

    使用篩選可以限制搜索,僅包括那些包含示例代碼或示例的主題或文章。
  14. A search argument sarg limits a search because it specifies an exact match, a range of values, or a conjunction of two or more items joined by and

    參數( sarg )可指定精確匹配、值的范圍或由and聯接的兩項或多項的連接,因此能夠限制搜索范圍。
  15. An index is potentially useful if its first column or prefix set of columns are used in the sarg, and the sarg establishes a lower bound, upper bound, or both, to limit the search

    如果在sarg中使用引的第一列或預先指定的一組列,且sarg指定了限制搜索范圍的下、上或同時執行了這兩者,則引很可能是有用的。
  16. Though simulating the state of packing, adopting the experience of manual packing and heuristics knowledge to control the searching way and limit the search space, it changes the packing problem into the problem of searching best path in the state space

    文中對多邊形的合成技術進行了研究,通過模擬布局狀態,吸取人工布局的經驗,採用啟發式知識控方向,限制搜索空間,把布局問題轉化為在狀態空間下尋找最優路徑的問題。
  17. Due to the data transmission characteristics between tags and reader, space division multiple access ( sdma ), frequency division multiple access ( fdma ) and code division multiple access ( cdma ) are applied in a limited way in rfid system. therefore, time division multiple ( tdma ) has been generally accepted. according to tdma, there are aloha protocol, s - aloha, binary - tree protocol, clipped binary - tree protocol and others

    解決這個問題必須要用到多路存取法,針對射頻識別系統中閱讀器與應答器之間的通信特點,空分多路法、頻分多路法、碼分多路法在rfid系統中應用都受到一定的,只能應用到一些特定的場合,一般採用時分多路法,按照時分多路法的演算法有aloha演算法、時隙aloha演算法、二進樹型演算法、修剪枝的二進樹型演算法等防碰撞演算法協議,分析了各自特點以及存在的缺點。
  18. According to the rule of similar condition restriction classifying, event table is divided into several condition event tables, the approach overcomes the lack of slow in searching because of searching all the events when each event is scanned

    按具有相似條件事件歸類的規則,把事件表分成若干個條件事件表,避免了每次事件掃描都要遍歷所有事件導致速度慢的缺陷。
  19. You can restrict the hex search to a specified alignment, which is useful when you re searching for a reference to an address

    可以將十六進在特定的序列中,在檢地址引用時這一點很方便。
  20. The focus movies that dusters have been scanning using the virtual microscope ( vm ) during this past first phase of stardust @ home are highly compressed because of bandwidth limitations

    由於帶寬的塵者們在過去的第一階段中使用vm的是高度壓縮過的圖。
分享友人