在对图像的处理过程中，我们采用了最优化算法、改进算法1及改进算法2三种算法。
In the process of image treating, We use three algorithms, i. e. the optimization algorithm, improving algorithm1 and improving algorithm2.
现代优化算法主要解决全局最优问题，其本质是概率性的。
The main objective of modern optimization algorithm is to deal with the problem of global optimum, which is essentially probabilistic.
最优化方法是解决最优化问题的理论和算法，主要包括传统优化算法和智能优化算法两大类。
Optimization methods, the theory and algorithm of solving optimization problems, can be divided into two parts, the traditional optimization algorithms and intelligent optimization algorithms.
该文提出的资源分配优化算法为每个待分配信道找出最优合作节点集合，工作在同一信道的节点不会对授权用户产生干扰。
The optimized algorithm can find the optimal set of collaborative nodes for resource allocation, and at the same time avoid the interference to primary users.
采用线性矩阵不等式技术，将问题转化为一线性凸优化算法，可得问题的全局最优解。
Using the linear matrix inequality (LMI) technique, the problem is converted into a linear convex optimization algorithm so that a global optimization solution is obtained. Finally.
本文分析了GIS环境下动态路径优化算法的特点，对GIS环境下城市路网的最优路径选择问题的关键技术进行了研究和验证。
This paper analyses some characters of dynamic path optimum algorithm, studies and verifies the key techniques of the optimum path of city road network under GIS.
基于混沌优化算法给出了求解最优超订水平的方法。
The solving method for the optimal solution of the overbooking model is given based on chaos optimization algorithm.
论文尝试使用微粒群优化算法与GIS相结合解决超市最优选址问题。
This paper demonstrates that using particle swarm optimization approach to solve optimal location of supermarkets based on GIS.
标准的粒子群优化算法作为一种随机全局搜索算法，因其在种群中传播速度过快，易陷入局部最优解。
The standard particle swarm optimization algorithm as a random global search algorithm, because of its rapid propagation in populations, easily into the local optimal solution.
采用进化优化算法——蚁群优化算法来求解机组最优启停问题。
The optimal unit commitment is solved via the Ant Colony Optimization algorithm in this paper.
首先介绍最优轨道对参数的连续依赖性和优化算法的算法模型的收敛性理论。
First, the the ory of continuous dependence of the optimal trajectory on the parameters and the theory of convergence about optimization algorithm model are introduced.
以最新的消耗定额为参数，结合最优化算法，得出了最优备件储备数量。
Combining the consume ration with optimization arithmetic, an optimized storage number of spare part was worked out.
与其他混合最优化算法不同的是，该算法没有破坏粒子群和遗传算法的独立性，而是仅通过全局最优样本把两个算法结合在一起。
It selects the optimaler number as a global optimum at every circulation, which makes its result be better than both PSO and GA, then improves the overall performance of the algorithm.
提供七种最优化算法，三种是全局优化。
Provides seven optimization algorithms, three of which are global.
根据凸优化理论，最优保性能标准控制器和最优保性能可靠控制器的设计方法转化为一个线性凸优化算法。
On the basis of convex optimization theory, the design method about optimal guaranteed cost reliable controller and standard controller transform convex optimization arithmetic.
多目标遗传优化算法的一个优点就是可在一次迭代计算中寻找到问题的多个非劣最优解。
One advantage of multi-objective genetic optimization algorithms over classical approaches is that many non-dominated solutions can be simultaneously obtained by their single run.
迭代最优化算法是模式识别中一种重要方法。
The iterative optimization algorithm is an important method in pattern recognition.
在此基础上介绍了最小条件评定的三种最优化算法。
On the basis of them, three optimization algorithms for minimum condition evaluation are introduced.
与标准的率失真(PCRD)优化算法相比，该算法不会在计算码率失真斜率和搜索最优分层截断点时产生运算开销。
Compared with the standard post-coding rate distortion (PCRD) algorithm, the proposed algorithm has no spending in calculating rate-distortion slope and searching for optimum truncation points.
就随机并行梯度下降(SPGD)最优化算法在光束净化系统中的应用展开研究。
This paper researches the application of the stochastic parallel gradient descent (SPGD) optimization algorithm on the beam cleanup system.
优化结果表明，此方法能够克服传统优化算法极易陷入局部最优的缺点，而且收敛速度快，计算精度高。
The results of the optimization indicate that this method can overcome the default of the local optimization of traditional optimization algorithms; it is easy to convergent and has high precision.
采用基于动态信息素更新策略的改进蚁群优化算法，在保证优化目标的基础上，迅速收敛并得到最优解，从而提高调度系统的可行性，增强系统稳定性。
Secondly, the algorithm based on the dynamic pheromone updating ensures the quick convergence and the optimal solution, thus improving the feasibility and the stability of the schedule system.
因此需要引进一些非线性优化算法求解全局最优解。
Some nonlinear algorithms are needed to achieve global optimal solutions.
本文介绍了一种用于磁定位的非线性方法，该方法基于磁偶极子的磁场分布模型和非线性最优化算法。
This paper introduces a nonlinear method used for magnetic localization, this method is based on magnetic dipoles model and nonlinear optimization algorithm.
提出了一套针对晶体学问题特点的高效率、高精度的最优化算法。
An optimization algorithm with high efficency and high accuracy has been proposed for this purpose.
本文提出了一种新的最优化算法——坐标扰动法。
Coordinate perturbation method, a novel optimization method, is recommended here.
通过粒子群最优化算法解决多供应商参与协同产品开发时的任务指派问题。
The Particle Swarm Optimization (PSO) algorithm was used to deal with task assignment problem in multi-suppliers' participation in collaborative product development.
通过粒子群最优化算法解决多供应商参与协同产品开发时的任务指派问题。
The Particle Swarm Optimization (PSO) algorithm was used to deal with task assignment problem in multi-suppliers' participation in collaborative product development.
应用推荐