implicit parallelism 中文意思是什麼
implicit parallelism
解釋
隱含并行性- implicit : adj. 1. 含蓄的，不講明的。2. 內含的，隱含的 （opp. explicit）。3. 絕對的，盲目的。adv. -ly
- parallelism : n. 1. 平行。2. 相同，類似；比較；對應。3. 【哲學】心身平行論。4. 【生、數】平行現象，平行性。5. 【修辭學】對應法，對聯。
-
Ga poses implicit parallelism and is suitable for implementation on large scale parallel computers. dividing the whole population into sub - populations and coarse - grained island model of exchanging information among sub - populations are the most direct parallel method
Gas具有天然的并行性，非常適合於在大規模并行計算機上實現，把串列gas中的單一群體分成多個子群體，各子群體之間相互交換信息的粗粒度并行是將gas并行化的最直接方式。 -
Genetic algorithm is a random searching method which simulates natural selection and evolution. this method has some advantages that other usual methods do n ' t have because of its two characters - - - - - - implicit parallelism and global searching
遺傳演算法是模仿自然選擇與進化的隨機搜索方法，由於其隱含并行性和全局搜索特性，使其具有其他常規優化演算法無法擁有的優點。 -
And because of its independence, global optimization and implicit parallelism, ga is developed and applied by more and more people
由於其具有不依賴于問題模型的特性、全局最優性、隱含并行性等特點，正越來越激起人們研究與應用的興趣。 -
Ga is a computational models of the human evolution, with implicit parallelism and capacity of using effectively global information
遺傳演算法（ ga ）是一種通過模擬自然進化過程搜索最優解的方法，其顯著特點是隱含并行性和對全局信息的有效利用能力。 -
The paper discusses the basic theory of genetic algorithms including schemate theorem, building block hypothesis, implicit parallelism, the analysis of astringency and so on, as the theoretical base of application
在對遺傳演算法的闡述中，討論了遺傳演算法的基本原理，包括模式定理、積木塊假設、隱含并行性和遺傳演算法的收斂性分析等，作為後面遺傳演算法應用的理論依據。 -
Genetic algorithms are search algorithms based on the mechanics of natural selection and natural genetics. it is widely used in many kinds of fields because of its less - dependency of optimization problem, simplicity, robustness and implicit parallelism
遺傳演算法是模擬遺傳學和自然選擇機理構造的一種搜索演算法，因其對優化問題的弱依賴性、求解的簡單性和魯棒性、隱含并行性等特點被廣泛應用於當前的各個領域。 -
Genetic algorithm is an fresh subject in recent years, it is a search algorithm based on the mechanics of natural selection and natural genetics. it is widely used in many kinds of fields because of its less - dependency of optimization problem, simplicity robustness and implicit parallelism
遺傳演算法是近年來新興的一門學科，是模擬遺傳學和自然選擇機理構造的一種搜索演算法，因其對優化問題的弱依賴性、求解的非線性和魯棒性、隱含并行性等特點被廣泛應用於當前的各個領域。 -
Implicit parallelism and convergence are analyzed. in chapter 3, improvements on ga are investigated
第三章提出了對遺傳演算法的改進，是本文理論演算法研究的重要部分。 -
As one of global optimal algorithm, and because of its simply application, global optimization and implicit parallelism. in recent years genetic algorithms have been used in the field of scheduling more and more generally
它作為一種新的全局優化搜索演算法，以其實現簡單、通用、魯棒性強、適于并行處理等顯著特點，廣泛應用各種優化問題。 -
Aiming at the implicit parallelism of ga and the characteristic of dps system, we study the parallelization of the former two algorithms. the basic idea is to put forward an agents - based model of parallel coalition formation algorithm on the basis of coarse - grained parallel genetic algorithm
由於遺傳演算法的隱并行性以及dps系統的特性，我們在文中對上述兩種演算法的并行化做了研究，基本的思想是在粗粒度并行遺傳演算法模型的基礎上提出一種基於agents的并行聯盟形成演算法模型。
分享友人