parallel search 中文意思是什麼
parallel search
解釋
并行檢索并行查找-
This paper not only extends the reusing area of apia - java components, but also availably attempts to search parallel ( concurrent ) program with par method
本文的研究不僅擴展了apla - java部件庫的重用范圍，也是探索par方法進行并行（並發）程序設計的有益嘗試。 -
We analyze the principle of pollard rho - method and parallel collision search method using graph theory and algebra, and obtain important principle of directing the design of algorithms directed by this principle, we redesign the two algorithms, and achieve more efficient effect
用代數和圖論的方法深入分析了pollard演算法和并行碰撞演算法的原理，獲得了指導演算法設計的重要原則，在這個原則的指導下，重新設計這兩個演算法，取得了更好的計算效果。 2 -
Shared - memory multiprocessor systems. one is a recently - proposed parallel randomized best - first minimax search ( prbfm ) algorithm in a chess - playing program, and the other is the latest version of crafty, a state - of - the - art alpha - beta - based chess - playing program whose older sequential version is known as a typical game program in spec2000
演算法一是最近新出的parallelrandomizedbest - firstminimaxsearch （ prbfm ） ，演算法二是著名的開源棋類游戲crafty採用的dynamictreesplitting演算法，其早期的單線程版本是spec2000benchmark測試cpu整數性能的程序之一。 -
Because the hybrid acquisition scheme ( combines parallel search with serial search ) based on the correlator provides the flexibility in the trade - off between the mean acquisition time and system complexity and is easy to implement, it ? focus on the scheme here. on the other hand, this paper analyzes the effect of multiple access inference ( mai ) on the code acquisition performance for the multipath fading channels
基於相關器解擴的串-並混合方案由於有著可在平均捕獲時間和電路復雜程度（這是捕獲電路的兩個重要指標）這兩個技術指標間靈活折衷的優點和易於實現的特點，本文的重點就放在該方案中。 -
Game - tree search plays an important role in the field of artificial intelligence. in this paper we characterize and compare two parallel game - tree search workloads in chess on two intel xeon
游戲樹搜索（ game - treesearch ）一直以來在人工智慧領域扮演著極其重要的角色，并行游戲樹搜索更是該領域的熱點研究問題。 -
Topics covered include : sorting ; search trees, heaps, and hashing ; divide - and - conquer ; dynamic programming ; amortized analysis ; graph algorithms ; shortest paths ; network flow ; computational geometry ; number - theoretic algorithms ; polynomial and matrix calculations ; caching ; and parallel computing
課程主題包含了：排序、搜尋樹、堆積及雜湊；各個擊破法、動態規劃、攤提分析、圖論演演算法、最短路徑、網路流量、計算幾何、數論演演算法；多項式及矩陣的運算；快取及平行計算。 -
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 method of the retrieval strategies of parallel search is used in the searches mechanism of the fault case
在故障案例的檢索機制中，採用一種并行搜索的檢索策略的方法。 -
The proposed genetic - tabu algorithms, which are based on the parallel search main flame provided by genetic algorithms, integrating biology evolution of genetic algorithms and local search of tabu search which can avoid circuit search, can solve global optimization problems quickly
本文提出的遺傳禁忌搜索演算法基於遺傳演算法提供的并行搜索主框架，結合遺傳群體進化和禁忌搜索演算法較強的具有避免迂迴搜索能力的鄰域搜索，可以實現快速全局優化。 -
A genetic local search algorithm for the parallel machine batch process scheduling problem
并行機間歇過程生產調度的遺傳局部搜索演算法 -
In this paper we present three new methods of image manipulation including linear parallel search method for region labeling, statistical peaking method for object - size ascertainment and characteristic - points matching method for object recognizing
針對核孔膜顯微圖像自動識別的具體問題，本文創新地提出線性并行區域標記方法、對象尺寸統計峰值方法和特徵點匹配識別方法。 -
Research and practice of parallel retrieval balanced auto - adapted mechanism in search engine
搜索引擎中并行檢索均衡自適應機制的研究與實踐 -
This means that according to memorial frequency information the tabu length and the number of candidates are adaptively adjusted, and multitask parallel technology is realized through the arrangement of the search assignment
將自適應機制和并行技術引入禁忌搜索演算法中，根據記憶頻率信息自適應調整禁忌長度與候選集規模，通過搜索任務並分配安排形成多任務并行處理。 -
In this dissertation, the series program structure of wheel / rail system dynamics is analyzed to search the solutions to parallel processing
本論文對輪軌系統動力學的原有串列程序結構進行了剖析，以尋求并行處理的可行方法。 -
Parallel - search memory
並尋記憶器 -
Parallel search storage
並尋儲存器 -
Genetic algorithm ( ga ) is a randomized parallel search algorithm that model natural selection, the process of evolution. ga has been widely used in engineering problems
遺傳演算法是一種模擬生物自然選擇、進化過程的隨機、并行搜索演算法，該演算法廣泛應用於解決工程技術問題。 -
The parallel search computing method based on the case has many kinds, the parallel fuzzy inference method is introduced in the paper. the nearest neighbor approach is studied in the third chapter. and as to similarity assessment of numerical features is difficult, an assessment method of similarity between numerical features is built on the basis of fuzzy dissertation
在案例間相似度的計算方法中，本文介紹了最鄰近匹配函數演算法，針對最鄰近匹配中定量特徵的相似度評估難的問題，建立了一種基於模糊劃分的定量特徵相似度評估方式。 -
Genetic algorithm is a widely concerned global search algorithm, which has good parallel search ability for having pioneered the implementation of methods that exploit the idea of combining solutions, while tabu search has pioneered the systematic exploration of memory functions in search processes, having good local search ability because of its flexible memory mechanism and respective tabu criteria to avoid circuit search
遺傳演算法是一種受到廣泛關注的全局優化演算法，開創了在解空間中從多出發點搜索問題最優解的先河，具有很強的并行搜索能力，而禁忌搜索演算法是在搜索過程中使用記憶功能的先驅者，以其靈活的存儲結構和相應的禁忌準則來避免迂迴搜索，具有較強的局部搜索能力。
分享友人