search space 中文意思是什麼
search space
解釋
檢索空間-
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演算法能有效的減小模糊值搜索空間，提高整周模糊值解算的速度和實時性；整周模糊值確定后，需要對整周模糊值的可靠性進行分析，本文提出的比率檢測演算法能有效的減少整周模糊值錯誤確定后整周模糊值二次解算所需要的時間；為了進一步減少整周模糊值解算所需的歷元數目，本文提出把基線長度先驗信息作為觀測量進行卡爾曼濾波輔助整周模糊值求解。 -
This interactive capability, combined with the artificial intelligence software technology, delivers the results that significantly differentiates accoona in the search space
Accoona人工智慧軟體可以理解搜索請求的意思，通過使用此軟體，用戶可以得到更多的結果。 -
Easy messages break on the first walk through the search space
簡單的加密信息在一個小的搜索空間里也能很容易得到破解。 -
M4 : middle ring at a, 10 walks through the search space
M4方式：在搜索空間（查找空間）中從含有「 a 」的中間環節開始進行密鑰測試。 -
Several shortcuts that reduce the search space can be found in the paper
此外，論文還介紹了幾種可用於縮小搜索空間（查找空間）的捷徑。 -
Some messages require many more walks through the search space before a break occurs
一些信息需要在破解之前進行若干多次搜索空間的尋的過程。 -
This method can be used not only for search space of left - deep but also for hybrid search spaces
該方法不僅可用於左深度樹搜索空間，同樣適用於混合搜索空間。 -
For tq we research fault parallel, search - space parallel and circuit parallel tg approaches
在tg方面，本文深入研究了基於故障分解、搜索空間分解和電路劃分三種并行tg方法。 -
Secondly, we utilize fault sensitization mode partitioning to develop a search - space parallel tg algorithm
然後，提出了一個新的基於故障敏化模式分解的搜索空間并行tg演算法。 -
The split of search space can be described as a virtue binary search tree and the info - search process is similar to the search in the binary tree
在此基礎上，信息的搜索就可描述為二進制搜索樹的查找過程。 -
6 we present the query optimization method. for the clustered time series database, the query sequence is classified to one of the cluster, and the efficiency of querying is improved for the similarity search space is limited in the cluster, . 7 we implement a client / server query system and test the presented methods
根據序列數據庫的聚類結果，將序列數據庫劃分為若干層次的簇結構，通過對查詢序列進行k最鄰近分類，確定查詢序列所屬的簇，然後在相應的簇中執行相似性查詢，實驗結果表』明，基於簇的查詢顯著提高了查詢效率。 -
Viberbi beam search algorithm based on dynamic programming has become increasingly popular in csr, with which knowledge sources can be efficiently organized to constrain search space and different pruning strategies can be easily combined
為了有效地組織各種知識源，約束搜索空間，基於動態規劃思想的viterbibeam搜索演算法成為目前連續語音識別主要採用的方法。 -
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
該演算法首先將連續對象定義域平均分成許多邊緣相互重疊的小區域，區域的稠密程度決定了演算法解的精度，每個區域賦予一定的信息素值;螞蟻根據狀態轉移規則在隨機生成的可行解與利用微粒群演算法得出的可行解之間選擇下一步要去的位置;引入局部尋優策略，加強近似最優解鄰域內的局部搜索，提高搜索速度和精度。 -
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
在推理機的推理過程中，採用一種自上而下的過程，為產生候選棋步提供了一種啟發式的信息，減少了走棋的盲目性和搜索空間，有助於提高計算的速度，這對于程序適應有時限的比賽，縮短對手的等待時間，是有意義的。 -
How to reduce the search space by adding constraints for eliminating symmetries is also discussed. the experiments show the effectiveness of the new algorithm and the constraints added
另一項研究工作是關于如何在轉換法中利用folms問題所具有的同構現象，通過添加約束從而減少轉換所得的sat問題的搜索空間。 -
The results of simulation show that the hierarchical optimization functions have stronger deceptive so that the algorithms be pendulous among local optimizations. however the evolutionary mechanism based - on graph models being discussed displays its favorable characteristic of intelligent optimizing, such as to overcome deceptive and explore inherent laws on search space. ( 5 ) a method for designing a model framework of situation awareness for ucays based on object - oriented bayesian networks is presented
模擬結果表明，本文所研究的層次化函數確實具有迷惑性，引導演算法在峰值之間飄忽不定，但即使如此，本文提出的基於圖形模型的智能優化機制依然表現出具有克服問題欺騙性，可探索問題內在規律和智能尋優的良好特性。 -
Qga combining the genetic algorithm and the quantum information theory has a large search space with small population and a good global search capability, while image sparse decomposition based on mp is an optimal problem, so it can be fast solved by qga
量子遺傳演算法能用較小的種群規模實現較大的空間搜索，全局尋優能力強，基於匹配追蹤的圖像稀疏分解是最優化問題，因此可用量子遺傳演算法快速實現。 -
According to the basic idea of p - grid, peers exchange their information and split the search space when they meet each other. at last, each peer is only responsible for an interval of the whole search space and ma kes responses to the query requests for the data in this interval
根據p - grid基本思想，節點間每次相遇就交換雙方的信息，對搜索空間不斷進行分割，使每個節點負責管理某一區間上數據信息並負責響應針對這些數據的查詢請求，最終搜索空間的劃分狀態在邏輯上可以用一棵二進制搜索樹表示。 -
A novel method of content - based image segmentation using deformable template matching is proposed. a two - dimensional ( 2 - d ) deformable template based on orthogonal curves is built by pre - computing extensions of the deformable template along orthogonal curves and sampling the curves uniformly. then the definitions of internal and external energy functions are given according to the image segmentation problem, and genetic algorithm is used to obtain globally optimal solutions. the proposed method uses a lower - dimensional search space than conventional methods and reduces the sensitivity of the algorithm to initial placement of the template. experiments on real - world images and in simulations at low signal - to - noise ratio show the robustness and good performance of the method
本文提出一種採用可變形模板匹配技術進行基於內容的圖像分割演算法.通過預先計算出可變形模板沿著變形的正交曲線，並對模板曲線及正交曲線進行離散抽樣，建立一基於正交曲線的二維（ 2 - d ）可變形模板，針對圖像分割問題定義控制可變形模板進行變形的內、外部能量函數，本文採用遺傳演算法搜索能量函數最小的全局最優解.該新演算法比傳統的可變形模板匹配方法降低了搜索空間的維數，減少了演算法對模板初始位置的敏感.對實際圖像及模擬低信噪比圖像處理的結果表明，新演算法具有良好的分割精度及穩定性 -
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
文中對多邊形的合成技術進行了研究，通過模擬布局狀態，吸取人工布局的經驗，採用啟發式知識控制搜索方向，限制搜索空間，把布局問題轉化為在狀態空間下尋找最優路徑的問題。
分享友人