近似搜索 的英文怎麼說

中文拼音 [jìnsìsōusuǒ]
近似搜索 英文
proximity search
  • 近 : Ⅰ形容詞1 （空間或時間距離短） near; close 2 （接近） approaching; approximately; close to 3 （親...
  • 搜 : 動詞1. （尋找） collect; gather2. （搜查） search; ransack
  • 索 : Ⅰ名詞1 （大繩子; 大鏈子） a large rope 2 （姓氏） a surname Ⅱ動詞1 （搜尋; 尋找） search 2 （要; ...
  • 近似 : approximate; similar; approach; approximation; roughness; propinquity
  • 搜索 : 1 （仔細尋找） search for; ferret about; hunt for; scout around 2 [電子學] hunting; scan; [控] in...
  1. Experimental results show that the proposed method can reduce the computational complexity significantly compared with the full search method, and maintain similar decode visual quality and coding bit rate, then improve the ray - space data coding efficiency

    實驗結果表明，與全搜索方法相比，該方法計算復雜度明顯降低，同時保持了近似的解碼圖像質量和編碼碼率，進一步提高光線空間數據的編碼效率。
  2. Bell system technical, 1970, 49 : 291 - 307. 10 wu f, huberman b a. finding communities in linear time : a physics approach. eur

    本質上， dm演算法是一種啟發式的貪心優化演算法，它採用局部搜索方法能逐步逼近地為預先定義的目標函數找到一個近似最優解。
  3. According to the geometrical characteristic of the arch dam shape, and based on the parameter design language of ansys software ( apdl ), the subp method and the stochastic search method are adopted together to optimize design of hyperbolic arch dam with variable thicknesses of the circle

    摘要根據拱壩體形的幾何特徵，基於ansys軟體的參數化設計語言（ apdl ） ，將零階近似方法和隨機搜索法結合起來對單圓心變厚度雙曲拱壩進行了優化設計。
  4. For the purpose of discovering the near - globally optimal solution, this paper proposed a hybrid approach of ant colony algorithm and sequential quadratic programming ( sqp )

    摘要為了獲得整體近似最優解，提出採用蟻群演算法，搜索發電機可運行狀態的最優組合，並對蟻群演算法的數學模型進行分析，以參數的形式給出具有普遍意義的收斂性定理。
  5. General method of similar sequence mining based on time series is to transform time series into discrete character series and cluster them into different sets, then compute the euclidean distance between querying series and these sets to measure their similarity

    摘要時間序列數據庫中相似子序列的搜索，常用滑動窗口、分形插值逼近等方法將時間序列分割成各子序列，線性擬合各分段子序列，計算查詢序列與各子序列的歐氏距離，滿足距離閾值條件的為相似子序列。
  6. Concerned the discrete area of the steel shape, a method is presented : searching the best solution of continual variable first by criteria, and next searching optimal solution by the direct - searching method of mixed variable on the original point of the continual result

    慮到型鋼截面的離散化，本文對多層輕鋼框架結構優化提出一種近似的處理方法，即先用準則法求得連續變量最優點，然後將其結果作為混合變量直接搜索法的初始點進行第二步優化。
  7. The search space is divided into many small areas, and each area is given a certain pheromone value. according to the state transition rules, the artificial ants move to the next solution which is generated randomly or calculated by particle swarm optimization. local search strategy is also added into psaco so that the search speed and precision is enhanced

    該演算法首先將連續對象定義域平均分成許多邊緣相互重疊的小區域，區域的稠密程度決定了演算法解的精度，每個區域賦予一定的信息素值;螞蟻根據狀態轉移規則在隨機生成的可行解與利用微粒群演算法得出的可行解之間選擇下一步要去的位置;引入局部尋優策略，加強近似最優解鄰域內的局部搜索，提高搜索速度和精度。
  8. 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

    其次，研究了沿指定路徑單臂最優時間軌跡規劃，先詳細介紹考慮動力學模型的最小時間軌跡精確解法，然後提出了一種基於相平面動態搜索時間近似最優軌跡的方法，並將該演算法進行了模擬實驗。
  9. Traditional search engines are based on information retrieval technologies. they implement operations such as boolean queries, proximity searches, text relevance and link analysis

    自己簡單翻譯一下：傳統的搜索引擎是基於信息檢索技術。他們執行諸如布爾查詢的操作，近似搜索，正文關聯和連接分析。
  10. A multisensor convex linear statistic fusion modal for optimal interval estimation fusion is established. a gauss - seidel iteration computation method for searching for the fusion weights is suggested. in particular, we suggest convex combination minimum variance fusion that reduces huge computation of fusion and yield approximately optimal estimate performance generally, moreover, may achievers exactly optimal performance in some cases

    建立了一種最優區間估計融合模型? ?多傳感器凸線性組合，並給出搜索最優權系數的gauess - seidel迭代演算法，另外，給出了一種近似的區間估計融合? ?凸線性組合的最小方差融合，它能減少大量的計算量。
  11. This thesis suggests a process considered minimizes the population size as similar individuals occur in the fitter members of the population, which helps reduce the execution times for ga by removing the redundancy associated with the saturation effect found in the later generation. this thesis uses a method that adds dynamic penalty terms to the fitness function according to the optimal degree of solutions, so as to create a gradient toward a feasible suboptimal or even optimal solutions. on the basis of the difference of the biggest and the smallest of fitness of individual, modifying the fitness function in order to convergence is a satisfaction

    動態調節種群大小，去掉遺傳演算法在迭代後期搜索產生的過多相似個體，達到減少計算時間的目的；按照解的優劣程度給適應度函數增加一個在ga搜索過程中動態改變的可變罰函數，給搜索最優解創造一個梯度，使遺傳演算法收斂到可行的較優解或最優解；根據適應度值最大和最小個體的差修正適應度函數，使適應度函數值適中不容易造成收斂太快、局部收斂或根本不收斂而變成隨機搜索；為了避免「近親繁殖」採用競爭擇優的交叉操作；利用并行遺傳演算法的思想，提出一種自適應多子種群進化策略；提出人口汰新政策來解決類似甚至相同的個體的情況發生。
  12. A new heuristic search method is devised for maximum likelihood method, which first constructs a starting tree, and then through branch swapping searches for trees best resembling the present optimal tree and locates a better tree. repeat this process, till no more better trees are generated or the upper iteration limit is arrived and the program ends

    對最大似然法，改進了一種新的啟發式搜索:隨機建立一棵初始樹，然後通過查看與當前最優樹拓撲最近的樹，從中尋找更優樹，不斷地更新當前最優樹，直到無法找到更優樹或者達到了搜索次數的上限，演算法停止。
  13. Phrase and proximity searches are not currently performed, but they would not be difficult to implement

    短語和近似搜索現在並未實行，但實施並不困難。
  14. Furthermore, a new dfd method was put forward. the method estimated the focused field through analyzing three images at different lens positions and then found best imaging position within the field in small steps

    同時，本文提出一種逐漸逼近的離焦深度法，先通過少量對焦位置不同的圖像計算出近似準焦位置，再用小步長在其附近搜索最佳位置。
  15. Path planning is searching a optimal path without touch from the start to the end under way a performance indicators

    路徑規劃是按照某一性能指標搜索一條從起始狀態到目標狀態的最優或近似最優的無碰路徑。
  16. Based on tabu search, a local search technique with changeable local structure ( algorithm 2 ) is proposed for this np - hard problem, which provides an approach to control the optimizing process flexibly

    基於tabu搜索設計了變鄰域結構的局部搜索技術，提供了靈活控制尋優過程的途徑;全多項式時間復雜性近似策略的開發，使得0一1背包問題的求解成為了n戶c問題近似演算法設計中最為成功的範例。
  17. The main idea of this hybrid algorithm is : at first, all candidates in task collection is lined according to a dispatching rule ( earliest due date, edd ), then this linear queue is divided into some tiers under a criterion that partial order is not allowed to exist in the every tier, many feasible sequences is generated by constructing a neighborhood of a initial sequence in every tier, the allocation of the resources over time is conducted to perform every feasible task sequence, and a set of approximate optimal scheduling schemes is achieved as the precondition of the next tier ’ s disposal in meeting multiple scheduling objectives to obtain the global near - optimal schedule which makes these program run tier by tier until the last task is completed

    該演算法按照最早完工時間優先（ ect ）分派規則，先將參加排序的工序合併成一個串列序列，然後按照同層內不存在偏序關系的原則，將其分解為若干個時間上相互銜接的層次，在每個層次內部，通過構造鄰域產生出多個可行序列，對每個可行序列進行設備配置，採用鄰域搜索演算法進行方案的尋優，保留一組滿足評價要求的可行方案作為下一層設備配置的背景環境，通過層層遞進最終獲取全局的近似最優解。
  18. A selection method of serm factorizations for linear transforms is presented. it is discovered that the near optimal results are almost everywhere and when the factorization error is small, the closer the permutation matrices, the closer the results. according this fact, a local search is proposed that based near optimal factorization method which can obtain the near optimal results. moreover, this method convergence very fast, can usually obtain useful results by very limited iterations. it is tested lossless image coding with the selection results and good results is obtained

    通過大量的實驗，發現serm分解的近似最優結果是大量存在的，而且這些近似最優結果的分佈是分散的，當分解結果的誤差度量比較小時的時候，有當置換矩陣相近時，分解結果的誤差也相近的實驗事實。基於此觀察結果，給出了基於局部搜索的serm分解的近似最優分解方法，可以得到非常接近最優分解的結果。
  19. At first, it uses the nsga - ii for obtaining the approximate pareto optimization solutions. then, local search is run with previous each solution to find a better solution using the mode search algorithm

    該演算法首先利用nsga -演算法得到近似的pareto最優解；然後以增廣的加權tchebycheff方程作為評價函數，採用模式搜索法對由nsga -演算法得到的每個解再進行局部優化。
  20. After the compensation based on the rule of the minimum entropy, the resolution of the cross - range image is lower as the large size and non - uniform rotation, which cause the image to be not right at all sometimes. in order to eliminate effect of the non - stationary rotation, the first order approximation and relax algorithm are adopted to search the initial frequency, amplitude, frequency modulation rate and obtain the dynamic image of the target at any time

    分析了低分辯雷達的成像演算法，建立在最小熵補償基礎上的演算法得到的橫向像的解析度仍然比較低，尤其對大的目標和機動目標，為此我們採取了一階近似的relax演算法搜索目標的初始頻率、幅度、解調率從而獲得目標的動態一維像，模擬數據和試驗結果證明該方法是有效的。
分享友人
分享到 Line

分享到臉書