computing complexity的例句大全

A quantitative computable method of sequence complexity is introduced in this paper, and it is demonstrated the importance of computing accuracy selection for floating point number being transformed to pseudorandom binary sequence by the complexity analysis of chaotic sequence of Lorenz equations.

介绍一种能够定量分析混沌序列复杂性的计算方法，并以Lorenz混沌系统的数值序列复杂性计算为例，说明数值序列的伪随机二进制转化过程中精度选取的重要性。

It makes optimizations on the service matching process by building up a pretreatment list of ontology concepts to transfer the computing complexity to the pretreatment phase, and improve the performance and efficiency of the matching phase.

并且对服务匹配的过程进行优化，通过建立本体概念匹配的预处理列表，将匹配计算的复杂性转移到预处理阶段，从而提高匹配阶段的运行效率。

In coordinate computing, multiple variables non-linear optimized problems with constraint are changed into least squares problems of linear equation group utilizing screw theory, which simplifies the computing complexity and advanced stability in solving course.

在多视角测量数据融合中采用Screw理论，将坐标系关系求取中带约束的多变量非线性优化问题转化为线性方程组的最小二乘问题，简化了计算的复杂性，提高了求解过程的稳定性。

Study of information theory and computing complexity in cryptology

密码学中信息论及计算复杂性的研究

This algorithm can solve the large scale problem because its computing complexity is small.

该算法计算量小，可应用于大规模优化调度问题。

Parallel fast Fourier transform algorithm is used to calculate the Coulomb field distribution, and reduce the complexity of the algorithm. The computing speed is substantial increased.

利用并行快速傅立叶变换算法计算库仑场分布，降低算法复杂度，使计算速度大幅提高。

Then the DCBF algorithm is described in detail, with the correctness of DCBF proved and the computing complexity of DCBF analyzed. Finally an example is given.

详细描述了DCBF算法，证明了DCBF算法的正确性，分析了DCBF算法的计算复杂度，并给出了一个实例。

First several basic algorithms of Rough set methods are introduced with an analysis of the time complexity such as some efficient and incremental computing of indiscernibly relation and an improved algorithm of positive region.

具体研究工作如下：一.在Rough集的基本算法方面，提出了计算等价类的快速算法和增量算法以及计算正区域的改进算法，分析了算法的时间复杂度；

The paper analyzes the complexity of trust negotiation protocol, and its communication cost is linear, computing cost is O ( N · K).

还分析了信任协商协议的复杂性，其通信开销为线性，计算开销为O（N·K）。

The computing time complexity is O ( men1).

计算时间复杂度是O（men l）；

It is well known that the determinant problem in classic proposition logic is a NP complete problem, and the first order logic is a half determinant one. So both the analysis of computing complexity and the realization of it are the most important fields.

众所周知，经典命题逻辑中的判定问题是NP完全问题，而一阶逻辑是半可判定问题，关于非经典逻辑特别是非单调逻辑的计算复杂性分析和算法实现是一个重要的研究领域。

A state dependent Riccati equation ( SDRE) based controller was designed, and the controller ′ s gain relates to the state, which results in complexity in computing but good effects of control.

设计了基于状态相关黎卡提方程（SDRE）方法的控制器，控制增益与系统状态相关，计算复杂程度较高，但控制效果好。

Using the improved algorithm in edge location, the computing complexity is reduced by avoiding search efforts when using two dimensions error table, and the measurement accuracy is increased.

将改进算法应用到空间矩亚象素边缘定位中，避免了以往利用二维误差校正表时需要的查寻时间和存贮空间，降低了计算复杂度，提高了测量精度。

The simulation shows that the algorithm has low computing complexity and is more robust.

实验结果显示，此算法兼有复杂度低和鲁棒性好的特点。

Considering the real time demand of applied systems, and thinking through computing complexity and recovering image quality, we put forward an interpolation algorithm based on the adaptive filter technique.

由于应用系统的实时性要求，我们均衡考虑计算复杂度和恢复图像质量，提出一种基于自适应滤波技术的插值算法。

Wang Zi Qiang et al presented a new algorithm for computing the convex hull of a planar point set in 1998, and claimed that the worst case time complexity of the algorithm is O ( n), which can lead to a linear time algorithm for sorting.

王志强等于1998年提出了一个计算平面点集凸包的新算法，并且声称该算法的最坏时间复杂度为O（n），从而为线性时间排序提供了可能性。

The CA mechanism is executed by using the no-inverse digital signature scheme, and the complexity of computing is reduced. The mutual signatures of communication realize the nonrepudiation. The security analysis of the protocol is given.

应用无求逆数字签名方案实现CA认证，简化了计算复杂度，并通过通讯双方数字签名实现不可抵赖性，最后给出了协议安全分析。

It also had middle computing complexity and high application value.T-S fuzzy reasoning model was used to construct sub-linear model. It was used as the network infrastructure and divided the input space into a number of fuzzy subspaces.

本文采用T-S模糊推理模型构建分段线性模型，作为网络系统的基础构架，将输入空间分为若干个模糊子空间。

According to the character of expected information, the article proposed a new ID3 algorithm of decision trees to reduce the complexity of computing expected information by the convex function.

根据ID3算法中信息增益计算原理的特点，利用上凸函数的性质提出一种新的改进的ID3算法，减少了信息增益的计算量，进而提高ID3算法中信息增益的计算效率。