computing complexity中文是什么意思

發音:

中文翻譯
造句

計算復雜性

compute vt.,vi. 計算，估計；算定。 compute ta ...
complexity n. 1.復雜性，復合狀態。 2.復合物；復雜的事物[情 ...
complexity of computing 計算復雜性
complexity n. 1.復雜性，復合狀態。 2.復合物；復雜的事物[情況]。
computing 電腦運算; 計算的估計的; 計算機系; 計算機信息處理技術
advancing complexity 進化綜合
algorithm complexity 算法復雜性
algorithmic complexity 算法復雜性
asymptotic complexity 漸近復雜性
aufwand complexity 復雜性
business complexity 業務復雜性
chemical complexity 化學復雜度
circuit complexity 電路復雜性
clonal complexity 克隆復雜性
code complexity 代碼復雜性
cognitive complexity 認知復雜性
complexity analysis 成分分析
complexity class 復雜度類; 復雜性類
complexity factor 復雜度系數; 復雜性因子; 復雜性指示; 復雜因數
complexity graph 復雜性圖形
complexity measure 復雜性度量
complexity metrics 復雜性度量
complexity of computation 計算的復雜性; 計算復雜性
complexity of emotion 情緒的復雜性
complexity of interface 接口復雜性

"查查詞典"手機版

千萬人都在用的超大詞匯詞典翻譯APP

例句與用法

We found that the ergodic method used to calculate the symmetries of a multidimensional system would give rise to the computing complexity problem , hi order to avoid the computing complexity problem , we present a novel approach using genetic algorithms for calculating the permutation symmetries of a patterns set and the weight matrix of the network . we design the corresponding computer program with visual c + + 6 . 0 language . and numerical simulat
并用wsualc語言分別設計了求解網絡連接矩陣和給定樣本集的置換對稱性相應的遍歷法和遺傳算法的程序，在pc機上進行數值模擬計算，比較遍歷法和遺傳算法的計算結果。
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計算時間只有少量增加
However , because bayes network structure learning algorithm generally explore too big a search space , as well as its computing complexity , and moreover , the such learning algorithm is very easy to fall into the local optimal solution , ban ’ s efficiency is questioned . finding a kind of highly effective global searching algorithm is an extremely important to the study of ban
針對這種分類器的結構學習,設計了結合對數似然的適應度函數,并給出了網絡結構的編碼方案,設計了相應的遺傳算子,使得該算法能夠收斂到全局最優的結構。實驗結果表明,該算法具有良好的分類效果。
The optimum multiuser detection can obtain the best bit error rate theoretice . but its computing complexity increases with the number of users exponentially and belongs to np maturity problem . so much research fasten on the multiuser detection with low computing complexity . cdma multiuser detection is in fact a combination optimize problem
基于最大似然準則的最佳多用戶檢測器在理論上可以獲得最小的誤碼率,提供最佳的檢測性能,但其計算復雜度隨用戶數呈指數增長,屬于np完備問題,因此大量的研究集中于發展計算復雜度較低的次最佳多用戶檢測器,使其具有合理的計算復雜度。
The creative work of the paper is to simplify the design process in the way of introducing custom instruction , which makes best use of the advantage of nios to add or reduce peripherals to meet the actual requirement . in this way an instruction is operated on nios to improve speed and decrease computing complexity
論文創造性的工作在于,提出采用一種自定制指令的方式將fir濾波器設計簡化,充分應用nios軟核可以在設計階段依據實際需要來增減外設數量和種類的優點,在nios上以一條指令的方式運行,從而提高了運行速度,降低了運算復雜度。
To mine it , a novel method based on artificial immune gene expression programming ( aigep ) was introduced , where , new structures of antibody and immune cell were designed to decrease computing complexity , the special negative select strategy was presented to eliminate invalid or redundant immune cells according to system requirements , and a heuristic mdcar reduction criterion was introduced , that is , a strong rule is fine only if the contra - positive of it is strong
構造了有特色的抗體和免疫細胞結構，能有效減少計算量；設計了特有的否定選擇策略，可以消除無用的和冗余的免疫細胞；引出了逆否規則與原規則同為強規則的啟發式過濾準則，可有效約簡規則數目。
In addition , the work speed is very low in the methods with no parameters . therefore , we focus on proceeding the algorithm ' s performance with increasing the speed of searching non - dominated solutions , reducing the number of non - dominated solutions in precondition of ensuring a better distribution of individuals , and constructing new populations . the multi - objective genetic algorithm based on sorting and clustering efficiently increase its run efficiency , debase its compute complexity and improve its convergence performance
為此，本文的研究主要就是從提高尋找非支配集的速度，在保持群體原有特性的前提下降低非支配集的大小，以及新群體的構造等方面入手，通過基于分類和聚類的方法，有效提高多目標遺傳算法總體運行效率，降低其計算復雜性，使多目標遺傳算法的收斂性能得到進一步改善。
Because the high resolution on high frequency of wavelet package meets the feature of fingerprint containing abundant high frequency , we filtered the fingerprint preliminarily by means of wavelet package . while designing orientation filter , we introduced the square - circle transform to rotate filter , thus we reduced computing complexity and avoided imported errors
具體地，結合指紋圖像中高頻豐富的特點，以及小波包高頻分辨率高的分析特性，選用小波包對指紋圖像進行初濾波；在設計方向濾波器時，對濾波器的旋轉引入了方?圓變換的方法，進而減少了計算的復雜度，同時避免引入誤差。
Firstly , a 0 - 1 integer programming mathematical model is constructed to describe tail - number - assigning work happened in domestic airline , since the problem is npc , a unified polynomial algorithm which satisfies engineering requirement is unavailable . illuminated by the practical experience , a specific tna problem is classified into one of three typical tna modes : tna based on fleet dispatching commands , tna based on fleet balance application , tna based on minimum fleet requirement ; secondly , by simplifying and relaxing some minor constraints , corresponding mathematical models and heuristic algorithms are reconstructed for each typical tna mode ; finally , computing complexities are discussed
為此論文在借鑒手工編制排班計劃經驗的基礎上，將一個具體的飛機排班問題，歸結為三種典型排班模式中的一種，即：基于飛機調度指令要求的排班問題，基于飛機使用均衡要求的排班問題和基于最少需用飛機數的排班問題，對于每種典型的飛機排班模式，在對次要的約束條件進行簡化、松馳的基礎上構造出相應的能夠滿足工程應用要求的啟發式算法，并分析了算法的復雜性。
A modified k - means method which can reduce compute complexity greatly is proposed to cluster similar customers . churn prediction adopts decision trees algorithms . after presenting a brief overview of tree - building algorithm and tree - pruning algorithm of traditional decision trees , the paper describes how to push constraints into the tree - building phase and tree - pruning phase in detail
離網預測采用了決策樹分類器，本文在描述決策樹算法中所涉及到的建樹、代價計算、剪枝等問題之后，給出了在建樹中和建樹后分別加入限制條件的修剪算法。

更多例句： 1 2 3

推薦英語閱讀

computing complexity的中文翻譯，computing complexity是什么意思，怎么用漢語翻譯computing complexity，computing complexity的中文意思，computing complexity的中文，computing complexity in Chinese，computing complexity的中文，computing complexity怎么讀，發音，例句，用法和解釋由查查在線詞典提供，版權所有違者必究。