algorithm complexity的例句大全

Additionally, the new algorithm has time complexity of O ( N).

而且此算法时间复杂度为O（N）。

A Corrigendum to the Time Complexity of Multicast Routing Algorithm MPH

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

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为路网节点数）。

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跳邻居节点集的度的最大值。

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

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

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步骤，大大降低了算法空间复杂度与时间复杂度。

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

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

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 new algorithm only needs an array whose size is n, so the space complexity is O ( n).

新算法仅需要一个大小为n的一维数组，空间复杂度为O（n）。

In essence, TIC achieves the best tradeoff between time and space complexity by balancing workload of computation and memory access, which ensures that the TIC algorithm has good scalability on multi-core architectures.

从本质上说，TIC通过平衡算法的计算负载和访存负载，在时间和空间复杂度上取得了最佳的折衷，从而保证了算法在多核结构上具有良好的可扩放性。

All these make the algorithm more efficient. The space complexity of the algorithm is O ( N).

该算法的空间复杂度为O（N）；

Third, the convergence and supremum of the algorithm were proved, and the asymptotic time complexity was analyzed;

并分析了该算法的收敛性及渐进时间复杂度；

This paper specifically demonstrates the discrete-marking principle, factors and the identified rule of self-adaptability discrete step criteria, and it also analyses the asymptotic time complexity and space complexity in auto-support generation algorithm based on discrete-marking method.

详细阐述了离散标识法的原理、影响因素、自适应性离散步长的确定准则，分析了离散标识法快速支撑生成技术的渐进时间复杂度和空间复杂度。

Experiments show that the algorithm is of practical value and its asymptotic time complexity is O ( 1).

由于散列均匀，其渐近时间复杂度为O（1）。

Compared with the classical algorithm, this algorithm is simple, with close asymptotic time complexity ( O ( n+ e~ 2/ n)).

同经典算法相比，该算法简单，时间复杂度相近（O（n+e2/n））。

A high efficiency algorithm on which asymptotic time complexity is O ( n) on loopy moving of array element is given in this paper, and some skills and techniques are provided with Pascal language.

给出一种时间复杂度为O（n）的一维数组循环移动的高效算法，并给出用PASCAL语言实现的方法及技巧。

The binary searching algorithm based on comparison have the complexity of O ( NlogN).

处理汉字的以比较为基础的二分查找算法，其复杂性为O（NlogN）。

The hardware cost of this network is O ( NlogN). and the time complexity of this multicast algorithm is O ( N).

此类的网络的硬件代价为O（NlogN），此多源点多播路由算法的时间复杂度为O（N）

It is proved that the time complexity of the algorithm is 0 ( AT) in general and O ( NlogN) at worst cases.

推导证明了综合算法在一般情况下的时间复杂度为O（N），最坏情况下的时间复杂度为O（NlogN）。

The algorithm can decompose a complex planar polygon with nesting holes, and its time complexity is O ( nlogn) by analysis and testing.

该算法能够分解内嵌多个环的复杂多边形，分析及测试表明，其时间复杂度为O（nlogn）。