complexity analysis的例句大全

Methods of time complexity analysis are usually based on abstractive algorithms, rather than actual programs.

对于运行时间而言，常用的时间复杂度分析技术基于的是抽象的算法，并非实际程序。

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混沌系统的数值序列复杂性计算为例，说明数值序列的伪随机二进制转化过程中精度选取的重要性。

Computational Complexity Analysis on Improved Py Distinguish Attack Algorithm

改进Py区分攻击算法的计算复杂性分析

The paper given an analysis of the connotation, components and forming mechanism of agricultural comprehensive production capacity ( ACPC), and showed the complexity of its evaluating method.

通过对农业综合生产能力的内涵、构成因素和形成机理的分析，得出相应评价方法的复杂性，并指出目前几种评价方法的的缺陷。

And it also makes a detailed analysis of the problems of uncertainty, complexity and changefulness in experimental data, and puts forward some relevant solutions.

并对试验数据的多变性、复杂性和不确定性问题，进行详细分析和提出具体解决措施。

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集的基本算法方面，提出了计算等价类的快速算法和增量算法以及计算正区域的改进算法，分析了算法的时间复杂度；

A New Idea on Computational Complexity Analysis of Computable Problems

算法可解问题计算复杂性分析的新思路

In this paper, the proof of correctness and complexity analysis of ECRP were given.

论文给出了ECRP的正确性和复杂性分析.

Aim To present a quantitative method for structural complexity analysis and evaluation of information systems.

目的研究信息系统结构复杂性的定量分析方法.

Algebra Complexity Analysis of AES-Class S box and Camellia-Class S Box

AES类S盒与Camellia类S盒的代数复杂度分析

The query function find of MATLAB is flexibly applied in general topological analysis and sharply reduce the code and complexity of program.

灵活运用MATLAB的矩阵查询函数find，对常规拓扑分析算法进行了改进，大幅度减少了程序代码和复杂度。

The method extracting brain motor consciousness feature by event-related EEG complexity was proposed in this paper. Applying Mahalanobis distance discriminant analysis to distinguish the left and right hand motor imaginary tasks, the satisfactory results were obtained.

本研究提出了利用事件相关脑电复杂度提取大脑运动意识特征，应用Mahalanobis距离判别式分析法，对人脑想象左右手运动任务进行分类，获得了满意的结果。

To decrease the complexity of frequency-response-based analysis and design, based on graphics method of inversion Nyquist array, an approximate criterion is developed.

通过对图解方法的分析，提出了逆Nyquist阵对角占优的解析判别式，简化了多变量频率域鲁棒性分析和设计。

According to experiment results, comparison analysis is made between Entropy algorithm and Basic Incognito algorithm, including time complexity analysis and precision analysis.

根据实验数据结果，对Entropy算法与Basic Incognito算法的性能进行了比较分析，包括时间复杂度分析以及精确度分析。

For how to construct a MIB tree, we propose two algorithms, and the two algorithms time complexity and space complexity of a detailed analysis and comparison.

对于如何构造MIB树，论文提出了两种算法，并对这两种算法的时间复杂度和空间复杂度做了详细的分析和比较。

The algorithm can decompose a complex planar polygon with nesting holes, and its time complexity is O ( nlogn) by analysis and testing.

该算法能够分解内嵌多个环的复杂多边形，分析及测试表明，其时间复杂度为O（nlogn）。

FTIR and 13C-NMR analysis results showed the complexity of J-100 crosslinking modification mechanism.

红外、13C-NMR核磁分析验证了交联改性反应原理的复杂性。

With the strict analysis of the characteristics of homomorphic encryption, we realize that the reasonable using of this technology can reduce the computational complexity and communication complexity of multi-party computation.

通过对同态加密技术特点的深入分析，得知合理利用此技术可降低多方计算协议的计算复杂度与通信复杂度。

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完全问题，而一阶逻辑是半可判定问题，关于非经典逻辑特别是非单调逻辑的计算复杂性分析和算法实现是一个重要的研究领域。

This paper proposes an open model for finance forecast based on Cellular Automata, Minority Game and the complexity analysis of finance market.

该文通过对金融市场复杂性的分析，并基于元胞自动机和争当少数者模型提出了一个开放的金融预测模型。