The new algorithm only needs an array whose size is n, so the space complexity is O ( n).

In view of the fact that ventilation simulation system that has certain requirements on real time property should satisfy the spatio temporal complexity, it is proposed to use a multi agent based system.

针对实时性有一定要求的通风仿真系统中必须满足的时间和空间复杂度要求，提出了一种基于多Agent系统的分析和解决方案。

互联网摘选

For how to construct a MIB tree, we propose two algorithms, and the two algorithms time complexity and space complexity of a detailed analysis and comparison.

对于如何构造MIB树，论文提出了两种算法，并对这两种算法的时间复杂度和空间复杂度做了详细的分析和比较。

互联网摘选

Access control is the key problem in a hierarchy system. An access control scheme based on Lagrange's interpolation polynomial is proposed, and the property is analyzed from the view of time and space complexity.

本文基于Lagrange插值多项式，提出了等级系统中的一个访问控制方案，并从空间复杂度和时间复杂度角度分析了其性能。

互联网摘选

The computational complexity on time and space of the proposed algorithm are both O ( n), which are both smaller than those of the classical algorithms.

该算法能快速有效地求解可分离连续凸二次背包问题的最优解，算法的时间复杂度和空间复杂度都是O（n），都比经典算法节约很多。

互联网摘选

The space complexity of the algorithm is only O ( n) while the time complexity approximates to O ( n2? logn).

该算法的空间复杂度仅为O（n），时间复杂度近似为O（n2·logn），且预测结构有较好的精度。

互联网摘选

And it optimizes these steps of re-sampling, calculating weight and MCMC algorithm on the software implementation, which greatly reduces the space and time complexity of algorithm.

其在软件实现上改善了重采样策略，权值计算步骤以及MCMC步骤，大大降低了算法空间复杂度与时间复杂度。

互联网摘选

And its time complexity is O ( m' D' log n).

且算法的时间复杂度为O（m｜D｜log N）。

互联网摘选

The result of our tests explains that the algorithm to solve the triangles packing problem by using personification approach is of high efficiently and low complexity.

实验结果表明，沿此途径得出的求解三角形Packing问题的算法，针对三角形数目较多的情况，具有较好的完整性和较低的时间复杂度。

互联网摘选

All these algorithms run in O ( logn) time using O ( n) processors, where n is the number of vertices in the tree.

对n个顶点的树，以上算法均使用O（n）个处理机，时间复杂度为O（logn）。

互联网摘选

The triangles packing problem is NP-hard. The complexity of their accurate algorithm is exponential.

三角形Packing问题是NP难的，其完整算法的时间复杂度是指数型的。

互联网摘选

We will compare some of the algorithms using the number of recursive calls to enumerate C_n sequences as a measure of time complexity.

然后，以各个算法生成C n个编码所需要的平均递归调用次数作为时间复杂度对比的尺度，对几个主要的编码生成算法进行了对比分析。

互联网摘选

The time complexity for this filtering or query is only linear function O ( N) of cardinality N.

这种过滤查询的时间复杂度仅是关系基数N的线性函数O（N）；

互联网摘选

The time complexity of preserved GA in common use for global convergence is discussed.

讨论了一种常用全局收敛GA&最优保留GA收敛到全局最优解的时间复杂度问题；

互联网摘选

However, the time required in a direct algorithm of k-means method is sensitive to the number of patterns.

但是，k-means直接算法的时间复杂度和模式复杂度对数据量的大小非常敏感，无法满足一些高性能的应用场合，如个性化服务中对用户数据进行的群组分析。

互联网摘选

UD-TDMA algorithm has a time complexity of O ( n), where n is the maximum degree of two hop neighbor node sets.

算法的时间复杂度为O（n），其中n为2跳邻居节点集的度的最大值。

互联网摘选

A route planning algorithm for the shortest distance in a restricted searching area, with a time complexity O ( n) is proposed ( n being the number of nodes in the road net).

提出一种时间复杂度为O（n）的限制搜索区域距离最短路径规划算法（n为路网节点数）。

互联网摘选

The time ′ s complexity to find an optimal solution is O ( 2~ n) in classic multi-user detection.

经典的多用户检测技术，其求解最优解的时间复杂度为O（2n），这是一个NP难解问题。

互联网摘选

Time space of the algorithm is less than O ( n)( n is the length of the text).

算法的时间复杂度小于O（n）（其中n为进行匹配的文本串长度）。

互联网摘选

A Corrigendum to the Time Complexity of Multicast Routing Algorithm MPH

多播路由算法MPH的时间复杂度研究

互联网摘选

The time complexity of indexing data with trained neural network is O ( n).

利用训练后的神经网络对增量数据进行索引的时间复杂度为O（n）。

互联网摘选