大学英语词汇短语释义解析及例句 time complexity

大学英语词汇短语释义解析及例句 time complexity


释义:

time complexity [计] 时间复杂度

例句:



The time complexity of computation procedure is analysed.

分析了计算过程的时间复杂性。



IsValidCommandLineOption has a lookup time complexity of o (1).

IsValidCommandLineOption的查找时间复杂度为o (1)。



Finally, the analysis of time complexity is presented and a contrast.

最后进行了算法复杂度的理论分析和比较。



Finally, the time complexity in the best and the worst case was analyzed.

最后分析了该方法在最好和最坏情况下的时间复杂度。



It is proved that K-Tree Term method is a multinomial time complexity algorithm.

着重证明了K -树组法为多项式时间复杂性算法。



It also shows its security and certifies its communication complexity and time complexity.

讨论了其安全性并证明了该机制的通信复杂度与时间复杂度。



We analyze the time complexity of algorithm and compare it with Rough sets based algorithm.

文章分析了算法的时间复杂度,并同粗糙集算法进行了对比。



What is meant by "Constant Amortized time" when talking about time complexity of an algorithm?

讨论算法的时间复杂度时,“恒定分摊时间”是个什么鬼?



This paper introduces a map sort algorithm with extra memory cost, its time complexity is o (n).

本文介绍了映射式排序算法,这种算法附加一定的存储开销,时间复杂性为O (N)。



The computational time complexity is an important topic in the theory of evolutionary algorithms.

计算时间复杂性是演化理论中的一个重大课题。



By working out such sample data the time complexity of figuring out min cluster is effectively reduced.

这些样本点的求得能有效减少求解最小聚类的时间复杂度。



This article gives an algorithm of building search path, which has a more efficient space and time complexity.

本文提出了一种基于宽度优先搜索的路径生成算法,具有较好的时间复杂性和空间复杂性。



To solve the problem, this paper proposes a new pattern unification algorithm, which time complexity is linear.

为了解决这个问题,本文提出一种新的模式合一算法,共时间复杂度为线性的。



Using real example of recursion, we introduce a type of analysis method of recursion algorism's time complexity.

通过递归实例,介绍了递归算法时间复杂度的一类分析方法。



When the same memory is used as GilbertMinier's attack, the time complexity is about 2127 encryption operations.

如果保持存储量不变,改进的攻击过程需要大约2127次加密运算。



Then, an iterative reasoning algorithm of TDCD is put forward, and its computational time complexity is analyzed.

在此基础提出了一种带时间延迟的因果图迭代推理算法,并分析了算法的时间复杂度。



The improved algorithm can reduce time complexity and increase the checking efficiency of the system by experiment.

实验结果表明,改进后的算法降低了时间复杂度,提高了系统检测效率。



This new algorithm has some advantage of less time complexity than BF algorithm and more simple than KMP algorithm.

此算法具有比BF算法更优越的时间复杂性,并且相对KMP算法而言更简洁易懂。



Bounding volume hierarchy provides an effective method to resolve the intrinsic time complexity in collision detection.

包围盒层次是解决碰撞检测问题固有的时间复杂性的一个有效途径。



The paper also analyzed the time complexity and the scrambling performance of the new networks by computer experiments.

另外,还通过计算机实验,对置乱网络的遍历时间复杂度及其置乱性质进行了分析。



The experimental result shows that the algorithm can reduce time complexity effectively and has definite practicability.

实验结果表明,该算法有效地降低了时间复杂度,具有一定的实用性。

  • Issue by:www.viv-media.com
  • Web:http://
  • About Viv-Media|Free Add URL|Submit Press Release|Submit How To|SiteMap|Advertise with Us|Help|Contact Viv-Media |China Viv-Media
  • Copyright© 2010-2020 viv-media.com Corporation.
    Use of this web constitutes acceptance of Terms of Service and Privacy Policy. All rights reserved.  Poetry Online :Ancient Chinese Poetry