complexity of computing 中文意思是什麼

complexity of computing 解釋
計算復雜性
  • complexity : n. 1. 復雜性，復合狀態。2. 復合物；復雜的事物[情況]。
  • of : OF ＝Old French 古法語。
  1. Combining multilevel scheme, spectral bisection method, kl / fm refinement, as well as multi - partitioning refinement strategy, the computing method is characterized by high efficiency, flexibility, and simplicity because it both maintains load balancing and minimizes the complexity of communication among processors

    演算法結合了多層次思想和譜分區方法、 kl fm精化演算法和多分區調整策略等技術，以保持負載平衡和減小處理器之間的通信復雜度為目標，具有高效、靈活、簡便等特點。
  2. The discussion of main parallel technologies on construction of parallel sliq algorithm is presented in this paper. the computing result of algorithm complexity of sequential and parallel algorithm indicates : when the data set is large enough, as to continuous attributes, the parallel algorithm almost get speedup value equal to the number of processors ， while as to categorical attribute the improvement of parallel algorithm is limited

    通過對串列和并行演算法時間復雜度的計算表明，當數據集充分大時，由於連續屬性的排序計算操作分散到各個處理機單元上進行，顯著降低了計算時間，從而可以得到近似於處理機個數的加速比，對于離散屬性，本并行演算法對串列演算法的性能提高有限
  3. 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計算時間只有少量增加
  4. In long - range dependent case, a 5 - layer bp is applied to predict the network traffic. simulations show that, in terms of prediction, bp is more precise than farima, but at the cost of computing complexity

    研究結果表明，該模型能夠較好地預測自相似業務流，特別是在預測精度上比farima模型要高，但是它的計算量較大。
  5. Firstly, a ~ ( h ) save some path information for each node as add - ons and build hash index on these information, then a ~ ( h ) use these information to reduce time complexity of all computing above

    該演算法將一些路徑信息作為每個結點的附加信息預先保存起來，並對這些信息建立hash索引。
  6. ( 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完全問題，而一階邏輯是半可判定問題，關于非經典邏輯特別是非單調邏輯的計算復雜性分析和演算法實現是一個重要的研究領域。
  7. Deflection is one of the most important performances of flexibility road. because of complexity of flexible road construction, road design life based on experiential formula or theoretical formula of current deflection computing theory has errors from reality, especially it does not reflect influence of dynamic tire load

    彎沉是柔性路面的主要設計指標，但由於柔性路面結構復雜，使得採用現有彎沉計算的經驗公式和理論公式設計出的路面壽命與實際使用情況有較大出入，尤其反映不了動載對設計的影響。
  8. The computing complexity and computing time of this algorithm is lower than that of existed algorithms

    該演算法比已有的塊三對角矩陣求逆演算法的計算復雜度和計算時間低。
  9. Autonomic computing aims to deal with the complexity of today ’ s systems by letting the system handle the complexity autonomously. in this paper, technologies explored in some of the papers presented in this issue are introduced

    自主計算是近年興起來的一個熱門領域，其研究目標是解決日益增加的計算系統復雜度問題，主要特徵包括:自配置、自優化、自修復和自保護等。
  10. 3. a fast algorithm is proposed for computing the linear complexity of a binary sequence with period p ? and generalized one for determining the linear complexity of a sequence with period pfl over gf ( q )

    提出了一個計算周期為p ~ n的二元序列的線性復雜度的快速演算法，並推廣為確定gf （ q ）上周期為p ~ n的序列線性復雜度的快速演算法。
  11. In 1998, zhou, xiong and zhu improved sh algorithm by reducing this complexity to 2n - lg n. in this paper, we make further improvement. the overall complexity of computing distances is reduced to 3n - lg n 2, which is only half that of sh algorithm

    但是距離的計算量相對于其他基本代數或者邏輯操作來說開銷比較大，所以如何降低整個演算法過程中距離的計算次數成為我們考慮的重點，我們改進的目標就是使得計算距離的復雜度盡可能的小。
  12. In one process of combination, the euclidean distances between 3n pairs of points need to be computed, so the overall complexity of computing distance is then 3n - lg n. since the computation of distance is more costly compared with other basic operation, how to improve sh algorithm from the aspect of complexity of computing distance is considered

    對帶左半部分內的每個點，演算法需要考慮帶右半部分內的至多6個點，假設平面上點的個數為n ，該演算法在歸並時最壞情況下需要求出3n對點對之間的距離，從而整個演算法計算距離的復雜度為3n lg n 。
  13. We also introduced the fractal theory to study fitness landscapes, and analyzed the complexity of fitness landscapes by computing the correlation dimension based on random walk fitness time series

    提出利用分形理論來分析遺傳演算法適應值曲面，並提出基於隨機遊走模型對適應值曲面進行關聯維數測試，以反映適應值曲面的復雜程度。
  14. In the case of complex situation, the obtained definitive or clear mathematic programming problems are usually nonlinear programming which bring complexity to computing, and even some stochastic or fuzzy problems are difficult to convert to definitive or clear problems

    這是因為，對較復雜的情形，得到的確定或清晰的數學規劃通常是非線性規劃，給計算帶來復雜性，甚至有些問題難以轉化為確定或清晰的數學規劃問題。
  15. 4. a fast algorithm for computing the linear complexity and the minimal polynomial of a binary sequence with period t ? m is proposed, and generalized one for determining the linear complexity of a sequence with period pmqfl over gf ( q )

    提出確定周期為2 ~ np ~ m的二元序列的線性復雜度和極小多項式的一個快速演算法，並推廣為計算gf （ q ）上周期為p ~ mq ~ n序列的線性復雜度和極小多項式的快速演算法。
  16. The main contributes of this thesis are : 1. we describe the algorithm of eflag linear analyzing ( efla ). the complexity of the algorithm is linear and the algorithm reduces the flag computing dramatically and increases the performance of the dynamic execution

    本文的主要貢獻如下: 1 .提出了動態二進制翻譯標志位處理優化演算法，簡化了基本塊間的標志位分析，採取分析后繼的方法減小了演算法開銷。
  17. The computing complexity of wi decoder is reduced greatly by this method, and the reconstructed speech quality keeps invariable meanwhile

    該方法大大降低了wi解碼器的復雜度，同時保證了合成語音質量沒有變化。
  18. Simplifies the overall complexity of the enterprise computing model

    簡化了企業計算模型的總體復雜度。
  19. Reliability is an important parameter in evaluating the performance of a communication network. anew algorithm of computing networks reliability by using binary decision diagrams ( bdd ) is presented in this paper. the algorithm can get a much simpler bdd diagram than the other algorithms, and can reduce the complexity of the computation efficiently

    關于網路可靠度，在已有結果的基礎上，提出了一種利用二元判決圖計算網路可靠度的方法，該方法將網路的最小路集用二元判決圖來表示，並得到最小路集的不交和，最後獲得網路的可靠度。
  20. An eigenvalue interlacing theorem is given and proved. each eigenpair is computed by bisection and generalized rayleigh quotient iteration. for computing all eigenvalues and eigenvectors is o ( n2r2 ), it is less than o ( n3 ), which is the computational complexity of lapack, when r n

    在計算全部特徵值和特徵向量的情況下，演算法的計算復雜性為o （ n ~ 2r ~ 2 ） ，當r n時，優于壇一一一~一續攀遨粼望廷二生掣夔lapack的計算復雜性o （ n 』 ） 。
分享友人
分享到 Line

分享到臉書