您要查找的是不是：
- It discusses ACA's time complexity and space complexity. 讨论了它们的时间复杂度和空间复杂度。
- Introduction, algorithm, ADT, space and time complexity, binary search, etc. 课程介绍；算法概念；数据抽象；性能分析。
- But they still have disadvantages, such as high time complexity and the requirement of "num +". 但是它有算法时间复杂度比较高，需要预先设置正负例比例等不足。
- This paper introduces a map sort algorithm with extra memory cost, its time complexity is O(N). 本文介绍了映射式排序算法,这种算法附加一定的存储开销,时间复杂性为O(N)。
- The time-constrained algorithm has time complexity of O(n 2),where n is the number of nodes in the DFG. 该算法的时间复杂性为O(n2 ) ;n是DFG图中的结点个数 .
- Simulation shows that the algorithm can obtain less cost and mean path delay, it also has low time complexity. 仿真结果表明,该算法得到的多播路由树具有较小的费用,平均路径延迟也比较小,并且避免了其它同类算法的高复杂性。
- The test results show that the algorithm makes better improvement in time complexity than the other vertic... 实验表明,随着节点数的增加,该算法与文献[8]中的纵向合并算法相比,其时间性能有明显改善。
- The results are better than the previous works either in time complexity or in their elegancy. 其结果不论在收敛速度或演算法精简度上都超越既有的方法。
- Compared with the quadtree structure, the algorithm has the easier time complexity and space complexity. 同时该算法的时间复杂度和空间复杂度均低于采用四叉树结构来压缩二值图像。
- Compared with algorithms based on discernibility matrix, EDMAR is much less both space complexity and time complexity. 数据约简是粗糙集理论中一个非常重要的研究课题。
- Quick sort and merge sort have the same time complexity on average cases but differ on the worst cases. 快速排序和归并排序在一般情况下有相同的时间复杂度，但是在最坏情况下却有所不同。
- It is not by chance that problems with exponential time complexity are called intractable. 具有指数时间复杂度的问题被视为棘手并非偶然。
- This algorithm uses scene division to simplify the problem of occluding and reduce the time complexity. 算法利用场景分块重建来简化遮挡问题，降低了时间复杂度；
- Besides, used some strategy of pruning, which made the algorithm's time complexity more lower. 在本算法中，还使用了一定的剪枝策略，使得算法的时间复杂度进一步降低。
- This new algorithm has some advantage of less time complexity than BF algorithm and more simple than KMP algorithm. 此算法具有比BF算法更优越的时间复杂性,并且相对KMP算法而言更简洁易懂。
- The time complexity of this algorithm is low, and it live up to the especial request in response time. 算法时间复杂度较低,符合网络路由算法在响应时效性方面的特殊要求。
- Accordingly, this paper offered optimized algorithm for reduction of knowledge, of which time complexity was polynomial. 在此基础上提出了优化的知识约简算法，该算法的时间复杂度是多项式的。
- Design an algorithm to move the N elements in an array cyclically from left to right for K times.The time complexity of algorithm should be O(N). 在程序中经常需要定义一组相关并且数量固定的常量，如颜色列表、一周的每一天等，枚举类型就是用于定义类似常量的。
- Apart from improving definition of rule termination decision and reducing time complexity, we can make it as theory base to studying ECA Active Rule. 这一算法提高了规则可终止性判定的精确度，降低了时间复杂度，可以作为进一步主动规则分析的理论基础。
- Negotiation procedure under this strategy can obtain balanceable and pareto optimal results, whose time complexity is lower. 利用该策略，协商过程能获得平衡解和帕累托最优解，且时间复杂性较低。
