時間復雜性 的英文怎麼說

中文拼音 [shíjiānfùzáxìng]
時間復雜性 英文
time complexity
  • 時 : shí］Ⅰ名1 （比較長的一段時間）time; times; days:當時at that time; in those days; 古時 ancient tim...
  • 間 : 間Ⅰ名詞1 （中間） between; among 2 （一定的空間或時間里） with a definite time or space 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 ...
  • 時間 : time; hour; 北京時間十九點整19 hours beijing time; 上課時間school hours; 時間與空間 time and spac...
  1. 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實現多邊形頂點凸凹性的高效識別。
  2. 2. presenting banyan network ' s propert, conflict and the neccesary and sufficent condions of conflict. then, three routing algorithms are presented on realizing permutation routing based on time domain approach under the constraint of avoiding crosstalk, and the complexity of the algotithms are analysed

    2 、給出了banyan網路的一些性質及實現置換路由的沖突次數及發生沖突的充要條件，並且給出了基於時域法的無串擾的實現置換路由的三種調度演算法，討論了演算法的時間復雜度以及所需要的調度次數的上界。
  3. 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

    通過對串列和并行演算法時間復雜度的計算表明，當數據集充分大時，由於連續屬性的排序計算操作分散到各個處理機單元上進行，顯著降低了計算時間，從而可以得到近似於處理機個數的加速比，對于離散屬性，本并行演算法對串列演算法的性能提高有限
  4. The examples and the corresponding time complexity analysis are given too

    同時給出了計算實例及相應的時間復雜性分析
  5. 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三種基本演算法的結構和特點，構造了一個分層搜索演算法的時間復雜度模型，從事務規模、數據項平均長度和支持度三個方面，對分層搜索演算法的時間復雜性進行了分析和驗證。
  6. 21 tyler j r, wilkinson d m, huberman b a. email as spectroscopy : automated discovery of community structure within organizations. in it proc

    本文演算法的時間復雜性為o n2 ，實驗表明在處理動態網路的時間效率上優于經典的gn和其改進演算法。
  7. The national academy of science, 2002, 99 : 7821 - 7826. 16 tyler j r, wilkinson d m, huberman b a. email as spectroscopy : automated discovery of community structure within organizations. in proc

    該演算法時間復雜性為o n2的主要不足是需要一定的先驗知識例如共體數目和每個共體的粗略大小，而這些先驗知識事先難于獲取，尤其當我們面對未知的符號網路。
  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. 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演算法，加強了演算法的完備性，降低了部分情況下的時間復雜度。
  10. 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 -線性收斂速度和多項式時間復雜性。
  11. The mathematical theory of linear self - assembly was mainly developed by adleman. he presented a mathematical formal model of linear self - assembly and studied the character of dynamics of the model - time - complexity and equilibrium

    Adleman發展了線性自裝配的數學理論，系統地提出了線性自裝配的形式模型，並且研究了這個模型的動力學特徵? ?時間復雜性和自裝配的平衡特性。
  12. Especially when wang - ball forms are used, the time complexity for evaluating would be reduced from cubic to quadratic, of the degree of the surface

    特別當採用wang - ball曲面時，演算法的時間復雜性將從曲面次數的立方降低到平方
  13. Based on tabu search, a local search technique with changeable local structure ( algorithm 2 ) is proposed for this np - hard problem, which provides an approach to control the optimizing process flexibly

    基於tabu搜索設計了變鄰域結構的局部搜索技術，提供了靈活控制尋優過程的途徑;全多項式時間復雜性近似策略的開發，使得0一1背包問題的求解成為了n戶c問題近似演算法設計中最為成功的範例。
  14. International conference on clustercomputing and the grid ccgrid 2001, brisbane, australia, may 2001, p. 161. 15 goil s, choudhary a. an infrastructure for scalableparallel multidimensional analysis

    同時，本文還給出了基於phc存儲結構的并行區域查詢和動態更新演算法，這兩個演算法的時間復雜性均均為o logdn p 。
  15. The idea behind it is to approximate the object with a simpler bounding volume that is a little bigger than the object. in building hierarchies on object, one can obtain increasingly more accurate approximations of the objects. so during traversing bounding volume hierarchy, it speeds up collision detection by prune away primitive pairs, which will not intersect clearly though rapid intersection test between bounding volumes and just deal with those whose bounding volume is intersected

    層次包圍盒方法是解決碰撞檢測問題固有時間復雜性的一種有效的方法，它是用體積略大而幾何特性簡單的包圍盒來近似地描述復雜的幾何對象，並通過構造樹狀層次結構來逼近對象的幾何模型，從而在對包圍盒樹進行遍歷的過程中，通過包圍盒間的快速相交測試來及早地排除明顯不可能相交的基本幾何元素對，而只對包圍盒重疊的部分元素進行進一步的相交測試，以提高碰撞檢測的速度。
  16. Software practice and experience, 2002, 32 : 135 - 164. 12 ibarra o h, kim c e. heuristic algorithms for scheduling independent tasks on non - identical processors. journal of the association for computing machinery, 1997, 24 : 280 - 289

    實驗結果表明，我們的演算法在機器性能上優于其他幾個演算法，能夠有效地保證負載均衡，並且幾乎總能取得最優調度策略實驗也表明我們的演算法從時間復雜性角度來說是一個高效的調度演算法。
  17. We prove that the worst - case ratio of algorithm d is 15 / 13, which is better than any other approximation algorithm except polynomial time approximation scheme considering with both worst - case ratio and time complexity

    我們證明了對三臺機情形，演算法d的最壞情況界為15 13 ，該演算法的最壞情況界和時間復雜性優于除近似方案以外的已有近似演算法。
  18. Many examples are calculated using these two algorithms

    研究了時間復雜性，給出了兩種演算法各自的優缺點。
  19. According to these definitions, network fault management is transferred to graph research. diffusion automated fault management algorithm ( dafma ) is proposed in this part and the correctness and time complexity of it are proved carefully

    以圖為基礎，文中提出了擴散法自動網路故障管理演算法dafma ，並對該演算法的正確性、時間復雜性做了嚴格分析與證明。
  20. The algorithm is list - based. the timing - constrained scheduling algorithm reduces the power consumption by assigning as many nodes as possible to the resources operating at reduced voltages. in the paper, we propose three kinds of scheduling algorithms with multiple voltages under timing constraints, which have separately lower time complexity, better optimizing effect and better optimizing capability as a whole

    由於多電壓調度是np - hard問題，本文還採用了一種基於模擬退火搜索的時間和資源約束的調度演算法，該演算法是一種啟發式的搜索演算法，通過與基於gain大小搜索的調度演算法的對比，數據表明兩演算法優化效果接近，但此演算法具有較低的時間復雜性。
分享友人
分享到 Line

分享到臉書