The time complexity of computation procedure is analysed.
分析了计算过程的时间复杂性。
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.
通过递归实例，介绍了递归算法时间复杂度的一类分析方法。
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.
实验结果表明，该算法有效地降低了时间复杂度，具有一定的实用性。
A new dynamic routing and wavelength assignment algorithm is proposed and the time complexity of the algorithm is analyzed.
提出了一种新的动态路由和波长分配算法，对算法的时间复杂度进行了分析。
A few approaches available are presented to estimate the time complexity in this paper, also, their induction and analysis.
本文针对时间复杂性的计算提出了几种可行的计算方法，并就这些方法作了简要的推导和分析。
Then, it considers the time complexity and the message complexity, and makes some improvement on the broadcasting algorithm.
之后，作者考虑时间复杂度和报文复杂度，得出递归算法的两点改进。
The usual sequential shortest path algorithms executing on sequential computer have nearly reached their time complexity limits.
针对通常的串行计算机的串行最短路径算法，几乎已经到达了理论上的时间复杂度极限。
The time complexity and space complexity of the traditional attribute reduction algorithm using discernible matrix are quite big.
传统的利用区分矩阵进行属性约简算法，其时间复杂度和空间复杂度很大。
Prepared using the above definition of the heap for sorting algorithms, and analysis of the algorithm is derived time complexity.
编写利用上述定义的堆进行排序的算法，并分析推导算法的时间复杂度。
On the issue of crossing minimization, either time complexity or result of the conventional heuristic algorithm is unsatisfactory.
在层次图边交叉最小化问题上，常规启发算法或者时间复杂度大或者布图效果不佳。
In this paper, optimal algorithms are put forward, and can greatly reduce space and time complexity degree of previous algorithms.
针对原有算法，本文提出了优化算法，大大改善它的时间和空间复杂度。
It generates a hash table from the predetermined list of valid command-line options and a lookup function whose time complexity is o (1).
它将从预定的有效命令行选项列表和时间复杂度为O(1)的查找函数中生成一个散列表。
The conversion algorithm between LDST and linear quadtree and its time complexity analysis are also studied at the end of the paper.
最后，本文还给出了LDST与线性四叉树之间的转换算法及时间复杂度分析。
Time complexity of establishing network with random multiple access methods in one-hop network for wireless sensor network is presented.
针对无线传感器网络，研究了几种核心随机接入方法在一跳网络内组网的时间复杂性问题。
The method has the nearly linear time complexity with the size of dataset and the number of attributes. This results in good scalability.
该方法关于数据库的大小、属性个数具有近似线性时间复杂度，这使得算法具有好的扩展性。
For finding the most similar exception handling rule from exception rule base, the searching algorithm with low time complexity was designed.
为迅速地检索到与当前异常情况最匹配的处理规则，设计了时间复杂度较低的异常处理规则检索算法。
应用推荐