芯片使用可重构体系结构和超长指令字(VLIW)，优化了高复杂度函数。
The chip USES a reconfigurable architecture and very long instruction words (VLIW) to optimize the complex functions.
计算代码复杂度的老方法，一般是统计一个给定的函数或方法中的代码行数目。
The oldest method for calculating code complexity is counting the number of lines in a given function or method.
它将从预定的有效命令行选项列表和时间复杂度为O(1)的查找函数中生成一个散列表。
It generates a hash table from the predetermined list of valid command-line options and a lookup function whose time complexity is o (1).
使用诸如syslog函数之类的工具可以控制复杂度，并允许通过配置文件(例如syslog . conf)来轻松地进行自定义。
Using a tool like the syslog function keeps complexity under control and provides the added benefit of allowing easy customizations through configuration files, such as syslog.conf.
在start和end函数中划分动态部分的模式意味着您可以随意选择其中PHP 的复杂度。
This pattern of bracketing dynamic sections in start and end functions means that the PHP in between can be as complex as you like.
圈复杂性公式(cyclomatic complexity formula)，被Thomas McCabe首先提出，它是基于一个函数的分支数量来确定复杂度的。
The cyclomatic complexity formula, first developed by Thomas McCabe, is based on the number of branches in a function.
可靠性应重新定义为一个关于应用复杂度，测试有效性和操作环境的函数。
Software reliability should be redefined as a function of application complexity, test effectiveness, and operating environment.
散列函数在查询算法中起着重要作用，基于此的查询算法在理论上可达到常数级时间复杂度。
Hash function plays an important role in the query algorithm, and the query algorithms based on it achieves a constant time complexity in theory.
我们利用该新算法以更低的计算复杂度计算出了LILI- 128流密码体制的降次函数。
When applied to LILI-128 cryptographic system to construct depressed functions, the new algorithm obtains a lower computational complexity.
又由于采用了核函数思想，使它把非线性空间的问题转换到线性空间，降低了算法的复杂度。
Moreover, by using the kernel function idea, this theory can change the problem in non-linearity space to that in the linearity space in order to reduce the algorithm complexity.
据此，软件质量管理人员和测试人员可以获取以下几个方面的信息：1、系统级，模块级以及函数级的源代码复杂度信息及质量报告。
Thus, quality management engineer and testing engineer can get such information: 1. Complexity Information and Quality Report for System, Module and Function.
由于这些模型采用滤波器组模拟对比度敏感函数(CSF)，增加了视觉阈值获取和实时评价算法的复杂度。
As filter Banks are used to simulate the contrast sensitivity function (CSF) in these models, the complexity of visual threshold obtainment and real-time (assessment) algorithms are increased.
在构造预条件因子时，采用从目标的“几何结构剖分”出发，而不是从“矩阵元素”出发确定“基权函数之间的作用量关系”，这样保证了构造预条件矩阵的计算复杂度仅为O（N）。
The preconditioner is generated from the target's "geometry structure " and not from the "matrix element", which assured the computational complexity for generating the preconditioner is only O(N) .
对单元选择的研究主要包括拼接基元种类的选择、构造合理的代价函数及降低计算复杂度从而提高效率等。
Study on unit selection includes the identification of basic synthesis units, the definition of appropriate cost functions, the way to improve efficiency by reducing computational complexity, etc.
为简化模型的计算复杂度，开发了一种基于正交基函数展开的学习算法。
To simplify the calculation, a learning algorithm based on the expansion of the orthogonal basis functions is developed.
又由于采用了核函数思想，使它将非线性问题转化为线性问题来解决，降低了算法的复杂度。
Moreover, SVM can convert a nonlinear learning problem into a linear learning problem in order to reduce the algorithm complexity by using the kernel function concept.
又由于采用了核函数思想，使它把非线性问题转化为线性问题来解决，降低了算法的复杂度。
Moreover, SVMs can change a nonlinear learning problem in to a linear learning problem in order to reduce the algorithm complexity by using the kernel function idea.
实验证明采用伪似然估计方法构造目标函数在时间复杂度方面比采用似然估计方法要低很多。
And the experimental results show that the time complexity of pseudo-likelihood is much lower than likelihood approach.
此算法实际上是求约束条件下的函数最小值问题，属于组合优化问题，其计算复杂度随着目标数的增加而发生爆炸现象。
This algorithm is actually a minimum problem under the restrict conditions, it belongs to the combined optimization problem and its computing burden increases heavily with the number of targets.
实验对比表明，这种改进的灰度对比度函数，计算时间复杂度较简单，对焦灵敏度高。
The comparison shows that the improved gray scale contrast function has simpler time computational complexity and higher focusing sensitivity.
以问题空间上启发值的分布为启发函数的特征来分析迭代延伸A* （IDA~** ）的时间复杂度，使启发函数的作用相当于减小有效的搜索深度。
The running time of iterative-deepening-A~*(IDA~*) algorithm is analyzed with heuristic function of the problem space and the effect of the function is to reduce the actual search depth.
以问题空间上启发值的分布为启发函数的特征来分析迭代延伸A* （IDA~** ）的时间复杂度，使启发函数的作用相当于减小有效的搜索深度。
The running time of iterative-deepening-A~*(IDA~*) algorithm is analyzed with heuristic function of the problem space and the effect of the function is to reduce the actual search depth.
应用推荐