The computational time complexity is an important topic in the theory of evolutionary algorithms.
计算时间复杂性是演化理论中的一个重大课题。
Then, an iterative reasoning algorithm of TDCD is put forward, and its computational time complexity is analyzed.
在此基础提出了一种带时间延迟的因果图迭代推理算法，并分析了算法的时间复杂度。
For both problems, we study their computational complexity and present optimal algorithms or polynomial time approximation algorithms.
并且对这两类问题都研究了他们的计算复杂性并给出了最优算法或者多项式时间近似算法。
Simultaneously, the computational complexity of the proposed method is low enough to meet the requirements of the real time rate allocation at the video server.
同时，该算法的计算复杂度低，完全能满足视频服务器实时码率分配的要求。
Then an adaptive group of pictures structure according to characteristics of motion can increase the coding efficiency and reduce computational complexity and memory requirement at the same time.
然后，基于视频序列的运动特征，自适应确定帧组结构，在提高编码效率的同时降低内存需求和运算复杂度。
Experimental results show that the proposed algorithm can reduce computational complexity efficiently, and at the same time while, ensuring the search accuracy.
实验结果证明，该算法在降低计算复杂度的同时，还能有效地保证搜索精度。
This new method reduces the computational complexity by using the block tridiagonal structure of the input sample correlation matrix, and at the same time keeps the property of fast convergence.
在保持了该算法快速收敛优点的同时，利用相关矩阵块三对角的特殊结构，降低了该算法的计算复杂度。
To reduce computational complexity, the system captures the key-frames in fixed time interval.
为了减少计算量，本文采取了固定时间间隔提取关键帧的办法。
High computational complexity of time frequency atom decomposition (TFAD) limits its applications in signal processing.
计算量过大是制约时频原子分解算法在信号处理中应用的主要原因。
Meanwhile, the optimization also includes reducing the computational complexity of the query optimization of trimming, and query results combination which considered both space and time cost.
同时，优化中还包括降低计算复杂度的查询裁剪的优化，以及兼顾空间和时间开销的查询结果合并方式。
The experimental results show that the computational complexity reduce rapidly and the movement of interactive garment can be simulated in real-time.
实验结果证明，本文方法与传统的方法相比，大量减少了计算，完全可以实现随人体运动的交互式服装实时动画。
The result proved that the algorithm is at an advantage considering about both computational complexity and time-frequency concentration capability.
比较结果表明，该算法在运算复杂度与时频局域化能力综合考虑的前提下具有优势。
In addition, the proposed algorithm has low computational complexity, which can meet the requirement of transmitting signals on real time.
除此之外，该算法具有较低的计算复杂度，能够满足信号实时性传输的要求。
The comparison shows that the improved gray scale contrast function has simpler time computational complexity and higher focusing sensitivity.
实验对比表明，这种改进的灰度对比度函数，计算时间复杂度较简单，对焦灵敏度高。
Motion estimation is the most important and time-consuming part in H. 264. A large number of algorithms are based on the reduction of search points to reduce the computational complexity.
运动估计作为H . 264中最重要最耗时的部分，大量的算法研究都是通过减少搜索点数来降低计算量。
Motion estimation is the most important and time-consuming part in H. 264. A large number of algorithms are based on the reduction of search points to reduce the computational complexity.
运动估计作为H . 264中最重要最耗时的部分，大量的算法研究都是通过减少搜索点数来降低计算量。
应用推荐