time complexity 中文意思是什麼

time complexity 解釋
時間分配復雜性
  • time : n 1 時，時間，時日，歲月。2 時候，時刻；期間；時節，季節；〈常pl 〉時期，年代，時代； 〈the time ...
  • complexity : n. 1. 復雜性，復合狀態。2. 復合物；復雜的事物[情況]。
  1. And this method can be divided into agglomerative and divisive hierarchical method with the time complexity of o ( n ) according to the decomposition process, e. g

    根據層次的分解如何形成，層次的方法又分為凝聚的和分裂的方法，如birch演算法。其計算其復雜度為o （ n ） 。
  2. In this paper, the problem of calculating movement of piece is simplified to the problem of finding track line segments between vertices and edges, hence the time complexity is much reduced, and special cases such as inner cavity and inner nfp ( no fit polygon ) can also be tackled

    摘要將多邊形滑動碰撞問題轉化為頂點和邊之間的軌跡線提取問題，從而降低了時間復雜度，並可統一處理邊界空腔和內部靠接臨界多邊形問題。
  3. By the study of several typic methods of determining convexo - concave features for vertices of polygon, the computation time complexity of these methods was analysed, and those methods were implemented in vc + +

    摘要主要針對幾種典型的多邊形頂點凸凹性識別演算法進行研究，對它們的計算時間復雜度進行分析，並用vc + + 6 . 0實現多邊形頂點凸凹性的高效識別。
  4. The examples and the corresponding time complexity analysis are given too

    同時給出了計算實例及相應的時間復雜性分析
  5. Time complexity analysis of two non - angle algorithms to determine the radial spatial adjacent relationship

    確定射線空間相鄰關系的兩個非角度演算法的時間復雜度分析
  6. In the study on level wise search algorithm, the structure and character of three basic frequent set discovery algorithms ais, apriori and dhp are studied by simulation. a model of level wise search algorithm is given and its time complexity is analyzed respectively on transaction scale, item length and support parameter

    在分層搜索演算法的研究方面，本文模擬分析了ais 、 apriori和dhp三種基本演算法的結構和特點，構造了一個分層搜索演算法的時間復雜度模型，從事務規模、數據項平均長度和支持度三個方面，對分層搜索演算法的時間復雜性進行了分析和驗證。
  7. 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索引。
  8. The result shows that the time complexity of algorithm is linear with the increment of transaction if the average length of transaction and frequent itemsets is invariable, but it is inefficient to the increament of item average length ( including transaction length and frequent itemset length )

    結果表明：在事務平均長度和頻繁數據項集一定條件下事務規模對演算法的時間復雜性影響是線性的；但演算法卻不能很好解決數據項長度（事務和頻繁數據項平均長度）增大對其性能的影響。
  9. In regard to the knowledge by learning, we present that the super - dimensional cube, which has the characteristic to integrate various knowledge representation conveniently, is used as the architecture of knowledge base. the speediness algorithm of knowledge access, the best matching cube selection algorithm, is discussed in this paper when the super - dimensional cube is used as the architecture of knowledge base. the time complexity of the algorithm is analyzed, and the parallel algorithm is discussed also

    在這篇文章中我們提出一種多智能體系統新的協商模型：基於「這是什麼」 （或「要做什麼」 ）學習機制的協商而不是常規的「怎麼做」模型；學習得到的知識，為了方便集成多種知識表示方法，我們運用高維方體的知識庫體系結構，在此基礎上進行快速訪問演算法的設計，分析了演算法的復雜度，並討論了演算法的并行實現；在模型中，我們還根據功能的需要與環境的需要，提出了智能體的三維模型。
  10. The time complexity is low because only shortest paths connected to relay nodes is compared. simulation results show that fairly good cost performance is achieved. there is trade - off between complexity and performance

    由於比較了通過中轉節點后的最短路徑，因此運算的復雜度大大降低，且通過模擬得到了較好的性能，模擬結果表明sp - dvma演算法是一種低復雜度的時延和時延差約束的多播路由演算法。
  11. The delay and delay variation constrained minimum steiner tree problem is also researched. lcdvma ( low - cost delay variation - constrained multicast algorithm ) is proposed for this problem. low time complexity, low cost and constrained delay and low delay variation are achieved by only comparing minimum delay paths and minimum cost paths

    對于時延和時延差約束的最小steiner樹問題，提出了一種基於最小時延路徑和最小費用路徑的演算法?一lcdvma演算法，由於該演算法比較了通過中轉節點后的最低費用路徑和最短時延路徑，降低了運算復雜度，通過模擬得到了較小的網路費用和時延差，因此lcdvma演算法是一種具有低復雜度的時延和時延差約束的最小steiner樹的啟發式演算法。
  12. At the same time, complexity science has made a success in describing, simulating complex systems and applying these achievements in discussing evolution of complex systems and their essence of function, but it is incapable of controlling these complex systems

    與此同時，復雜性科學在對復雜系統的描述與模擬，並將其應用於探討復雜系統的進化與功能的本質方面取得了顯著的成功，但在控制這些系統方面還無能為力。
  13. The test results show that this algorithm makes better improvement in time complexity than the horizontal union algorithms of common universe concept lattice found in related literature

    實驗表明，該演算法和相關文獻中的同域概念格橫向合併演算法相比，其時間性能有明顯改善。
  14. For boosting the efficiency of web ir and reinforcing the interaction between system and user, this thesis improves the completeness and time complexity under some situation of the lingo algorithm, which is used for web page on - line clustering

    為提高web信息檢索的效率，加強系統與用戶的動態交互，本文改進了一種適合網頁在線聚類的lingo演算法，加強了演算法的完備性，降低了部分情況下的時間復雜度。
  15. This article, according to the common digital keyboard on the mobile communication equipment, make essential research for windows ce - embedded operation system in chinese character input technology and realize with digital keyboard. using tree - like structure that has the space complexity o ( n ) and the time complexity of o ( n ) when searching to store chinese information. chinese input method applying this kind of store technique in chinese table has the quality of high input speed and low memory space

    本文就根據移動通信設備上常見的數字鍵盤，為windowsce嵌入式操作系統在漢字的數字鍵盤輸入技術及其實現方面作了必要的研究；並使用了一種在查找時空間復雜度為o （ n ） 、時間復雜度為o （ n ）的樹形結構來存儲中文信息，使用這種存儲技術作為碼表內存存放方式的漢字輸入法具有輸入速度快、佔用空間少的優點。
  16. We put the emphases on the soft output viterbi algorithm ( sova ), which is one of turbo code ’ s decoding algorithms, and presents the derivation and computation step of the sova decoding algorithm. after presenting sova and map decoding algorithms and analyzing four kinds of decoding algorithms, the paper makes a comparison among the different decoding algorithms by emulation analysis, and analyzes the time complexity of various algorithms, and then contrasts them. in the last part of this paper, according to the criterion recommended by the consultative committee for space data systems ( ccsds ), including code rate,

    根據空間數據系統顧問委員會（ ccsds ）為turbo碼應用於深空通信系統推薦的標準，包括碼率、碼塊大小、分量碼類型、約束長度、碼生成多項式，以及交織器的選擇等參數的建議以及sova譯碼演算法的理論基礎，設計了sova演算法的實現結構，通過模擬驗證了本文所採用的turbo碼的性能，從而證明turbo碼確實是一種很好的通道糾錯編碼方式，它適用於要求功耗低或信噪比低的深空通信系統中。
  17. Based on the timing constraints event model of rtl ( real time logic ), the compiling algorithms for timing constraints event transform the problem of how to detect timing constraints event to the problem of how to find negative cycle in weighted directed graph, which is named as constraints graph. by simplifying constraints graph, the efficient detecting algorithms for timing constraints event have been developed, which not only has good time complexity but also can find events that violate timing constraints as early as possible. in order to verify the event detecting methods based on dynamic rules and to check its efficiency in application, experiment schemes are designed and performed on the implemented prototype system in linux environment

    帶時間約束事件的編譯演算法以rtl （ realtimelogic ）事件模型為基礎，將帶時間約束事件的檢測轉化為在帶權值的有向圖（此即受限圖）中尋找負圈的問題，它通過化簡受限圖得到最小有效約束集；運行時事件檢測演算法在最小有效約束集上檢查事件的時間約束，不但有較好的執行效率，而且能盡早地發現違反時間約束的事件。
  18. On the base of trust path and certificate validation steps, we analyze the time complexity of two trust models ( subordinated hierarchy and cross - certified mesh model ), and then analyze the methods of certificate validation in current standards

    第三，介紹了信任路徑的概念，證書驗證的一般步驟，在此基礎上分析了兩種具有代表性的信任模型（附屬層次模型和交叉認證網模型）證書驗證的復雜度。
  19. The time complexity will be different according to the number and value of input properties, such as cobweb algorithm

    如cob場王b ，計算復雜度會因輸入屬性的數目和屬性值的不同而劇烈變化。
  20. Without the strict feasibility of the initial points and iteration points, the algorithm is shown to possess both polynomial - time complexity and q - linear convergence

    該演算法不要求初始點及迭代點的可行性且具有q -線性收斂速度和多項式時間復雜性。
分享友人
分享到 Line

分享到臉書