它将从预定的有效命令行选项列表和时间复杂度为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).
IsValidCommandLineOption的查找时间复杂度为o (1)。
IsValidCommandLineOption has a lookup time complexity of o (1).
我需要得到此算法的时间复杂度，那就明确地给出其，运行时间。
I ask you for the running time of this algorithm and you give me the running time in terms of the running time, right.
perfectproperty：查找时间复杂度为o(1)的表条目—就是说，至多需要一个字符串比较执行静态搜索集中的关键字识别。
Perfect property: Locating a table entry requires o (1) time-that is, at most, one string comparison is required to perform keyword recognition within the static search set.
这决定了Packrat解析的时间复杂度是线 性的，但是缺点是需要很大的内存，通常是源代码大小的几倍。
This allows for the runtime behavior to be linear, but has the downside of relatively large memory requirements, potentially multiple times the size of the input source.
本文设计实现的一种专用于计算分支定界算法的机群计算平台，能减少分支定界算法的计算时间复杂度，提高分支定界算法的效率。
In this thesis, the design and realization of a special cluster are presented for calculating branch and bound algorithm that can decrease the calculating time and enhance the algorithmic efficiency.
什么是时间复杂度和空间复杂度的字典？
针对通常的串行计算机的串行最短路径算法，几乎已经到达了理论上的时间复杂度极限。
The usual sequential shortest path algorithms executing on sequential computer have nearly reached their time complexity limits.
讨论算法的时间复杂度时，“恒定分摊时间”是个什么鬼？
What is meant by "Constant Amortized time" when talking about time complexity of an algorithm?
理论上已经证明要在多项式时间复杂度内对这一类问题找到全局最优解是不可能的。
The fact that it is impossible to find the global optimum in polynomial complexity has been proved.
重要的是，算法保证在一系列的操作之后，耗时昂贵的操作时间被分摊，从而使整改操作的时间复杂度为O（1）。
What is important is that the algorithm guarantees that after a sequence of operations the expensive operations will be amortised and thereby rendering the entire operation O(1).
最后分析了该方法在最好和最坏情况下的时间复杂度。
Finally, the time complexity in the best and the worst case was analyzed.
该方法有效地避免了一般复用距离分析可能导致的内存溢出问题，同时使得复用距离分析达到线性时间复杂度。
This method avoids possible memory overflow problem in normal reuse distance analysis, at the same time this method makes complexity of reuse distance analysis decrease to linear.
该方法关于数据库的大小、属性个数具有近似线性时间复杂度，这使得算法具有好的扩展性。
The method has the nearly linear time complexity with the size of dataset and the number of attributes. This results in good scalability.
提出了一种新的动态路由和波长分配算法，对算法的时间复杂度进行了分析。
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.
文章分析了算法的时间复杂度，并同粗糙集算法进行了对比。
We analyze the time complexity of algorithm and compare it with Rough sets based 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.
为了解决这个问题，本文提出一种新的模式合一算法，共时间复杂度为线性的。
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.
基于这种扩充有向图，提出了一种对象范式生成算法，并给出了算法的时间复杂度分析和正确性证明。
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.
编写利用上述定义的堆进行排序的算法，并分析推导算法的时间复杂度。
Prepared using the above definition of the heap for sorting algorithms, and analysis of the algorithm is derived time complexity.
并提出改进的值约简算法，时间复杂度在原有基础上大大减少。
And putting forwarded the improved algorithm of value attribute reduction that decreases the complexity of time greatly.
通过递归实例，介绍了递归算法时间复杂度的一类分析方法。
Using real example of recursion, we introduce a type of analysis method of recursion algorism's time complexity.
讨论了复数矩阵的数据结构和共轭转置运算的算法实现，并给出该算法的时间复杂度。
The paper deals with the data structure of plural matrix and the achievement of method about associate operation, and gives its complex degree of time.
这些样本点的求得能有效减少求解最小聚类的时间复杂度。
By working out such sample data the time complexity of figuring out min cluster is effectively reduced.
另外，还通过计算机实验，对置乱网络的遍历时间复杂度及其置乱性质进行了分析。
The paper also analyzed the time complexity and the scrambling performance of the new networks by computer experiments.
提出了一种基于条件信息熵的知识约简启发式算法，并指出该算法的时间复杂度是多项式的。
A heuristic algorithm based on conditional information entropy for knowledge reduction is proposed, and the complexity of this algorithm is analyzed.
提出了一种基于条件信息熵的知识约简启发式算法，并指出该算法的时间复杂度是多项式的。
A heuristic algorithm based on conditional information entropy for knowledge reduction is proposed, and the complexity of this algorithm is analyzed.
应用推荐