查询词典 algorithm

First of all, on the base of the reduced gradient method of Wolfe, we added accurate one dimension searching method into it and gained a new algorithm (algorithm 1,2) for the nonlinear programming with linear equality constraints and quadratic programming problems, and proved convergence of algorithm, then, we use above algo...

首先本文在Wolfe既约梯度法的基础上，针对具有线性等式约束的非线性规划问题和二次规划问题，引入了精确的一维搜索，得到了带一维搜索的新算法(算法1、2)，并给出了算法的收敛性证明。

In this paper, an algorithm to test the completion for query evaluation of REITER algorithm has been developed, by which we can know whether the answer given by REITER algorithm is complete or partial.

本文给出了一个测试REITER算法在某一数据库的求解过程中是否保持其完备性的算法，由此可知，通过REITER算法求得的解是完全解还是部分解。

Based on the concept of subenergy transformation and terminal repeller in Terminal Repeller Unconstrained Subenergy Tunneling algorithm, a new global optimization algorithm, called Random Tunneling Algorithm , was proposed.

对PFAEA算法的性能分析表明，算法的时间复杂度与原子个数N呈立方增长关系，效率高于在团簇优化研究中较成功的Basin-Hopping算法，为解决大规模团簇体系或分子体系结构优化问题提供了有力工具。

Inheriting the advantage of this algorithm, the adaptive control algorithm and the switching control algorithm applied in the situation that the load affected the rotation inertia of the axes are developed to satisfy the requirements of the CP motion.

提出了一种基于输入—输出稳定性理论的控制算法，以完成空载状态下CP运动的控制任务，该算法无需转子各轴向的加速度反馈信号，减轻了转子位置检测系统的压力。

Cutter blade in the face of the modeling, this paper presents a basic model of ideological confrontation flank milling reasoning and mathematical algorithm: First, the establishment of the cutter edge cross-section curve and the equation ruled surface and then through the algorithm to generate cutter rake face and the flank, Bezier curve-based algorithm to generate the surface of the spiral groove cutter in order to achieve the opposite blade face milling modeling.

在立铣刀的刃面的建模方面，本文提出了一种基本的建模思想对立铣刀的刀面进行数学推理和算法实现：首先建立立铣刀的刃口曲线及横截面的方程，然后通过直纹面生成算法建立立铣刀的前刀面和后刀面，通过基于Bezier曲线的曲面生成算法建立立铣刀的螺旋槽，从而实现了对立铣刀刃面的建模。

Then based on the analysis of running time of binary algorithm and its imroved variant, I present a parallel algorithm of scalar multiplication, and analyze the running time of that parallel algorithm.

通过分析二进制算法及作为其改进算法的2~T -ary算法、加减链算法的运行时间的影响因素，论文继而提出了将2~T -ary算法并行化的算法，并对该并行算法的运行时间进行了理论上的分析。

Dissertation introduced a brief analysis of time series, simple overview of the data compression technology in several common algorithms, wavelet algorithm and to focus on the wavelet analysis of the nature and characteristics of algorithm, introduced by wavelet data compression algorithm method.

论文主要介绍了关于时间序列的简要分析，简单概述了数据压缩技术的中的几种常用算法，并以小波算法为重点分析了小波算法的性质和特点，介绍了用小波算法进行数据压缩的方法。

In Goertzel algorithm using MATLAB (first using FFT algorithm, reuse goertzel algorithm) simulat...

应用于双音多频信号的产生与检测。

With the idea of smoothing Newton method, we propose a new class of smoothing Newton methods for the nonlinear complementarity problem based on a class of special functions. In this paper, complementarity problem is converted into a series of smoothing nonlinear equations and a modified smoothing Newton algorithm is used to solve the equations. We use Newton direction and Gradient direction together in the algorithm which guarantees that our method is globally convergent. Also using another smoothing function, we reformulate the generalized nonlinear complementarity problems defined on a polyhedral cone as a system of smoothing equations and a smooth unconstrained optimization problem. Theoretical results that relate the stationary points of the merit function to the solution of the generalized nonlinear complementarity problems are presented, we use the modified smoothing Newton algorithm in generalized nonlinear complementarity problems, under mild hypothesis, a global convergence is proved.

本文一方面基于现有的各种光滑Newton法的思想和半光滑理论，利用著名的F-B互补函数的光滑形式，首先将互补问题的求解转化为求解一系列光滑的非线性方程组，然后给出了一种修正的光滑Newton法，该方法不仅放宽对函数F的要求，在Newton方程不可解时引入初始效益函数的最速下降方向，而且光滑因子的选择也比较简单可行，同时在适当的条件下，证明了其算法具有全局收敛性；另一方面，借助另一种F-B光滑函数，将多面体锥上的广义互补问题转化为一种光滑形式，讨论了优化问题的稳定点与广义非线性互补问题的解之间的理论关系，并将这种修正的光滑Newton法用于求解广义非线性互补问题中，在适当的条件下，该算法同样具有全局收敛性。

For the coordination of multiple agents in noncooperation environment, we considered the learning aim as finding a Nash equilibrium strategy through in learning function taking other agent's actions into account. Therefore, we expended the single agent Q-learning algorithm into multiagent Q-learning algorithm. In addition, we proved the convergence of multi-agent Q-learning algorithm under certain general sum stochastic game architecture for only one Nash equilibrium or multiple same Nash equilibrium.

对于非合作环境下的多智能体协调我们通过在学习函数中考虑了智能体的联合行动，提出把学习目标作为求取一个Nash平衡点策略，这样将单智能体Q-learning算法扩展到多智能体的Q-learning算法；证明了在一定的一般和随机对策结构下具有一个或多个相同Nash平衡点条件下多智能体Q-learning算法的收敛性。

But we don't care about Battlegrounds.

但我们并不在乎沙场中的显露。

Ah! don't mention it, the butcher's shop is a horror.

啊！不用提了。提到肉，真是糟透了。