分析了算法的复杂性和普遍性。
The complexity and generality of the algorithm were analyzed.
最后讨论了算法的复杂性。
由于该算法的复杂性，应用中受到了限制。
With the complexity of the algorithm, the application has been limited.
随后对串并两种算法的复杂性进行了分析和比较。
Then the complexity of the two algorithms is analyzed and compared.
文中也给出了实现算法，并分析了算法的复杂性。
The implementation algorithm and the analysis of the algorithm are also provided.
并给出了矩形区域查询算法，分析了算法的复杂性；
The retrieval algorithm with the rectangle area qualification has been derived, and the complexity of the algorithm has been also analyzed.
文中也给出了并行实现算法，同时分析了算法的复杂性。
The parallel implementation algorithm and tile analysis of the algorithm are also provided.
文中也给出了并行实现算法，同时分析了算法的复杂性。
The parallel implementation algorithm and tile analysis of the algorithm are also provide...
不同的编程语言之间的最大区别，实质在于算法的复杂性。
The biggest distinction normally comes down to algorithmic complexity.
不过我很好奇，怎么办的您的计算或近似您算法的复杂性？
But I'm curious, how do you calculate or approximate the complexity of your algorithms?
同时为降低二维阈值算法的复杂性，提出了快速递推算法。
Then we presents an undistorted fast recursion algorithm and a distorted optimal search strategy.
文章也给出了本技术的完整实现算法并分析了算法的复杂性。
The whole implementation algorithm and the complexity analysis of the algorithm are also provided.
给出了基本模型和算法，并评估了该算法的复杂性和优缺点。
This paper introduces the basic model and the algorithm of the rule which is then evaluated.
采用按比例增减的方法是最好的，但那会极大地增加算法的复杂性。
It would be best to reward on a sliding scale, but that would increase the complexity of the algorithm significantly.
各种搜索算法的复杂性是以时间、空间和解路径的长度来衡量的。
The complexities of various search algorithms are considered in terms of time, space, and cost of solution path.
随后分析建立过程中算法的复杂性，并在该基础上提出了优化方法。
Then it computes the complexity of the setup process and discusses the optimized algorithm of the setup process of the SSC.
最后给出了固定窗口算法的复杂性分析，并讨论了窗口宽度的最佳选取。
The complexity analysis of the fixed window algorithm and the optimal length of window are also discussed.
由于算法的复杂性和应用场合的实时性，这两个部件一般都采用硬件来实现。
Because of the complexity of algorithm and the real time requirement of application, these two components are realized in hardware.
属性选择是机器学习的核心问题之一，它关系到归纳算法的复杂性和学习性能。
The selection of attributes, which involves the complexity and performance of induction algorithms, is.
本文根据计算机网络中窗口流控的分析，得出了几个实用的算法，这些算法的复杂性较低，精度较高。
According to the analysis of window flow control in computer networks, some applicable algorithms with lower computing complexity and higher computation accuracy are proposed.
在此基础上，通过分析通用图灵机带头移动的次数，讨论了通用图灵机上任一求解RHC的算法的复杂性。
Secondly, we discuss the complexity any algorithm solving RHC presents by counting the moving times of the tape head on turning machine.
本文将首先建立求解这一问题的网络模型，然后给出相应的算法，最后，对算法的复杂性给予简单的分析。
In this paper, a network model is presented and an algorithm is worked out to solve this problem. At last, the complexity of the algorithm is simply analyzed.
通过分析对比该算法与完全搜索算法和传统贪心算法的复杂性，证明了其在故障告警域重叠度较小情况下的有效性。
The complexity of GCDG is compared with both exhaustive search algorithm and traditional greedy search algorithm, and then its efficiency is proved in the small alarm overlapped domain.
通过对字符串模式匹配BF和KMP算法的分析，提出了改进KMP扫描算法的方法，并通过对算法的复杂性进行分析，结果表明：改进后的算法KMPA比算法KMP更有效。
KMP scan algorithm is improved by means of the analysis of string pattern matching BF and KMP. The complexity analysis reveals that the improved algorithm, KMPA, is more effective than KMP.
除理论之外，这种专注表现在本身复杂性的理论，它根据它们运行的时间和空间需求来组织算法。
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.
一些社交软件使用非常复杂的算法，比如Gigg或FriendFeed上那些用于排列提交条目重要性的算法，但这一技术复杂性应该对用户隐藏。
Some social software use very complex algorithms, e.g. those used for ranking the importance of submitted items on Gigg or FriendFeed, but this technical complexity should be hidden from users.
从理论分析和数据实验两方面都表明，此算法的时间复杂性和精度都与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.
用于格式化和分发的建议CPU数量取决于格式化算法和分发日志记录设置的复杂性。
The recommended number of CPUs for formatting and distribution depends on the complexity of the formatting algorithm and of the distribution logging settings.
用于格式化和分发的建议CPU数量取决于格式化算法和分发日志记录设置的复杂性。
The recommended number of CPUs for formatting and distribution depends on the complexity of the formatting algorithm and of the distribution logging settings.
应用推荐