搜索時間 的英文怎麼說

中文拼音 [sōusuǒshíjiān]
搜索時間 英文
search time
  • 搜 : 動詞1. （尋找） collect; gather2. （搜查） search; ransack
  • 索 : Ⅰ名詞1 （大繩子; 大鏈子） a large rope 2 （姓氏） a surname Ⅱ動詞1 （搜尋; 尋找） search 2 （要; ...
  • 時 : shí］Ⅰ名1 （比較長的一段時間）time; times; days:當時at that time; in those days; 古時 ancient tim...
  • 間 : 間Ⅰ名詞1 （中間） between; among 2 （一定的空間或時間里） with a definite time or space 3 （一間...
  • 搜索 : 1 （仔細尋找） search for; ferret about; hunt for; scout around 2 [電子學] hunting; scan; [控] in...
  • 時間 : time; hour; 北京時間十九點整19 hours beijing time; 上課時間school hours; 時間與空間 time and spac...
  1. 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演算法能有效的減小模糊值搜索空間，提高整周模糊值解算的速度和實時性；整周模糊值確定后，需要對整周模糊值的可靠性進行分析，本文提出的比率檢測演算法能有效的減少整周模糊值錯誤確定后整周模糊值二次解算所需要的時間；為了進一步減少整周模糊值解算所需的歷元數目，本文提出把基線長度先驗信息作為觀測量進行卡爾曼濾波輔助整周模糊值求解。
  2. 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

    在求解網路故障后重構問題時，互動式模糊遺傳演算法通過循環執行相同的、極其簡單的選擇、雜交和變異三種遺傳操作，並在適應度函數值的引導下在搜索空間進行自適應概率性全局搜索，直至獲得全局最優解。
  3. Auto scan at user defined intervals

    自動搜索功能可定義每次搜索時間
  4. However, i have a feeling that adding this would considerably increase database size, and therefore search time

    然而，我認為這樣做會大幅增加數據庫的大小和搜索時間。
  5. On the basis of analyzing the disadvantages of ant colony algorithm ( as ), max - min ant colony algorithm ( mmas ) is proposed to solve vrp

    摘要蟻群演算法能很好地解決車輛路徑問題，但演算法搜索時間長，易出現停滯現象。
  6. Then the time penalty can be largely diminished during all the searching procedure. however, the micro - ga just reaches the near - optimal region, not the precise solution

    採用小種群遺傳演算法，搜索時間明顯縮短，但是只能找到最優解的區域，而不能精確定位。
  7. A method of transforming a search key into an address for the purpose of storing and retrieving items or data. the method is often designed to minimize the search time

    為存儲和檢索數據項或數據，把搜索關鍵字轉換為一個地址的一種方法。該方法常用於減少搜索時間。
  8. Owing to the high density, mass capacity, and fast data transfer rate, the holographic data storage ( hds ) technology has become one of the potential new types of information storage technologies

    體全息存儲技術以其存儲密度高、存儲容量大，數據傳輸速率高、數據搜索時間短等優勢成為一種頗具潛力新型信息存儲技術。
  9. The ability to store multiple holograms within a small volume of a storage material and to retrieve data pages with thousands of bits in parallel provides an attractive combination of high density and fast speed

    體全息存儲是一種適合高密度數據存儲的光學存儲技術，它同時具有存儲密度高、數據傳輸率高、數據搜索時間短等優勢。
  10. This thesis is the project supported by shaanxi national science foundation ( no. 2002e224 ), jiangxi national science foundation ( no. 0311018 ) and testing technology, and control engineering in nanchang institute of aeronautical technology ( no. 2003

    該方法是一個逐步篩選、由粗到精、智能擴張的過程，只有滿足前面的條件才進行後面的判斷，可較大地減少搜索時間和空間，提高識別效率。
  11. The overall effects of two typical web page visual design modes ( rich and plain ) and two language systems ( chinese and english ) on world wide web user visual search performances in 3 variables ( searching time, errors and satisfaction ) were studied

    摘要考察兩種典型網頁視覺設計形式（豐富與簡練）及兩種語言系統（中文與英語）對用戶視覺搜索能力在搜索時間、錯誤及滿意度三個變量上的綜合性影響。
  12. The algorithm can effectively o vercome immature convergence phenomenon in simple genetic algorithm ( sga ). it can improve not only antibody ' s similarity but also its diversity. and it can avoid local optimal solution and shorten searching time

    該演算法可以有效地克服基本遺傳演算法的未成熟收斂現象，既可以提高抗體的相似性又可以兼顧到抗體的多樣性，為避免演算法陷入局部最優解，縮短搜索時間提供了保證。
  13. Then, the minimum - time trajectory planning ( mttp ) for single manipulator is investigated. mttp with dynamic model constrains is presented in detail. then a algorithm of dynamic searching time - optimal trajectory based on phase - plane techniques is proposed and simulated

    其次，研究了沿指定路徑單臂最優時間軌跡規劃，先詳細介紹考慮動力學模型的最小時間軌跡精確解法，然後提出了一種基於相平面動態搜索時間近似最優軌跡的方法，並將該演算法進行了模擬實驗。
  14. In the inference processing, the paper employs from - top - to - bottom method to provide the heuristic information for producing alternate step, and it reduce the blindness and search space of playing go game and is helpful for raising the speed of computation. it can adapt programs to time - restricted games and shorten waiting time of the opponent. 5

    在推理機的推理過程中，採用一種自上而下的過程，為產生候選棋步提供了一種啟發式的信息，減少了走棋的盲目性和搜索空間，有助於提高計算的速度，這對于程序適應有時限的比賽，縮短對手的等待時間，是有意義的。
  15. The searching space of frequent temporal sequence patterns could be reduced and the efficiency of association rule mining could be improved by projecting frequent items in time windows to prefix projected accumulation trees

    將時間窗口內頻繁項的信息映射到前綴映射累加樹中，以降低頻繁時序模式的搜索空間，提高時序關聯規則的挖掘效率。
  16. The mutual excitation between the local stimuli satisfying the rules of curve distribution ( position and orientation continuity ) called curve self - excitation is a useful method to discover and enhance curves and to inhibit noise. the present approaches used parallel connection structure division which did not acquire satifactory effect. this paper presents the idea of random time division and dynamic self - excitation, for different curves performing random time - division searches, time coincidence filtering, and self excitation accumulation. the principle is given

    利用空間分佈滿足曲線規則（位置和定向連續性）的局部刺激之間的相互激勵，稱為曲線自激，這是發現視覺邊界曲線和抑制局部噪聲的有效手段.過去的工作均採用并行結構區分的計算方式，曲線自激並沒有達到滿意的效果.本文提出隨機時分動態自激的計算方案，對不同的曲線實施隨機時分的搜索、時間一致性濾波、和自激積累等機制.本文給出了實現的原理方案
  17. The thesis develops new techniques on the basis of the relating documents - - construct of reduced 2 - d indexed layered guide star database. the database is a uniform storage reduced guide star database with improved 2 - d index it divides guide stars to local bright star ( lbs ) and local dim star ( lds ), and gives priority to lbs in making star triangle to reduce the number of stored triangles. it uses 2 - d na index and linear storage to improve the hit the target rate, save the memory for index

    精簡二維索引分層導航星庫，作為一種統一存儲的精簡、索引導航星庫，採用星的分層方法精簡導航星庫，以局域亮星為主構造導航星三角形，減少了星三角形的數量，節約了存儲空間；採用索引方法檢索導航星三角形，提高了命中效率，節約了搜索時間；採用n劃分和線性存儲的方法精簡索引，提高了二維索引的存儲效率；採用索引的邊緣擴充方法，可以在一定程度上減少位置誤差的影響。
  18. After analyzing typical text information extraction inductive algorithms based on wrapper model, making use of the important features of the pages, such as annotations and text pattern features, an inductive algorithm is proposed using wrapper model for information extraction. the new algorithm can add the annotations to the state sets of rule ’ s finite state machine, so it can effectively reduce the time spending on search, and can also accurately locate the target information ; the learned text pattern can be used to filter out the un - interrelated extracted information

    在分析了基於包裝器模型的文本信息抽取典型歸納學習演算法的基礎上，利用頁面的一些重要特性，例如注釋和文本模式信息，提出了一種新的歸納學習演算法，新演算法將注釋信息加入到抽取規則的有限狀態機的狀態序列中，從而能有效地降低演算法搜索時間，並能對目標信息進行充分的定位;並且新演算法能用學習到的文本模式信息對抽取結果進行必要的過濾。
  19. Computing result shows that : coevolutionary mdo algorithms are effective on this problem ; distributed coevolutionary mdo algorithm is better than cooperate coevolutionary mdo algorithm ; asynchronous parallel version of distributed coevolutionary mdo algorithm speeds up the optimization procedure greatly while maintains good convergence performance ; multiobjective distributed coevolutionary mdo algorithm approximates the whole pareto optimal front well in only one single run, saves much computing cost than constraint method to obtain pareto optimal set, and greatly shortens search time by distributed asyn

    計算結果表明：協同進化mdo演算法求解該問題是有效的，其中分散式協同進化mdo演算法優于合作協同進化mdo演算法；異步并行的分散式協同進化mdo演算法在保證收斂性能的同時大大加快了優化進程；多目標的分散式協同進化mdo演算法僅一次運行就很好的逼近了問題的整個pareto最優前沿，比用約束法求解pareto最優集節省了大量計算開銷，而且通過網路多臺微機的分散式并行執行大大縮短了搜索時間。
  20. Because of communities divided by category tree, when users wants to search some commodity, he only needs to send his search requests to special community, which reduces the search range, improves search effect and decreases the search time

    本文提出一種基於分類樹的搜索演算法，基於分類樹所劃分的社區，用戶要查詢相應的商品的時候，只要到特定的社區中進行搜索就可以，減少了搜索的范圍，提高了搜索的命中率，縮短了搜索時間。
分享友人
分享到 Line

分享到臉書