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)的查找函数中生成一个散列表。
Through some theoretical analysis, it is shown that the proposed algorithm can reduce the storage and time complexity of concept lattice construction process.
理论分析表明,该算法能有效地减少概念格的存储空间和建格时间。
The time complexity of computation procedure is analysed.
分析了计算过程的时间复杂性。
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.
文章分析了算法的时间复杂度,并同粗糙集算法进行了对比。
Naive translation of declarations leads to executable algorithms with high time complexity.
幼稚的声明翻译会导致执行算法时间复杂度高。
By working out such sample data the time complexity of figuring out min cluster is effectively reduced.
这些样本点的求得能有效减少求解最小聚类的时间复杂度。
The theoretic analysis demonstrates that the time complexity of this algorithm is approximately linear.
理论分析表明,该算法的时间复杂性接近于线性复杂度。
The computing complexity theory discusses the time complexity and the space complexity of the algorithms.
计算的复杂性理论研究算法的时间复杂性和空间复杂性。
The results show that the time complexity of the new algorithm is lower than the two classical algorithms.
分析结果显示,新算法的时间复杂度要低于两种典型算法。
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.
对于运行时间而言,常用的时间复杂度分析技术基于的是抽象的算法,并非实际程序。
This article gives an algorithm of building search path, which has a more efficient space and 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 algorithm has smaller time complexity and space complexity, so can be applied in practical production and life.
由于本算法具有较小的时间复杂度和空间复杂度,可应用于实际生产与生活。
Bounding volume hierarchy provides an effective method to resolve the intrinsic time complexity in collision detection.
包围盒层次是解决碰撞检测问题固有的时间复杂性的一个有效途径。
The algorithm has high location accuracy and low time complexity due to weakening the interference of background areas.
由于减弱了背景区域的干扰,该算法具有较高定位精度和较低时间复杂度。
The paper also analyzed the time complexity and the scrambling performance of the new networks by computer experiments.
另外,还通过计算机实验,对置乱网络的遍历时间复杂度及其置乱性质进行了分析。
And the experimental results show that the time complexity of pseudo-likelihood is much lower than likelihood approach.
实验证明采用伪似然估计方法构造目标函数在时间复杂度方面比采用似然估计方法要低很多。
The experimental result shows that the algorithm can reduce time complexity effectively and has definite practicability.
实验结果表明,该算法有效地降低了时间复杂度,具有一定的实用性。
Accordingly, this paper offered optimized algorithm for reduction of knowledge, of which time complexity was polynomial.
在此基础上提出了优化的知识约简算法,该算法的时间复杂度是多项式的。
A new dynamic routing and wavelength assignment algorithm is proposed and the time complexity of the algorithm is analyzed.
提出了一种新的动态路由和波长分配算法,对算法的时间复杂度进行了分析。
In this algorithm, balance of load was achieved in the process, and time complexity was reduced compared with serial algorithm.
该算法使得进程间有良好的负载平衡,相对于串行算法来说,大大降低了时间复杂度。
The usual sequential shortest path algorithms executing on sequential computer have nearly reached their time complexity limits.
针对通常的串行计算机的串行最短路径算法,几乎已经到达了理论上的时间复杂度极限。
The time complexity of online recommendation was the key indicator to measure recommend algorithm in real recommendation system.
在实际的推荐系统中,在线推荐的时间复杂度是衡量推荐算法的主要指标。
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.
针对原有算法,本文提出了优化算法,大大改善它的时间和空间复杂度。
应用推荐