計算復雜性 的英文怎麼說

中文拼音 [jìsuànfùzáxìng]
計算復雜性 英文
complexity of computation
  • 計 : Ⅰ動詞1 （計算） count; compute; calculate; number 2 （設想; 打算） plan; plot Ⅱ名詞1 （測量或計算...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 復 : Ⅰ形容詞1 （重復） repeated; double; duplicate 2 （繁復） complex; compound Ⅱ動詞1 （轉過去或轉過...
  • 雜 : Ⅰ形容詞（多種多樣的; 混雜的） miscellaneous; varied; sundry; mixed Ⅱ動詞（混合在一起; 攙雜） mix; blend; mingle
  • 性 : Ⅰ名詞1 （性格） nature; character; disposition 2 （性能; 性質） property; quality 3 （性別） sex ...
  • 計算 : 1 （求得未知數） count; compute; calculate; reckon; enumerate 2 （考慮; 籌劃） consideration; pla...
  1. Two block time - recursive algorithms are developed for the efficient and fast computation of the 1 - d rdgt coefficients and for the fast reconstruction of the original signal from the coefficients in both the critical sampling case and the oversampling case. the two algorithms are implemented respectively by a unified parallel lattice structure. and the computational complexity analysis and comparison show that the proposed algorithms provide a more efficient and faster method for the computation of the discrete gabor transforms

    首先論證了一維rdgt系數求解演算法和由變換系數重建原信號演算法，不論是在臨界抽樣條件下還是在過抽樣條件下，都同樣具有塊時間遞歸特性，並提出了相應的塊時間遞歸演算法及其并行格型結構實現方法，計算機模擬驗證了并行格型結構實現的可行性，計算復雜性分析與比較也說明了rdgt塊時間遞歸演算法的并行格型結構在計算時間方面所具有的高速和高效性能。
  2. Abstract : an algorithm is presented for better legal solution in detailed placement of large scale mixed macros and standard cells ic design. due to the limitation of computing complexity, an effective and efficient initial placement is very important for detailed placement. novelty of this algorithm lies in a better solution at initial stage by using network - flow method to satisfy row capacity constraint and the thought of linear placement problem ( lpp ) to resolve overlaps. moreover, divide - and - conquer strategy and other simplified methods are adopted to minimize complexity. experimental results show that the algorithm can get an average of 16 wire length improvement on paflo in reasonable cpu time

    文摘:以大規模混合模式布局問題為背景，提出了有效的初始詳細布局演算法.在大規模混合模式布局問題中，由於受到計算復雜性的限制，有效的初始布局演算法顯得非常重要.該演算法採用網路流方法來滿足行容量約束，採用線性布局策略解決單元重疊問題.同時，為解決大規模設計問題，整體上採用分治策略和簡化策略，有效地控制問題的規模，以時間開銷的少量增加換取線長的明顯改善.實驗結果表明該演算法能夠取得比較好的效果，平均比paflo演算法有16的線長改善，而cpu計算時間只有少量增加
  3. A problem on the computational complexity of graph partitions

    關于圖劃分中的一個計算復雜性問題
  4. Under calculating background, we research the uniformity half space and multi - layers models, discuss the effect on studied background results to abnormity and overlapping field

    為了提高計算精度和計算速度以及避免由源奇異性引起的差分計算復雜性，計算時將電位分成二次異常電位和背景電位2部分。
  5. The other classfies the calculation of mbps into the solution of inequation based on heuristic knowledge of mbps of optimal directional coordination setting in complex multiloop network and comes into equivalence of 0 - 1 integral second layout problem. on the basis of the principle of gene optimal evolution, a new approach to determine mbps is first presented and decreases the computational complexity of mbps problem

    其二，利用復雜環網方向保護最優整定配合中最小斷點集（ mbps ）的啟發知識，將mbps的計算歸結為解不等式，進而等價為0 ? 1整數二次規劃問題，基於基因遺傳優化計算原理，首次提出了mbps問題的基因遺傳演算法，降低了問題的計算復雜性。
  6. The complexity theory of calculation has proved that the so - called problem of np and other similar problems are equal in calculating

    計算復雜性理論表明，被稱作np完全問題的旅行推銷員問題以及其它類似的組合優化問題在計算上是等價的。
  7. 3 the concept of equivalence matrix, which expresses equivalence relation in rough set information system, is introduced ; the relations between equivalence matrix and equivalence classes are discussed. the algorithms for data cleaning and rules extraction in knowledge system based on matrix computation are proposed and their complexity of computation is analyzed

    3 、在等價矩陣概念的基礎上，分析了粗糙集知識系統中等價劃分與等價摘要矩陣的關系，採用等價矩陣來表示粗糙集的等價關系，提出了一種對數據庫知識系統進行數據清洗以及從中提取決策規則的矩陣演算法，分析了該演算法的計算復雜性。
  8. ( 3 ) it is well known that the determinant problem in classic proposition logic is a np complete problem, and the first order logic is a half determinant one. so both the analysis of computing complexity and the realization of it are the most important fields

    （ 3 ）眾所周知，經典命題邏輯中的判定問題是np完全問題，而一階邏輯是半可判定問題，關于非經典邏輯特別是非單調邏輯的計算復雜性分析和演算法實現是一個重要的研究領域。
  9. Equation ( 2 ) can be explained as follows : a problem of x - scaled can be transformed to a same problem of ap - s x / a scaled with a calculating overhead of xq f ( z ), so t ( x ), the cost ( complexity ) of this problem, satisfies the above recursive eqution

    方程（ 2 ）可以做如下解釋:一個規模為x的問題，可以以x 「廠（ : ）的計算代價化為。屍個規模為三的同一問題，那麼該問題的計算成本（計算復雜性） t （ x ） a就滿足上述遞歸方程。
  10. In proposbonal calculus, the processing ofresoluhon pdriciple have combination explosion naturally so, how to eltw combinaion explosion in the processing of resolution ( genetal showed computationaily hard problem ) is an in1portan subject in automated theorem proving

    命題邏輯系統中的歸結原理本質上存在組合問題，因此，如何避免組合問題（通常以計算復雜性的形式出現）是自動推理研究中的一個重要課題。
  11. 4 marpe d, schwarz h, wiegand t. context - based adaptive binary arithmetic coding in the h. 264 avc video compression standard. ieee trans

    變長編碼實現簡單計算復雜性低，因此在視頻編碼標準及消費電子產品中被廣泛採用。
  12. The bin packing problem belongs to the most complicated calculated problem : npc problem ( nondeterminstic polynomial complete )

    裝箱問題是具有最高計算復雜性的一類問題： npc （ nondeterministicpolynomialcomplete非確定型多項式演算法）類問題。
  13. Currently, transforming coding is one of the most used approach for image coding, where the discrete cosine transform ( dct ), the discrete wavelet transform ( dwt ), and the lapped biorthogonal transform ( lbt ) are widely utilized. how to reduce the complexity of these discrete transforms, is the key technique to image compression. in this thesis, a type of lapped biorthogonal transform which can map integers to integers is considered

    變換編碼是圖像壓縮中的主流方法，其採用的主要變換有離散餘弦變換、離散小波變換、雙正交疊式變換，如何減少這些離散變換的計算復雜性，一直是圖像壓縮研究的重要課題。
  14. A wide - neighborhood interior point algorithm for class a of nonmonotonic linear complementary problems and its computational complexity

    求解一類非單調線性互補問題的寬鄰域內點方法及其計算復雜性
  15. A wide - neighborhood path - following algorithms for a class of nonmonotonic linear complementary problems and its computational complexity

    矩陣非單調線性互補問題的寬鄰域路徑跟蹤演算法及其計算復雜性
  16. The travelling salesman problem is always one of the most interesting and the hardest topic in combinatorial majorization. there is currently a lot of ongoing activity in the scientific community to research tsp

    旅行商問題就是一類有代表性的已被證明具有npc計算復雜性的組合優化難題，是目前國內外研究的熱點和前沿問題。
  17. Abstract 1 - inkdot alternating pushdown automaton is a slightly modified alternating pushdown automaton with the additional power of marking at most 1 tape - cell on the input with an inkdot once

    計算復雜性理論的一個重要概念是復雜性語言族complexity class ，它包括在給定的資源時間或空間下能夠被識別的所有語言。
  18. It is shown that randomized algorithms can decrease the computational complexity dramatically instead of seeking worst case guarantees. in addition, examples in this paper show that employing randomized algorithms is very efficient and has obvious advantages especially when uncertain interval parameters appear multilinearly or nonlinearly in the characteristic polynomial coefficients

    研究表明，在不考慮最壞情況的意義下，隨機化演算法可以顯著降低計算復雜性，另外，當不確定區間參數以多線性或非線性的方式出現在特徵多項式系數中時，採用隨機化演算法具有明顯的優點並且是非常有效的，文中給出了計算實例。
  19. The fast wavelet entropy technique for image indexing to reduce the complexity of the wavelet histogram method is suggested which can improve the retrieval performance

    提出了快速小波熵的圖像檢索技術以減少小波直方圖技術的計算復雜性並提高了檢索速度。
  20. In order to further reduce the computation complexity and improve the convergence behavior, many sorts of subband filter algorithms are depicted in chapter 3. finally, associated with nlms algorithm, the suband nlms ( snlms ) algorithm is proposed

    為了進一步降低聲回波抵消演算法的計算復雜性和改善其收斂特性，在第三章中，討論了各種子帶濾波演算法，比如dft子帶和fir子帶等。
分享友人
分享到 Line

分享到臉書