您要查找的是不是:
- By studying current sequential algorithms, this paper presents two parallel algorithms with O(lg~2n) and O(lgn) time complexities for computing reversal distance of signed permutation and a linear time parallel algorithm for reversal sorting. 基因组序列在遗传过程中最常见变异现象为部分子序列翻转。 通过对翻转排序问题串行算法的研究,在PRAM模型和LARPBS模型上分别设计出时间复杂度为O(lg~2n)和O(lgn)的并行计算有向符号序列翻转距离算法(n为序列的长度);
- linear time complexity 线性时间复杂度
- As a result of the ingenuity of memory structure,its complexity of the time can be linear time N in the best situation and that is O(N2)in the worst case. 由于存储结构的巧妙性;算法的时间复杂度在最好的情况下为线性时间N;在最坏的情况下为O(N2).
- It discusses ACA's time complexity and space complexity. 讨论了它们的时间复杂度和空间复杂度。
- This will come swiftly and will not be measured in linear time. 这将很快来到而将不会在线性时间里被测量。
- Introduction, algorithm, ADT, space and time complexity, binary search, etc. 课程介绍;算法概念;数据抽象;性能分析。
- The cycles makes is appear as linear time in sequence and synchronicity. 这个周期就制造了像按顺序和同步性运作的线性时间。
- A linear time algorithm for producing such a coloring is presented also. 论文还给出了寻找这样一种着色的线性时间的算法。
- 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. 仿真结果表明,该算法得到的多播路由树具有较小的费用,平均路径延迟也比较小,并且避免了其它同类算法的高复杂性。
- In this paper, we study the minimum-weight feedback vertex set problem in outerplanar graphs and present a linear time algorithm to solve it. 本文主要考虑外平面图中的反馈点集并给出了一个求外平面图最小顶点赋权反馈点集的线性时间算法。
- The test results show that the algorithm makes better improvement in time complexity than the other vertic... 实验表明,随着节点数的增加,该算法与文献[8]中的纵向合并算法相比,其时间性能有明显改善。
- The Waveform and Spectrum of Input and Output Random Processes of A Linear Time Invariant System. 输入与输出线性非时变系统之随机电压其波形及频谱。
- The results are better than the previous works either in time complexity or in their elegancy. 其结果不论在收敛速度或演算法精简度上都超越既有的方法。
- Linear time size : The intrusive container doesn't hold a size member that is updated with every insertion/erasure. 线性时间的size:此类介入式容器不存在一个在每次插入/删除时更新的size成员。
- Compared with the quadtree structure, the algorithm has the easier time complexity and space complexity. 同时该算法的时间复杂度和空间复杂度均低于采用四叉树结构来压缩二值图像。
- Coding DTD can test the logical implication problem of XML function dependency in linear time. 编码后的DTD能在线性时间内对XML函数依赖的逻辑蕴涵问题进行判定。
- Compared with algorithms based on discernibility matrix, EDMAR is much less both space complexity and time complexity. 数据约简是粗糙集理论中一个非常重要的研究课题。