efficient parallel algorithm 中文意思是什麼
efficient parallel algorithm
解釋
有效并行演算法-
Considering the characters of bp neural network, such as the simple structure, the advisable malleability, self - fitness, self - studying, nonlinear function approximating, the considerable abilities of parallel computing, fault - tolerant and so on, the bp algorithm have been extensively applied to the areas of system modeling, pattern recognition and seismic exploration since 1986. compared with other algorithms, as the above reasons, the bp algorithm has become the most usual and efficient solutions to the artificial neural networks
由於人工神經網路中的bp神經網路結構簡單，可塑性強，具有良好的自適應、自學習、極強的非線性逼近、大規模并行處理和容錯能力等特點，自1986年rumelhart等人提出以來，被廣泛應用於系統建模、模式識別、地震勘探等重要領域。而bp演算法數學意義明確，步驟分明，是神經網路中最為常用、最有效、最活躍的一種方法。 -
Abstract : a new algorithm applied to the fixed channel assignment in the cellular pattern is proposed. it is based on the theory of evolutionary algorithm. it uses the concept of multiple reuse plan ( mrp ) and solve the problem of large scale through blocking algorithm, and it is a fast 、 efficient and parallel searching method. it has been used in frequency plan system of beijing university of posts and telecommunications. it has been used in several plan project for some city, and been adopted because of its good performance
文摘:提出了一種新的用於蜂窩移動通信中小區規劃的固定頻率分配演算法.它基於遺傳演算法的基本理論，運用多層頻率復用的概念和分塊演算法解決了大規模區域的頻率規劃問題，是一種快速、高效的并行式搜索的頻率分配演算法.該演算法已用於北京郵電大學的頻率規劃軟體系統中，並用它為幾個市區作過規劃，效果滿足要求，且已被采納 -
Abstract : an efficient parallel global router using random optimization that is independent of net ordering is roposed. parallel approaches are described and strategies guaranteeing the routing quality are discussed. the wire length model is implemented on multiprocessor, which enables the algorithm to approach feasibility of large - scale problems. timing - driven model on multiprocessor and wire length model on distributed processors are also presented. the parallel algorithm greatly reduces the run - time of routing. the experimental results show good speedups with no degradation of the routing quality
文摘:設計實現了一個高效的線長模式下基於多處理機的并行總體布線器.通過對非時延驅動模式下串、并行演算法的總運行時間和求解時間的比較，表明該并行演算法能夠在保證求解質量無明顯變化的前提下大大加快總體布線演算法的求解速度.同時，也提出了基於分散式體系結構的并行總體布線演算法 -
Thirdly, we study an efficient parallel routing table computation algorithm, we describe xipeng ' s parallel routing table computation algorithm with formal method, and improve the dividing algorithm of area. the automatic finding and maintenance can be completed in the division
對xipeng提出的并行路由表計算方法進行了形式化的描述，對其發現和維護warr演算法進行了改進，實現了路由表計算過程中自動發現及維護warr的功能。 -
Considering the potential parallelism of the image data, we developed the parallel algorithm. several critical techniques have been proposed to obtain a high performance combining the characters of smp clusters. in the end, we simulate our algorithm on pc clusters, from both theory analysis and experiment results, it is shown that our algorithms can provided an efficient way for image restoration applications
Wmf演算法主要是基於這樣一種思想，對于含噪圖像上受損的任一點，其鄰域中的像素對它的恢復過程中的貢獻是不同的，如果這一點的灰度值越接近該區域內的中值，則其貢獻相應的大一些，反之相應的小一些。 -
3 kogge p, stone h. a parallel algorithm for the efficient solution of a general class of recurrence relations
這三部分中，進位傳播模塊是決定整個加法器性能的關鍵部分。 -
Second, a parallel adaptive ray - casting algorithm for graphic rendering of cfi is developed. in the computational model of cfi, the line - of - sight integration is difficult to obtain for 3d complicated flow field, because curvilinear grids, multizone curvilinear grids, and other irregular grids that are commonly used in computational fluid dynamics ( cfd ) present interesting challenges, such as the complex shapes of cell regions defined by grid points ; the wide variation in the sizes of cells in different regions of the grid ; and the intersecting or overlapping nature of multi - grids. the parallel adaptive ray - casting algorithm is extremely efficient to solve these problems
并行自適應光線投射法繼承了光線投射法適合於任何形式網格的優點；光線與計算網格的交點自適應地反映了原來網格點物理量的分佈，能夠與數值計算的精度保持一致；圖像平面的自適應演算法使我們不必從每一個像素發出射線，既提高了光線投射法的計算效率，同時又保證重采樣后激波這樣的高頻信息不會損失；將并行處理技術引入計算光學流動圖像生成過程，解決了大規模數值模擬結果的處理對計算速度和內存容量的需求。 -
Genetic algorithm ( ga ) is a sort of efficient, paralled, full search method with its inherent virtues of robustness, parallel and self - adaptive characters. it is suitable for searching the optimization result in the large search space. now it has been applied widely and perfectly in many study fields and engineering areas
遺傳演算法作為一種求解問題的高效并行的全局搜索方法，以其固有的魯棒性、并行性和自適應性，使之非常適于大規模搜索空間的尋優，已廣泛應用許多學科及工程領域。 -
The key point of this research is to develop more efficient parallel algorithm of sequence processing with different computing environment
針對不同計算環境，開發高效的序列處理并行演算法是本課題的研究重點。
分享友人