算法的

基本解释 (translations)

algorithmic

与算法的相关的网络例句 [注：此内容来源于网络，仅供参考]

The reason the default produced is analyzed and a new latest available unscheduled channel with smallest void algorithm is presented. The performance of the two algorithms is simulated. The results show that in LAUC-SV algorithm the effective window of the packet loss versus unit delay time of fiber delay lines is expanded significantly and the packet loss ratio is decreased about 100.5. The algorithm complexity of the LAUC-SV is only increased arithmetically with LAUC. Both the algorithms can not support delay reservation protocol effectively.

分析了产生此缺陷的原因并提出了一种LAUC算法的改进算法LAUC-SV算法，采用仿真的方法分析比较了两种算法的性能，结果表明LAUC-SV算法比LAUC算法的丢包率下降100.5，且LAUC-SV算法下的丢包率关于光纤延时线单元延时时间的工作窗口与传统LAUC相比大大展宽，而前者的算法复杂度与后者相比仅呈算术增长，但两算法均不能有效支持延时预约协议。

This article introduces three kinds of line cliping algorithms from the basic algorithm philosophy, the algorithm description,the algorithm steps and so on. Then it used the VC programming to realize these three algorithms on the basis of analysing the characteristics and the performance of three algorithms .

本文从算法基本思想、算法描述和算法步骤等方面介绍了三种直线段裁剪算法，在对三种算法的特点和性能进行分析的基础上，使用VC编程实现了这三种算法。

Furthermore, the first-order optimality condition and its equivalent reformulations for generalized semi-infinite max-min programming with a non-compact set are presented using the lower-Hadamard directional derivative and subdifferential.2. Chapter 3 studies the gradient-type methods for unconstrained optimization problems. Section 1 proposes a new class of three-term memory gradient methods. The global convergence property of the method is established. Furthermore, in order to improve the convergence property of the method, a new class of memory gradient projection methods is presented with the property that the whole sequence of iterates converges to a solution to the problem under the conditions such as pseudo-convexity and continuous differentiability of objective function. In section 2, two new classes of methods, called gradient-type method with perturbations and hybrid projection method with perturbations, are proposed. In these methods, non-monotone line search technique is employed, which makes them easily executed in computer.

第3章研究了无约束优化问题的梯度型算法，第1节提出了一类新的三项记忆梯度算法，讨论了算法的全局收敛性，进一步提出了一类新的具有更好收敛性质的记忆梯度投影算法，并证明了该算法在函数伪凸的情况下具有整体收敛性，第2节在非单调步长搜索下提出了带扰动项的梯度型算法及其混合投影算法，这两类算法的一个重要特征就是步长采用线搜索确定而不象许多文献中那样要求步长趋于零，这样更容易在计算机上实现，在较弱的条件下证明了这些算法的全局收敛性，数值算例表明了算法的有效性。

After the concept lattice have been built, the way of building concept with incremental algorithms is more convenient than batch algorithms with various dataset updates.The efficient algorithm among batch construction has been suggested by Bordat which generates both the concept set and the Hasse diagram of the lattice.

批处理算法主要用于在数据量较小或给定的数据集上的概念格的建造；此类算法主要有：Bordat的算法，Chein的算法，Gantcr的算法，Nourine的算法等；增量算法除了能实现批处理算法的功能外，对一已建成概念格，但是概念格的形式背景是动态的数据，当数据变动时需要重新建格，此时增量算法是更有利的算法。

As well, ACA outperforms GA in performance on average. 2. Through the analysis and studying of Ant colony algorithm and Flow shop scheduling problem, a construction graph is introduced. Two ant colony algorithms are proposed and analyzed for solving the flow shop scheduling problem with the objective of minimizing the flowtime. The Initialization of parameters and updating of trail intensities and probability is described respectively and a newly local search technique is proposed. Last is the experiment and the comparison shows that the PACA performs better than the FACA in the case of relatively large-sized problems than in the case of relatively small-sized problems.

通过对基本蚁群算法的实现过程和流水调度问题进行研究，给出了求解流水调度问题的解构造图，提出了两种蚁群算法来求解以总流程时间最小为目标的流水调度问题-FACA 蚁群算法和PACA 蚁群算法，分别给出了FACA 蚁群算法和PACA 蚁群算法的参数初始化方式、相对应的信息素更新方法和概率分布规则，并提出了局部搜索模式，最后进行模拟试验，对这两种算法进行比较，试验结果表明：对于较大规模的问题，PACA 蚁群算法要优于FACA 蚁群算法，而对于较小规模的问题，FACA 蚁群算法优于PACA蚁群算法。

After summarizing the waveform relaxation methods and domain decomposition, we finish some research on optimal Schwarz waveform relaxation algorithm as follows: In the first part, we apply Schwarz waveform relaxation methods on telegraph equation system to get optimal transmission conditions to speed up the algorithm.

在对波形松弛算法以及区域分解进行了综述性介绍后，本文对Schwarz波形松弛迭代算法具体进行了以下研究：首先，本文将在电报方程系统上应用Schwarz波形松弛迭代算法，通过强制加入新的局部传输条件分别给出了两种加速算法并通过定理保证了其优化后的收敛性，进而得到优化Schwarz波形松弛算法，然后通过数值试验对传统Schwarz波形松弛算法与优化Schwarz波形松弛算法进行了比较，研究了收敛率与优化系数的关系，找到了使算法最优的系数取值；最后得出优化后的Schwarz波形松弛算法优于常规Schwarz波形松弛算法的结论。

The comparison is carried on with the Greedy GA and the Dsatur, the result indicate that the computing precision of hybrid algorithm is better than the antitheses.

用遗传算法进行全局搜索，并与贪婪遗传算法和Dsatur算法进行了比较，结果表明，混合遗传算法的寻优质量优于对照算法。

This paper designs four simulation experiments to verify the CSAPFBA algorithm, and the results of the four simulation experiments are given. This paper lengthways compares the CSAPFBA algorithm with the CSFQ algorithm and breadthwise compares the CSAPFBA algorithm with the CSPAFA algorithm so as to analyze the performance of the CSAPFBA algorithm from the theoretical and experimental aspects.

本文设计了4组模拟实验验证CSAPFBA算法并且给出了模拟实验结果，将CSAPFBA算法分别和CSFQ算法、CSPAFA算法进行了纵向比较、横向比较以便从理论和实验两个方面分析CSAPFBA算法的性能。

The first step is reviewing conventional methods of digital beam forming, including WINER method, Steepest-Descent method, LMS, RLS etc. Then , recent digital beam forming methods in the DS-CDMA mobile telecommunications systems are studied, including the algorithm based on least-squares despread respread Multi-Target array, least-squares Despread Respread Multi-Target Constant Modulus Array , Pilot bit LMS-DRMTA algorithm etc.

本文首先简介传统的DBF算法，包括维纳算法、最陡下降算法、最小均方算法、递归最小二乘算法等；然后介绍基于DS-CDMA移动通信系统的DBF算法，包括LS-DRMTA、LS-DRMTCMA导频LMS-DRMTA算法等；最后给出各种算法的仿真结果及分析。

Moreover, A hybrid algorithm, ALHybrid, which is made of the algorithm LIDBSO and the algorithm AprioriIpv, is designed. Two algorithm, MQC_Apriori and MQC_LIDBSO, are given to mining multiple level quantitative association rules with item constrains. Two algorithm, PMARⅡ and PMARⅢ, which are based on different sequential mining algorithms, are given for parallelling mining association rules. In order to solve the mining association rules problem when we add a set of data to a database or delete a set of data from a database, two incremental updating algorithm, EUAR and EUAR, are given. Three incremental updating algorithm for association rules mining, DIUAⅠ, DIUAⅡ and DIUAⅢ, are dedigned to solve the three kinds of association rules incremental updating problem in distributed databases.

另外，文中还设计了一个算法LIDBSO与算法AprioriIpv相结合的混合采掘算法ALHybrid；对于多层次、带约束、多值属性关联规则的采掘问题，给出了两个采掘算法：算法MQC_Apriori和算法MQC_LIDBSO；在关联规则的并行采掘方面，还设计了两个基于不同顺序关联规则采掘算法的并行算法：算法PMARⅡ和算法PMARⅢ；在关联规则的增量式更新问题上，还给出了两个改进算法：算法EUAR和算法EUARˉ，分别用于解决当数据库增加或删除一个数据集合时的关联规则增量式更新问题；针对分布式数据库中的关联规则增量式更新的三类问题，提出了三个增量式更新算法：算法DIUA Ⅰ、算法DIUAⅡ和算法DIUAⅢ。

与算法的相关的网络解释 [注：此内容来源于网络，仅供参考]

Algorithm Analysis：算法分析

常常将程序和算法两个词混用. 如果一个算法能应用于问题的任何实例,并保证得到正确的解,那么称这个算法解答了该问题. 问题的实例又称为算法的输入,而问题的询问又称为算法的输出. 评价算法的好坏,是算法分析(algorithm analysis)的中心内容.

algorithmic：算法的

他进而又把实用的简单性细分为算法的(algorithmic)、记法的(notational)、心理的、实验的和技术的简单性. 句法的简单性把我们带入语法领域而非韵律领域,即考虑形式的而非内涵的要素. 邦格本人称此为形式简单性. 在科学中,

algorithmic：算法的, 规则系统的

algorithmic translation | 算法翻译, 算法解释 | algorithmic | 算法的, 规则系统的 | algorithmization | 算法化

Fractal Type：控制噪波分形算法的方式

Fractal Type:控制噪波分形算法的方式 | Noise Type:控制噪波形成类型 | Invert:是否反相

Greedy algorithm：贪婪算法

算法的类型: 算法的类型: 所有的算法可以大概分为以下三种类型: 1.贪婪算法(greedy algorithm) 该算法每一步所做的都是当前最紧急,最有利或者最满意的,不会考虑所做的后果, 直到完成任务.这种算法的稳定性很差,很容易带来严重后果,但是,

hash：散列算法

同时应用散列算法(Hash)也是实现数字签名的一种方法. 非对称密钥密码算法进行数字签名 算法的含义: 非对称密钥密码算法使用两个密钥:公开密钥和私有密钥,分别用于对数据的加密和解密,即如果用公开密钥对数据进行加密,

semantical：語義的

邦格把简单性分为四种:句法的(syntactical)、语义的(semantical)、认识论的和实用的简单性. 他进而又把实用的简单性细分为算法的(algorithmic)、记法的(notational)、心理的、实验的和技术的简单性. 句法的简单性把我们带入语法领域而非韵律领域,

syntactical：句法的

邦格把简单性分为四种:句法的(syntactical)、语义的(semantical)、认识论的和实用的简单性. 他进而又把实用的简单性细分为算法的(algorithmic)、记法的(notational)、心理的、实验的和技术的简单性. 句法的简单性把我们带入语法领域而非韵律领域,

deterministic algorithm：确定性算法

47、 确定性算法(Deterministic Algorithm) 是指算法的每一步都能明确的指明下一步的动作的一类算法. 48、 随机算法(Randomized Algorithm) 是指算法的每一步都随机的从指定范围内选取若干参数,由此确定算法的下一动作的一类算法.

Evolutionary Algorithms：进化算法

遗传算法属于进化算法( Evolutionary Algorithms) 的一种,它通过模仿自然界的选择与遗传的机理来寻找最优解. 遗传算法有三个基本算子:选择、交叉和变异. 但是遗传算法的编程实现比较复杂,首先需要对问题进行编码,找到最优解之后还需要对问题进行解码,