幼稚的声明翻译会导致执行算法时间复杂度高。
Naive translation of declarations leads to executable algorithms with high time complexity.
给出该求解方法的聚类算法描述及算法时间复杂度分析。
It gives the algorithm based on the proposed method and the time complexity analysis.
通过递归实例，介绍了递归算法时间复杂度的一类分析方法。
Using real example of recursion, we introduce a type of analysis method of recursion algorism's time complexity.
以联动轴数作为输入考察插补速度，算法时间复杂度是对数阶的。
The algorithm running time is a logarithmic function of the number of linkage axes.
算法时间复杂度较低，符合网络路由算法在响应时效性方面的特殊要求。
The time complexity of this algorithm is low, and it live up to the especial request in response time.
它解决了原算法中否定安全凭证的问题，并且通过与原算法时间复杂度与空间复杂度的比较，证明此算法更加简单快捷。
It solves the negative credentials, compared with the time and space complicated degree of the original arithmetic, the algorithm is more simple and shortcut.
他解决了原算法中否定安全凭证的问题，并且通过与原算法时间复杂度和空间复杂度的比较，证明此算法更加简便快捷。
It solve the negative credentials, compared with the time and space complicated degree of the original algorithm, prove the algorithm more simple and shortcut.
我需要得到此算法的时间复杂度，那就明确地给出其，运行时间。
I ask you for the running time of this algorithm and you give me the running time in terms of the running time, right.
针对通常的串行计算机的串行最短路径算法，几乎已经到达了理论上的时间复杂度极限。
The usual sequential shortest path algorithms executing on sequential computer have nearly reached their time complexity limits.
本文设计实现的一种专用于计算分支定界算法的机群计算平台，能减少分支定界算法的计算时间复杂度，提高分支定界算法的效率。
In this thesis, the design and realization of a special cluster are presented for calculating branch and bound algorithm that can decrease the calculating time and enhance the algorithmic efficiency.
讨论算法的时间复杂度时，“恒定分摊时间”是个什么鬼？
What is meant by "Constant Amortized time" when talking about time complexity of an algorithm?
实验证明该算法的时间和空间复杂度都在可接受的范围。
The experiment proved that the time and spacial complexity of the algorithm is acceptable.
为了解决这个问题，本文提出一种新的模式合一算法，共时间复杂度为线性的。
To solve the problem, this paper proposes a new pattern unification algorithm, which time complexity is linear.
实验结果表明，改进后的算法降低了时间复杂度，提高了系统检测效率。
The improved algorithm can reduce time complexity and increase the checking efficiency of the system by experiment.
编写利用上述定义的堆进行排序的算法，并分析推导算法的时间复杂度。
Prepared using the above definition of the heap for sorting algorithms, and analysis of the algorithm is derived time complexity.
重要的是，算法保证在一系列的操作之后，耗时昂贵的操作时间被分摊，从而使整改操作的时间复杂度为O（1）。
What is important is that the algorithm guarantees that after a sequence of operations the expensive operations will be amortised and thereby rendering the entire operation O(1).
并提出改进的值约简算法，时间复杂度在原有基础上大大减少。
And putting forwarded the improved algorithm of value attribute reduction that decreases the complexity of time greatly.
最后，本文还给出了LDST与线性四叉树之间的转换算法及时间复杂度分析。
The conversion algorithm between LDST and linear quadtree and its time complexity analysis are also studied at the end of the paper.
该算法的时间复杂度为O (N)，且附加存储空间极小，特别适合于数据量大的场合。
Its time complexity is o (n), and its appended storage space is very small. The algorithm particularly suits to the situation of large amounts of data.
给出一个算法计算n ！，分析它的时间复杂度。
Give an algorithm to compute n! And analyze its running time.
一直以来，最优解的排课算法的时间复杂度大多是排课规模的指数阶。
The complexity of optimum-solution schedule arrangement algorithm has almost been exponent degree of schedule scale.
实验结果表明，该算法有效地降低了时间复杂度，具有一定的实用性。
The experimental result shows that the algorithm can reduce time complexity effectively and has definite practicability.
提出了一种新的动态路由和波长分配算法，对算法的时间复杂度进行了分析。
A new dynamic routing and wavelength assignment algorithm is proposed and the time complexity of the algorithm is analyzed.
在该算法中，还使用了一定的剪枝策略，使得算法的时间复杂度进一步降低。
Besides, in this algorithm, we have used some strategy of pruning, which make the algorithm's time complexity more lower.
该分解算法的计算时间复杂度远小于经典粗糙集约简算法的计算时间复杂度，在提高计算速度的同时不会损失信息量。
Time complexity of this decomposition algorithm is far less than the classical reduction method in RST, speed of calculation is raised and information are not loss.
文章分析了算法的时间复杂度，并同粗糙集算法进行了对比。
We analyze the time complexity of algorithm and compare it with Rough sets based algorithm.
文中给出了二维网格结构的计算机上求平面上一组不相交简单物体透视困的算法，并给出了算法的时间复杂度。
An algorithm for determining the perspective view of a set of disjoint simple objects in the plane on a two-dimensional mesh computer is presented with its time complexity given.
传统的利用区分矩阵进行属性约简算法，其时间复杂度和空间复杂度很大。
The time complexity and space complexity of the traditional attribute reduction algorithm using discernible matrix are quite big.
在层次图边交叉最小化问题上，常规启发算法或者时间复杂度大或者布图效果不佳。
On the issue of crossing minimization, either time complexity or result of the conventional heuristic algorithm is unsatisfactory.
在层次图边交叉最小化问题上，常规启发算法或者时间复杂度大或者布图效果不佳。
On the issue of crossing minimization, either time complexity or result of the conventional heuristic algorithm is unsatisfactory.
应用推荐