片语

decrease computational complexity减少计算量

the computational complexity了计算复杂度

Computational complexity for physicists的翻译是物理学家的计算的复杂性

computational complexity of algorithm计算复杂性

computational time complexity计算时间复杂性

computational complexity scalable计算复杂度调整

Computational Complexity Reduction Ratio计算复杂度降低比

computational-complexity scalability计算复杂度分级

computational complexity theoryComputational complexity theory is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. A computational problem is understood to be a task that is in principle amenable to being solved by a computer, which is equivalent to stating that the problem may be solved by mechanical application of mathematical steps, such as an algorithm.

英汉例句

• Because the RGA computation is implemented based on the residue analysis, the proposed method can effectively reduce computational complexity and shorten signal selection process.

  由于是在留数分析的基础上进行RGA计算，因此，这种调制信号选取方法可有效降低计算量和缩短选取进程。

• Then, the sampling rate alteration method based on FIR filter with FRM structure, its architecture, computational complexity and the problem in designing are studied.

  并研究了基于此类FRM结构FIR滤波器的采样率变换算法、实现结构、计算复杂度及其设计问题等。

• Simulation results show the correctness and the effectiveness of the proposed method with low computational complexity and inflexibility to light intensity.

  仿真结果表明该算法是正确和有效的，并且算法不受光照条件的影响，同时具有较低的计算复杂度。

• The result has important significance to research and development in both number theory and computational complexity theory.

  这个结果对于数论和计算复杂性理论的研究与发展具有重要意义。

• Big-O notation: computational complexity theory USES big-O notation to describe how input-data size affects an algorithm「s use of computational resources.

  Big - onotation：计算复杂性理论使用大0符号描述输入数据大小如何影响计算资源对算法的使用。

• This article discusses the computational complexity of Traveling Salesman Problem, and points out the difference of computational complexity between Decisive TSP and Optimal TSP.

  讨论了货郎问题的计算复杂性，指出了货郎优化问题与货郎判定问题计算复杂性的差异。

• Numerical analysis and simulations show that this algorithm reduces the computational complexity significantly for the estimation of large frequency offset while maintains a good performance.

  理论分析和仿真表明该算法在保证估计精度的同时，可显着降低大频偏估计的计算复杂度。

• For both problems, we study their computational complexity and present optimal algorithms or polynomial time approximation algorithms.

  并且对这两类问题都研究了他们的计算复杂性并给出了最优算法或者多项式时间近似算法。

• This includes computability theory, computational complexity theory, and information theory.

  这包括可计算性理论，计算复杂性理论，信息理论。

• Distributed optimization algorithm is an efficient control strategy to reduce the on line computational complexity of model predictive control for large scale systems.

  分布式求解策略是为了降低大规模预测控制系统在线实施的计算量和计算复杂性而提出的一种有效算法。

• The dissertation is focused on the research of reducing the computational complexity of large adaptive filters and their applications in echo cancellation.

  本论文主要研究了如何降低高阶自适应滤波器算法的计算复杂度及其在回波消除器中的应用。

• 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.

  同时，该算法的计算复杂度低，完全能满足视频服务器实时码率分配的要求。

• For curricula automata subject a more advanced graduate course, computability theory and computational complexity theory are also covered.

  高级课程中还包括了可计算包括理论模型理论和计算复杂性理论。

• In the low rate video encoding process, predetermination of all-zero blocks which can be applied to reduce the computational complexity is a common method to optimize the software coder.

  在低比特率视频编码时，全零块的预先判断，能够有效地减少编码器的计算复杂性，是优化编码器常用的技术之一。

• The method does not involve motion estimation, and has lower computational complexity and coding latency, and can make full-embedded video streams.

  该方法不涉及运动估计，具有较低的计算负荷和时间延迟，所产生的视频流是完全嵌入的。

• Delay and computational complexity are two problems to be solved when Maximum Likelihood Sequence Estimation (MLSE) is used in wireless communication system.

  无线通信中应用最大似然序列估计，其时延和计算复杂度是必须解决的两个问题。

• Experi - mental results show that this method can efficiently reduces the computational complexity while keeping similar RD performance.

  试验结果表明：在保持相近率失真性能的同时，该算法可以有效地降低编码的计算复杂度。

• An ETG circuit is one for which a complete test set (covering all modeled faults) can be generated with linear computational complexity in the circuit size.

  ETG电路是这样一种电路，产生它的完全测试集的计算复杂性与电路大小成线性关系。

• Calculations of computational complexity seem to be one of the harder subjects for students; there」s no doubt of their value, though, when they lead to such speedups.

  对于学生来说，计算「计算复杂度」似乎是较难的课题之一；但是当这些方法产生这样的加速时，它们的价值无庸置疑。