计算的复杂性理论研究算法的时间复杂性和空间复杂性。
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.
此外还给出了若干个基于广义二叉链表的算法设计，并分析了算法的时间复杂性。
Furthermore, some algorithm of the GBLL is offered and their complexities of the time are analyzed.
从理论分析和数据实验两方面都表明，此算法的时间复杂性和精度都与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.
该算法的时间复杂性是线性的，模拟结果表明多播路由算法的多播时间步接近网络的直径。
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.
利用该算法对线性预测系统的自相关数字电路进行了实验，并对算法的时间复杂性做了分析。
By utilizing this algorithm, we did an experiment about autocorrelation data circuit of linear forecast system and analyzed the tune complexity of the algorithm.
我们称为维护问题，并提出恒定时问维护的概念，即维护问题算法的时间复杂性与数据库大小无关。
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.
基于数学模型，提出直接搜索的转换方法，节省了运算空间，降低了算法的时间复杂性，提高了规则生成的效率。
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.
除理论之外，这种专注表现在本身复杂性的理论，它根据它们运行的时间和空间需求来组织算法。
At the theoretical end, this focus manifests itself in complexity theory, which groups algorithms according to their time and space requirements for execution.
此外，这种算法具有最优的时间和空间复杂性。
Additionally the algorithm has the optimal time and space complexity.
给出了线性八叉树的平移和旋转算法，它们都有线性的时间复杂性。
Algorithms for translation and rotation of linear octree were presented which have linear complexity in time.
提出基于光交换互连系统(otis)网络结构的矩阵乘并行算法，分析它的时间复杂性。
A parallel algorithm for matrix multiplication based on optical transpose interconnection system (OTIS) network is proposed, and the time complexity is analyzed.
该文在考虑过程神经网络对时间聚合运算的复杂性的基础上，提出了一种基于函数正交基展开的学习算法。
In consideration of the complexity of the aggregation operation of time in process neural networks, a new learning algorithm based on function orthogonal basis expansion is proposed.
此算法具有比BF算法更优越的时间复杂性，并且相对KMP算法而言更简洁易懂。
This new algorithm has some advantage of less time complexity than BF algorithm and more simple than KMP algorithm.
线性八叉树编码是一种有效的表示三维物体的方法。给出了线性八叉树的平移和旋转算法，它们都有线性的时间复杂性。
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.
本文提出了一种基于宽度优先搜索的路径生成算法，具有较好的时间复杂性和空间复杂性。
This article gives an algorithm of building search path, which has a more efficient space and time complexity.
本文介绍了映射式排序算法，这种算法附加一定的存储开销，时间复杂性为O (N)。
This paper introduces a map sort algorithm with extra memory cost, its time complexity is o (n).
各种搜索算法的复杂性是以时间、空间和解路径的长度来衡量的。
The complexities of various search algorithms are considered in terms of time, space, and cost of solution path.
此外，这种算法具有最优的时间和空间复杂性。
Additionally the algorithm has the optimal time and space complexity. Experime...
并且对这两类问题都研究了他们的计算复杂性并给出了最优算法或者多项式时间近似算法。
For both problems, we study their computational complexity and present optimal algorithms or polynomial time approximation algorithms.
本算法充分利用了系统的可测性电路及资源，测试复杂性较低，执行时间短，故障定位精度也较高。
The testability resource of hardware is fully considered, so that the test complexity and testing time are largely reduced and fault location is well sa…
本文先设计了求解最坏情形下旅行时间最短的标号算法并分析了其计算复杂性。
In the worst case performance analysis, the paper devised an algorithm to get the optimal worst case travel time and the...
在论文的第一章里，首先简要介绍了组合优化，计算生物学问题，算法和时间复杂性等基本概念。
In Chapter 1, we give a brief introduction for combinatorial optimization, computational biology and algorithm analysis.
证明了基于并行计算的线性空间算法的在进行长序列比对时，时间复杂性优于经典的线性空间算法。
It testified that linear space algorithm based on parallel computing is superior to classical linear space algorithm in time complexity.
实际系统的计算结果表明，此算法的迭代收敛次数稳定，与系统规模关系不大，在求解大规模系统无功优化问题时，其性能优于具有指数时间复杂性的单纯性法。
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...
算法的时间和空间复杂性都是和组成形体的面数成线性关系的。
The complexity of the algorithm is proportional to the face num…
算法的时间和空间复杂性都是和组成形体的面数成线性关系的。
The complexity of the algorithm is proportional to the face num…
应用推荐