Simple genetic algorithms get local optimal solution too easily and converge slowly.
基本遗传算法存在着收敛速度慢、易陷入局部最优等缺陷。
This paper presents a HMM Local Optimal state Path-based Data Imputation (LOPDI) algorithm.
该文提出了基于隐马尔可夫模型局部最优状态路径的数据重建(LOPDI)算法。
Local optimal method is used in the design of hole connection to reduce pressure loss of the system.
在孔道连通设计中，还采用了局部优化的方法以减少系统的压力损失。
These are all greedy which are static local optimal algorithm and have typical local optimization problem.
这些算法均属于贪心算法，存在典型的局部最小问题，是一种静态的局部最优算法。
Local optimal algorithm against the shortcomings, I was prepared simulated annealing process improvements.
针对算法局部最优的缺点，本人正在编制模拟退火程序进行改进。
A jumping strategy is proposed to jump from local optimal solution and guide the search in promising directions.
给出了跳坑策略以跳出局部最优解并且将搜索引向有希望的方向。
The global optimal multi-sensor data fusion system and the local optimal decision rules are studied, respectively.
研究了全局最优融合系统以及局部传感器的最优判决准则。
Last, we synthesize all local optimal solutions and receive product design scheme through fuzzy membership degree method.
最后通过模糊隶属度的方法将各局部最优方案进行综合，得到一个产品设计方案。
The given algorithm regarded local optimal solution as antigen, and corresponding antibody generating system was designed.
该算法将局部最优解视为抗原，设计了对应的抗体产生机制。
PSO clustering algorithm is known to have simple parameters and fast convergence, but there are also local optimal problems.
粒子群优化聚类算法具有参数简单，收敛快等优势，但也有局部极值问题。
Without prejudice to the speed of convergence, it can resolve the problems of local optimal and sensitivity to initial values.
在不影响收敛速度的情况下，它能够很好解决局部最优以及对初始值敏感的问题。
The contrast optimization algorithm is described as an optimization model via which the local optimal solution can be achieved.
本文将对比度最优自聚焦算法等效为一个求解局部最优解的优化模型。
The results show that the method can overcome successfully the problems of local optimal solution and speed up training process.
结果表明这一方法可以有效地克服局部最优解给网络培训所为的困扰。
Combining a heuristic random searching strategy with local optimal algorithms is effective solution for complex optimization problem.
启发式随机搜索策略和局部优化算法相结合的求解方案是解决复杂函数优化的有效途径。
In the search process, Off-trap strategies are used to jump from local optimal solution and guide the search in promising directions.
在搜索的过程中，采取跳坑策略以跳出局部最优解，始终向目标最接近的方向搜索。
It offers optimal solution based on current circumstance and achieves a global suboptimal solution by several local optimal solutions.
它以当前的情况作最优选择，通过多个局部最优解最终获得一个全局次最优解。
Usually, the steepest descent algorithm is used to find the minimum of LOO upper-bound. However, it often gets local optimal solution.
由于该方法易陷入局部最优解，提出了一种基于混合遗传算法求解LOO上界极小点的核参数选择方法。
The experiments show that the algorithm has a defect that the robot may be into a deadlock because there may be local optimal solution.
实验表明，人工势场算法存在局部最优解的问题，机器人在实际场景下可能出现死锁情况。
The improved QIGA can effectively escape from the local optimal solutions and keep the balance between the solution quality and running time;
改进的QIGA不仅可以有效地跳出局部最优解，而且保持了解的质量与运行时间的一种平衡；
The new PSA USES variable constraints of local search and global search to avo id falling into local optimal solutions and the degeneration of solutions.
区别于传统捕食搜索算法，新算法采用变化的局部搜索和全局搜索限制，从而避免陷入局部最优和解的退化。
Iterative TFIDF algorithm belongs to hill-climbing algorithm, it has the common problem of converging to local optimal value and sensitive to initial point.
迭代tfidf算法属于爬山算法，初始值的选取对精度影响较大，算法容易收敛到局部最优值。
Chaos optimization is used to search all local optimal points of the entropy function in once searching, which can improve the efficiency of searching threshold.
并利用混沌优化的方法一次寻找出图像熵的多个极值点，提高了阈值寻找的效率。
The traditional training methods of Gaussian Mixture Model(GMM) are sensitive to the initial model parameters, which often leads to a local optimal parameter in practice.
为了解决传统高斯混合模型（GMM）对初值敏感，在实际训练中极易得到局部最优参数的问题，提出了一种采用微粒群算法优化GMM参数的新方法。
The BFGS algorithm applied in GCS is analyzed and pointed out two shortcomings: (1) always trapped in local optimal solution; (2) can not pass through the critical point.
分析了BFGS算法在约束求解中的应用，指出了在约束求解这一特定的领域利用BFGS算法进行约束求解的两大缺陷：（1）容易陷入局部最优解：（2）无法穿越临界点。
We prove that when the homotopy map is a regular map, the K-K-T point obtained from this homotopy method must be a local optimal solution by choosing proper homotopy equation.
证明了同伦映射为正则映射的条件下，选取合适的同伦方程，用此同伦方法得到的K-K-T点一定是问题局部最优解。
Improving BP neural network with simulated annealing algorithm can overcome the defect of falling into local optimal point easily, and further improve the network performance.
用模拟退火算法改进BP神经网络，克服了BP神经网络极易陷入局部最优点的缺点，进一步提高了网络的性能。
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 standard particle swarm optimization algorithm as a random global search algorithm, because of its rapid propagation in populations, easily into the local optimal solution.
标准的粒子群优化算法作为一种随机全局搜索算法，因其在种群中传播速度过快，易陷入局部最优解。
应用推荐