This paper abstracts three practical maximum problems from the real world and gives their formal mathematical descriptions. Their algorithms and complexity are fully discussed.
本文从现实世界中抽象出三类极大问题，给出了形式化的数学描述，并详细讨论了各自的算法和复杂度。
At the theoretical end, this focus manifests itself in complexity theory, which groups algorithms according to their time and space requirements for execution.
除理论之外，这种专注表现在本身复杂性的理论，它根据它们运行的时间和空间需求来组织算法。
In the same way as other algorithms, the use of efficient board representations is a tradeoff between complexity, speed, and space requirements.
而在使用相同方法的其他算法中，采用有效的棋盘表现方法是一个介于复杂性，速度和空间需求之间的权衡。
However, the rule set is typically limited to rules and algorithms that are categorized with a degree of simple or medium complexity.
不过，规则集通常限于使用简单或中级复杂度进行分类的规则和算法。
However, sndpeek and some custom algorithms can provide a voice-print matching configuration of considerably reduced complexity while retaining a great deal of usefulness.
但是，sndpeek和一些自定义算法可以提供一种声波纹匹配配置，这种配置适当降低了复杂度，同时保留了较高程度的有效性。
The selection of attributes, which involves the complexity and performance of induction algorithms, is.
属性选择是机器学习的核心问题之一，它关系到归纳算法的复杂性和学习性能。
Algorithms for translation and rotation of linear octree were presented which have linear complexity in time.
给出了线性八叉树的平移和旋转算法，它们都有线性的时间复杂性。
The computing complexity and computing time of this algorithm is lower than that of existed algorithms.
该算法比已有的块三对角矩阵求逆算法的计算复杂度和计算时间低。
In chapter three, the DLU and IILX algorithms for linear Diophantine equations are given based on the ABS algorithms. Corresponding properties, complexity and their application are discussed.
第三章在ABS算法的基础上给出了求解线性丢番图方程组的整隐式LU算法和整隐式LX算法，讨论了相应的ABS性质，并讨论了复杂性分析及其应用。
Comparised with the traditional lattice method of calculation complexity and storage, the algorithms have obvious advantages.
同传统格型算法相比，这种算法的计算复杂度及存贮量有明显改善。
Linear octree encoding provides a effective way for tridimensional of objects. Algorithms for translation and rotation of linear octree were presented which have linear complexity in time.
线性八叉树编码是一种有效的表示三维物体的方法。给出了线性八叉树的平移和旋转算法，它们都有线性的时间复杂性。
This paper gives an adaptive edge detection algorithm based on rough set, carries out some researches on the ba-sic theory, realization and complexity of the algorithms.
利用粗糙集理论，给出了一种基于粗糙集的图像边界检测算法，研究了算法的基本原理、实现和复杂度。
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.
由于这些模型采用滤波器组模拟对比度敏感函数(CSF)，增加了视觉阈值获取和实时评价算法的复杂度。
Prepared using the above definition of the heap for sorting algorithms, and analysis of the algorithm is derived time complexity.
编写利用上述定义的堆进行排序的算法，并分析推导算法的时间复杂度。
Similarly, construction feature, fast compute, numerical stability and compute complexity of some sequential algorithms for real-time numerical simulation were analyzed.
类似地分析了几类实时数值仿真的串行算法的构造特点、快速性、数值稳定性和计算复杂性等。
Computational learning theory provides formal framework for comparing the performance of two algorithms, and can determine the sample complexity and the computational complexity of some concept class.
计算学习理论为比较两算法的性能提供了形式化的框架，并能确定某概念类的计算复杂度和样本复杂度。
This text has analysed three algorithms for finding the critical paths from several respects separately, such as complexity of the algorithm, the structure form of the data and easy degree.
本文分别从算法复杂度、数据结构形式及实现的容易程度等几方面分析了三种求关键路径算法的优劣。
In the traditional digital image post-processing algorithms, performance and complexity always can not be satisfied simultaneously.
在传统图像后处理算法中，性能和复杂度往往难以兼顾。
Hash function plays an important role in the query algorithm, and the query algorithms based on it achieves a constant time complexity in theory.
散列函数在查询算法中起着重要作用，基于此的查询算法在理论上可达到常数级时间复杂度。
The application shows that the algorithms simplify the computing complexity of process neural networks, and raise the efficiency of the network learning and the adaptability to real problem resolving.
应用表明，算法简化了过程神经网络的计算复杂度，提高了网络学习效率和对实际问题求解的适应性。
The complexity of solving the model with exact algorithms completely was studied and showed that an exact algorithm could not meet the practical requirement in time.
分析了该模型用精确算法进行求解的复杂性，指出对实际问题若完全采用精确算法求解往往达不到实时响应的要求。
Computation of thresholds decreases the computing complexity of fast correlation attack, and extends the application of algorithms.
门限的计算降低了快速相关攻击算法的计算复杂度，扩大了算法的应用范围。
Based on the analysis of the computational complexity of JM73 decoder, we perform PC platform optimization on its program structure, data structure and algorithms.
基于对JM 73解码器运算复杂度的分析，本文在PC平台上对其程序结构、数据结构和算法进行了优化。
A fast adaptive beamforming algorithms was proposed based on MBER, which had a low complexity and fast converge to the optimal MBER solution.
在基于MBER准则的基础上，提出了一种快速自适应波束成型算法，在保证低复杂性的同时，快速收敛于最优MBER解。
For both problems, we study their computational complexity and present optimal algorithms or polynomial time approximation algorithms.
并且对这两类问题都研究了他们的计算复杂性并给出了最优算法或者多项式时间近似算法。
Compared to the traditional decoding algorithms, the proposed scheme is no need to estimate the correlation matrix of the channel and pre-code at the transmitter, and its coding complexity is reduced.
与传统解码的算法不同，该算法无需在发送端进行信道相关矩阵的估计和预编码，降低了发送端的编码复杂度。
The model solves these problems such as high complexity of algorithms and low accuracy rate of classifications lie in the flood prediction using single models.
解决了单一模型洪水预测问题存在的算法复杂度高，分类准确率低等问题。
Then the complexity of the two algorithms is analyzed and compared.
随后对串并两种算法的复杂性进行了分析和比较。
Then the complexity of the two algorithms is analyzed and compared.
随后对串并两种算法的复杂性进行了分析和比较。
应用推荐