最后应用枚举法，得到全局最优解。
Lastly the global optimized solution can be got by enumerating.
求解非线性约束规划的全局最优解是一个难点。
Solving the global optimal solution for nonlinear constrained programming is difficult.
最后利用遗传算法获得威胁网络下的全局最优解。
The global optimal flight path could be obtained by using genetic algorithms.
该模型具有快速收敛、鲁棒性和全局最优搜索能力。
This model has quick convergence, robustness and capability of searching the optimal solution within defined space.
业已证明，提出的算法可以保证收敛到全局最优解。
It has been proved that the algorithm can converge to globally optimal solution.
地震反演问题常常需要一些非线性全局最优化的方法。
Seismic inversion problems must be solved by non linear global optimization methods.
现代优化算法主要解决全局最优问题，其本质是概率性的。
The main objective of modern optimization algorithm is to deal with the problem of global optimum, which is essentially probabilistic.
文摘：地震反演问题常常需要一些非线性全局最优化的方法。
Abstract: Seismic inversion problems must be solved by non-linear global optimization methods.
多峰值函数优化结果表明，该算法能更有效地达到全局最优解。
The optimization result of multi-peak value function shows that the algorithm introduced can converge to the globally optimal solution effectively.
进化规划(EP)是一种随机优化技术，它可以发现全局最优解。
Evolutionary Programming (EP), a multi agent stochastic optimization technique, can lead to global optimal solutions for complex problems.
本文提出适合于两级混合式多传感器系统的全局最优状态估计解。
This paper presents a globally optimal composite filtering solution for a two-level hybrid multisensor system.
单调优化是指目标函数与约束函数均为单调函数的全局最优化问题。
The monotone optimization is to maximize or minimize a monotone objective function constrained by monotone functions.
针对边界约束函数全局最优化和多峰寻优问题，提出一种直接搜索算法。
This paper proposes a direct search algorithm for global optimization and multi-peak searching of functions with boundary constraints.
该方法对目标函数无连续、可微等要求，能较快地收敛到全局最优权系数。
Usually, the algorithm can quickly converge to the global optimum weight coefficients.
引入改进模拟退火算法进行全局最优化求解方程，并给出程序编制流程图。
Using the improved annealing simulation algorithm, full, scale solution of optimal equation is obtained with flow chart for programming.
实验结果表明，该算法能够保证求得全局最优解，并且寻优速度有很大提高。
The experiment shows the algorithm can surely and rapidly get global optimum solution and greatly improve con vergence rate.
因此，如何获得全局最优的码书成为矢量量化算法设计的主要研究问题之一。
So, how to achieve global optimal codebook become the one of key problems of designing VQ algorithm.
图像匹配是一种约束最优化问题，系统是否收敛于全局最优值一直尚未解决。
Image matching belongs to constrained optimization problems. Whether the system would converge to the global optimum is still an open problem.
理论上已经证明要在多项式时间复杂度内对这一类问题找到全局最优解是不可能的。
The fact that it is impossible to find the global optimum in polynomial complexity has been proved.
多峰值函数优化结果表明，该算法可以有效地解决早熟收敛问题，更易达到全局最优解。
The optimization result of multi-peak value function shows that the algorithm presented can solve premature convergence problem effectively and converge to the globally optimal solution.
为更好地求解复杂优化问题的全局最优解，提出了基于串联协作的多方法协作优化方法。
Multimethod collaborative optimization algorithm based on serial collaboration is advanced to get better global optima of complex optimization problem.
通过分派启发式算法保证最大程度地满足客户的要求，再利用节约算法保证了全局最优。
The allocating heuristic algorithm ensures the maximum satisfaction of the clients, and the saving algorithm ensures the overall optimization.
在此基础之上，利用改进的迭代算法完成曲面匹配的精确调整达到了全局最优化的目标。
On basis of these, an improved iterative algorithm is used in the exact adjustment to ensure the global optimization.
为了使系统检测性能达到最优，需要对融合规则及各部传感器的判决规则进行全局最优化。
In order to optimize the system performance, the fusion rule and the sensor decision rules must be optimized jointly.
在线性无偏最小方差估计准则下，推导出了该离散化后所得系统的全局最优递推状态估计算法。
In the sense of linear unbiased minimum variance estimation, a global optimal recursive state estimation algorithm for this discretized linear system is proposed.
如果为每个匹配字符一分，一个空格扣两分，一个不匹配字符扣一分，那么下面的比对就是全局最优比对。
If you award matches one point, penalize Spaces by two points, and penalize mismatches by one point, the following is an optimal global alignment.
如果为每个匹配字符一分，一个空格扣两分，一个不匹配字符扣一分，那么下面的比对就是全局最优比对。
If you award matches one point, penalize Spaces by two points, and penalize mismatches by one point, the following is an optimal global alignment.
应用推荐