分析了计算过程的时间复杂性。
然而，处理更大的时间复杂性从来没有覆盖。
However, dealing with larger time complexities was never covered.
计算时间复杂性是演化理论中的一个重大课题。
The computational time complexity is an important topic in the theory of evolutionary algorithms.
着重证明了K -树组法为多项式时间复杂性算法。
It is proved that K-Tree Term method is a multinomial time complexity algorithm.
计算的复杂性理论研究算法的时间复杂性和空间复杂性。
The computing complexity theory discusses the time complexity and the space complexity of the algorithms.
理论分析表明，该算法的时间复杂性接近于线性复杂度。
The theoretic analysis demonstrates that the time complexity of this algorithm is approximately linear.
包围盒层次是解决碰撞检测问题固有的时间复杂性的一个有效途径。
Bounding volume hierarchy provides an effective method to resolve the intrinsic time complexity in collision detection.
给出了线性八叉树的平移和旋转算法，它们都有线性的时间复杂性。
Algorithms for translation and rotation of linear octree were presented which have linear complexity in time.
此外还给出了若干个基于广义二叉链表的算法设计，并分析了算法的时间复杂性。
Furthermore, some algorithm of the GBLL is offered and their complexities of the time are analyzed.
此算法具有比BF算法更优越的时间复杂性，并且相对KMP算法而言更简洁易懂。
This new algorithm has some advantage of less time complexity than BF algorithm and more simple than KMP algorithm.
从理论分析和数据实验两方面都表明，此算法的时间复杂性和精度都与LU分解法相当。
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.
本文介绍了映射式排序算法，这种算法附加一定的存储开销，时间复杂性为O (N)。
This paper introduces a map sort algorithm with extra memory cost, its time complexity is o (n).
提出基于光交换互连系统(otis)网络结构的矩阵乘并行算法，分析它的时间复杂性。
A parallel algorithm for matrix multiplication based on optical transpose interconnection system (OTIS) network is proposed, and the time complexity is analyzed.
该算法的时间复杂性是线性的，模拟结果表明多播路由算法的多播时间步接近网络的直径。
The running time of the algorithm is linear. Simulation results show that the time steps of the algorithm are very close to the network diameter in practice.
本文提出了一种基于宽度优先搜索的路径生成算法，具有较好的时间复杂性和空间复杂性。
This article gives an algorithm of building search path, which has a more efficient space and time complexity.
利用该算法对线性预测系统的自相关数字电路进行了实验，并对算法的时间复杂性做了分析。
By utilizing this algorithm, we did an experiment about autocorrelation data circuit of linear forecast system and analyzed the tune complexity of the algorithm.
后者的计算时间复杂性远远低于2N（N为图的顶点数） ，已接近于多项式时间复杂性。
The computational complexity of the improved algorithm approaches polynomial complexity, much less than 2 N ( N is the vertex number of a graph).
本文针对时间复杂性的计算提出了几种可行的计算方法，并就这些方法作了简要的推导和分析。
A few approaches available are presented to estimate the time complexity in this paper, also, their induction and analysis.
在论文的第一章里，首先简要介绍了组合优化，计算生物学问题，算法和时间复杂性等基本概念。
In Chapter 1, we give a brief introduction for combinatorial optimization, computational biology and algorithm analysis.
我们称为维护问题，并提出恒定时问维护的概念，即维护问题算法的时间复杂性与数据库大小无关。
We propose a notion of constant time maintenance, according to which the maintenance algorithm runs in time independent of the size of the database state.
证明了基于并行计算的线性空间算法的在进行长序列比对时，时间复杂性优于经典的线性空间算法。
It testified that linear space algorithm based on parallel computing is superior to classical linear space algorithm in time complexity.
该模型基于求解整数线性规划问题的分枝定界方法，具有求解并行、目标驱动、时间复杂性低等特点。
The model is based on "Branch Bound" method which is used to solving the problem of integer linear programming, and it has the characters of parallel computing, goal driving and less time complicacy.
有序桶目录使这一结构既可用于单记录直接检索，又可方便地进行批量记录顺序检索，而时间复杂性没有增加。
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.
基于数学模型，提出直接搜索的转换方法，节省了运算空间，降低了算法的时间复杂性，提高了规则生成的效率。
Based on the model, direct search method is presented which can save the computing space and CPU occupation time, enhance the efficiency of decision rules generation.
线性八叉树编码是一种有效的表示三维物体的方法。给出了线性八叉树的平移和旋转算法，它们都有线性的时间复杂性。
Linear octree encoding provides a effective way for tridimensional of objects. Algorithms for translation and rotation of linear octree were presented which have linear complexity in time.
实际系统的计算结果表明，此算法的迭代收敛次数稳定，与系统规模关系不大，在求解大规模系统无功优化问题时，其性能优于具有指数时间复杂性的单纯性法。
The computation results of practical power systems show that the number of iterations of this algorithm is independent of system's size, and it is superior to simplex...
将会需要一个时间，以思考这一事件的细节和复杂性，但是对大多数美国人而言，不是在现在。
There will be a time to think about the nuance and complexity of this event, but for most Americans now is not it.
这样大大减少了调试时间和复杂性。
This considerably reduces the debugging time and complexity.
我认为，这将是人类所要学的最难的一课：有机的复杂性将需要有机的时间。
I think this will be the hardest lesson for humans to learn: that organic complexity will entail organic time.
除理论之外，这种专注表现在本身复杂性的理论，它根据它们运行的时间和空间需求来组织算法。
At the theoretical end, this focus manifests itself in complexity theory, which groups algorithms according to their time and space requirements for execution.
应用推荐