片语

time space complexity时间空间复杂度

run-time complexity时间复杂度

time complexity model时间复杂度模型

time component complexity时间分量复杂性

Real-Time Tracking Complexity实时数据复杂度分析

time complexity function时间复杂度性函数

computational time complexity计算时间复杂性

time complexity detail时间复杂性

英汉例句

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

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

• This algorithm has smaller time complexity and space complexity, so can be applied in practical production and life.

  由于本算法具有较小的时间复杂度和空间复杂度，可应用于实际生产与生活。

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

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

• The theoretic analysis demonstrates that the time complexity of this algorithm is approximately linear.

  理论分析表明，该算法的时间复杂性接近于线性复杂度。

• Experimental results show that the path feasibility analysis of traditional symbolic evaluation can be omitted. So it can reduce the time complexity by using symbolic execution algorithm.

  实例结果表明，该算法能免去传统符号执行中对于路径可行性的分析，从而降低时间复杂度。

• The time complexity of this algorithm is low, and it live up to the especial request in response time.

  算法时间复杂度较低，符合网络路由算法在响应时效性方面的特殊要求。

• The data query method and the data query device can reduce the time complexity of the data query of the system and improve the utilization rate of the system resource.

  采用本发明可以降低系统的数据查询时间复杂度，提高了系统资源的利用率。

• In this paper, fingerprint patrol management system based on ARM7 (S3C44B0X) is introduced, which needs high requirement on time complexity of fingerprint verification algorithm.

  本文介绍了基于ARM7 (S3C 44b0x)的指纹巡管系统，该系统对指纹识别算法的时间复杂度有着很高的要求。

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

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

• The experiment proves this algorithm is improved largely both in time complexity and the clustering accuracy.

  实验数据表明改进后的算法在时间复杂度和聚类的準确性方面较原算法有较大的改善。

• Methods of time complexity analysis are usually based on abstractive algorithms, rather than actual programs.

  对于运行时间而言，常用的时间复杂度分析技术基于的是抽象的算法，并非实际程序。

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

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

• On the basis of analysing, summarizing and simulating these traditional methods, we use a stochastic parallel algorithm to solve the assignment problem, and compare them in time complexity and result.

  本文在对这些计算机方法进行分析和仿真的基础上，将一个随机并行算法用在解决分配问题上，并且对各种方法的运行结果进行了比较。

• It can be seen that both the time complexity and precision are matched with those of LU resolving method through theory analysis and data experiment.

  从理论分析和数据实验两方面都表明，此算法的时间复杂性和精度都与LU分解法相当。

• Besides, in this algorithm, we have used some strategy of pruning, which make the algorithm's time complexity more lower.

  在该算法中，还使用了一定的剪枝策略，使得算法的时间复杂度进一步降低。

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

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

• I am searching for a standard way to identify running time complexity of a program.

  我在寻找一个标準的方法来确定一个程序的运行时间复杂度为。

• What is meant by 「Constant Amortized time」 when talking about time complexity of an algorithm?

  讨论算法的时间复杂度时，「恒定分摊时间」是个什么鬼？

• Put forward a planner permutation network by using the ergodic and good relativity of Chebyshev-map chaos sequence, and the time complexity and analyzed permutation character of permutation network.

  利用混沌序列的遍历性及其良好的相关特性，提出了一种二维置换网络，并对置换网络的时间复杂度和其置换性质做了分析。

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

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