除理论之外，这种专注表现在本身复杂性的理论，它根据它们运行的时间和空间需求来组织算法。
At the theoretical end, this focus manifests itself in complexity theory, which groups algorithms according to their time and space requirements for execution.
而在使用相同方法的其他算法中，采用有效的棋盘表现方法是一个介于复杂性，速度和空间需求之间的权衡。
In the same way as other algorithms, the use of efficient board representations is a tradeoff between complexity, speed, and space requirements.
此外，这种算法具有最优的时间和空间复杂性。
Additionally the algorithm has the optimal time and space complexity.
本文提出了一种基于宽度优先搜索的路径生成算法，具有较好的时间复杂性和空间复杂性。
This article gives an algorithm of building search path, which has a more efficient space and time complexity.
各种搜索算法的复杂性是以时间、空间和解路径的长度来衡量的。
The complexities of various search algorithms are considered in terms of time, space, and cost of solution path.
基于数学模型，提出直接搜索的转换方法，节省了运算空间，降低了算法的时间复杂性，提高了规则生成的效率。
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.
此外，这种算法具有最优的时间和空间复杂性。
Additionally the algorithm has the optimal time and space complexity. Experime...
但由于空间物体形状的复杂性，因而，模型的建立即算法就成为人们争相研究的课题，本文给出了一种基于最小二乘法推导出来的理论模型。
Because of the complexity of the object's shapes, made model is studied by the scholars. In the article, the theory model based on the least square method induced is presented.
计算的复杂性理论研究算法的时间复杂性和空间复杂性。
The computing complexity theory discusses the time complexity and the space complexity of the algorithms.
证明了基于并行计算的线性空间算法的在进行长序列比对时，时间复杂性优于经典的线性空间算法。
It testified that linear space algorithm based on parallel computing is superior to classical linear space algorithm in time complexity.
算法的时间和空间复杂性都是和组成形体的面数成线性关系的。
The complexity of the algorithm is proportional to the face num…
算法的时间和空间复杂性都是和组成形体的面数成线性关系的。
The complexity of the algorithm is proportional to the face num…
应用推荐