IsValidCommandLineOption has a lookup time complexity of o (1).
IsValidCommandLineOption的查找时间复杂度为o (1)。
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)的查找函数中生成一个散列表。
What is meant by "Constant Amortized time" when talking about time complexity of an algorithm?
讨论算法的时间复杂度时，“恒定分摊时间”是个什么鬼？
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分解法相当。
The usual sequential shortest path algorithms executing on sequential computer have nearly reached their time complexity limits.
针对通常的串行计算机的串行最短路径算法，几乎已经到达了理论上的时间复杂度极限。
Finally, the time complexity in the best and the worst case was analyzed.
最后分析了该方法在最好和最坏情况下的时间复杂度。
The method has the nearly linear time complexity with the size of dataset and the number of attributes. This results in good scalability.
该方法关于数据库的大小、属性个数具有近似线性时间复杂度，这使得算法具有好的扩展性。
The time complexity of computation procedure is analysed.
分析了计算过程的时间复杂性。
A new dynamic routing and wavelength assignment algorithm is proposed and the time complexity of the algorithm is analyzed.
提出了一种新的动态路由和波长分配算法，对算法的时间复杂度进行了分析。
Besides, in this algorithm, we have used some strategy of pruning, which make the algorithm's time complexity more lower.
在该算法中，还使用了一定的剪枝策略，使得算法的时间复杂度进一步降低。
Time complexity of establishing network with random multiple access methods in one-hop network for wireless sensor network is presented.
针对无线传感器网络，研究了几种核心随机接入方法在一跳网络内组网的时间复杂性问题。
We analyze the time complexity of algorithm and compare it with Rough sets based algorithm.
文章分析了算法的时间复杂度，并同粗糙集算法进行了对比。
The ordered bucket directory makes this structure can be used in both single record direct searching and batch records sequential searching, and the time complexity does not increase.
有序桶目录使这一结构既可用于单记录直接检索，又可方便地进行批量记录顺序检索，而时间复杂性没有增加。
To solve the problem, this paper proposes a new pattern unification algorithm, which time complexity is linear.
为了解决这个问题，本文提出一种新的模式合一算法，共时间复杂度为线性的。
The improved algorithm can reduce time complexity and increase the checking efficiency of the system by experiment.
实验结果表明，改进后的算法降低了时间复杂度，提高了系统检测效率。
Hash function plays an important role in the query algorithm, and the query algorithms based on it achieves a constant time complexity in theory.
散列函数在查询算法中起着重要作用，基于此的查询算法在理论上可达到常数级时间复杂度。
This new algorithm has some advantage of less time complexity than BF algorithm and more simple than KMP algorithm.
此算法具有比BF算法更优越的时间复杂性，并且相对KMP算法而言更简洁易懂。
Based on this extended directed graph, an algorithm for creating it is proposed, the time complexity analysis of the algorithm is given, and its correctness is proved.
基于这种扩充有向图，提出了一种对象范式生成算法，并给出了算法的时间复杂度分析和正确性证明。
Bounding volume hierarchy provides an effective method to resolve the intrinsic time complexity in collision detection.
包围盒层次是解决碰撞检测问题固有的时间复杂性的一个有效途径。
Prepared using the above definition of the heap for sorting algorithms, and analysis of the algorithm is derived time complexity.
编写利用上述定义的堆进行排序的算法，并分析推导算法的时间复杂度。
Compared with some normal methods of searching feedback loops, the author obtained that the matrix algorithm was superior to the determinant algorithm in terms of time complexity.
针对这一问题，比较了几种常见的反馈环计算方法，得出在时间复杂度上矩阵算法优于行列式算法。
The time complexity and space complexity of the traditional attribute reduction algorithm using discernible matrix are quite big.
传统的利用区分矩阵进行属性约简算法，其时间复杂度和空间复杂度很大。
An improved algorithm of node refinement scheme called endpoint triangle's circumcircle method (ETCM) is proposed, which has a linear time complexity.
本文提出了一种改进的细分嵌入算法——端点外接圆法(ETCM)，该算法具有线性时间复杂度。
The computational time complexity is an important topic in the theory of evolutionary algorithms.
计算时间复杂性是演化理论中的一个重大课题。
For finding the most similar exception handling rule from exception rule base, the searching algorithm with low time complexity was designed.
为迅速地检索到与当前异常情况最匹配的处理规则，设计了时间复杂度较低的异常处理规则检索算法。
Using real example of recursion, we introduce a type of analysis method of recursion algorism's time complexity.
通过递归实例，介绍了递归算法时间复杂度的一类分析方法。
A parallel algorithm for matrix multiplication based on optical transpose interconnection system (OTIS) network is proposed, and the time complexity is analyzed.
提出基于光交换互连系统(otis)网络结构的矩阵乘并行算法，分析它的时间复杂性。
Then, it considers the time complexity and the message complexity, and makes some improvement on the broadcasting algorithm.
之后，作者考虑时间复杂度和报文复杂度，得出递归算法的两点改进。
Time complexity and space complexity in searching binary complementary sequence pair are very huge because four sequences are involved in the calculation.
因为对二元互补序列偶的搜索涉及到四个序列的计算，搜索的时间复杂度和空间复杂度很大。
This paper introduces a map sort algorithm with extra memory cost, its time complexity is o (n).
本文介绍了映射式排序算法，这种算法附加一定的存储开销，时间复杂性为O (N)。
应用推荐