• Finally, the way of seeking for the global optimum plan by the decision-in...

    最后用决策指数提出了探索公差分配的总体最优方案的方法。

    youdao

  • It is proved that the algorithm converges to the global optimum in probability.

    分析结果表明人口迁移算法依概率收敛到全局最优解。

    youdao

  • The outstanding advantage of SA is that it can find the global optimum solution.

    介绍了一种新的优化设计方法——模拟退火算法,其突出的优点是可以求得全局最优解。

    youdao

  • Usually, the algorithm can quickly converge to the global optimum weight coefficients.

    该方法对目标函数无连续、可微等要求,能较快地收敛到全局最优权系数。

    youdao

  • It is proven that the algorithm can guarantee the convergence towards the global optimum.

    这种算法被证明为能收敛至全局最优。

    youdao

  • Finally, the way of seeking for the global optimum plan by the decision-index is proposed.

    最后用决策指数提出了探索公差分配的总体最优方案的方法。

    youdao

  • The fact that it is impossible to find the global optimum in polynomial complexity has been proved.

    理论上已经证明要在多项式时间复杂度内对这一类问题找到全局最优解是不可能的。

    youdao

  • SVM has good characteristics of simple structure, global optimum and strong generalization ability.

    支持向量机分类器结构简单、可获得全局最优、泛化能力强。

    youdao

  • Proved by simulation model the global optimum which meets the integer stability of crane is obtained.

    经系统模型检验,得到满足整体稳定性的最优解。

    youdao

  • Mining is a complex process. The global optimum decision for mines can be regarded as a complex large system.

    矿山开采是一复杂的过程,其全局优化决策可视为一个复杂的大系统。

    youdao

  • Global optimum solution may be obtained by making interactive iteration and statistical analysis of a great deal of data.

    通过对大量数据进行统计,用交互迭代的方法求出全局最优解。

    youdao

  • The experiment shows the algorithm can surely and rapidly get global optimum solution and greatly improve con vergence rate.

    实验结果表明,该算法能够保证求得全局最优解,并且寻优速度有很大提高。

    youdao

  • The paper deeply studied processing flow and implemented techniques of hybrid global optimum automatic residual static corrections.

    文中对混合全局优化自动剩余静校正的处理流程和实现技术作了深入研究。

    youdao

  • The main objective of modern optimization algorithm is to deal with the problem of global optimum, which is essentially probabilistic.

    现代优化算法主要解决全局最优问题,其本质是概率性的。

    youdao

  • Three-dimensional component packing is a combinatorial optimization and NP-complete problem. It is difficult to find its exact global optimum.

    三维布局问题属于组合最优化问题和NP完全问题,在一定时间内求其精确全局最优解是相当困难的。

    youdao

  • Image matching belongs to constrained optimization problems. Whether the system would converge to the global optimum is still an open problem.

    图像匹配是一种约束最优化问题,系统是否收敛于全局最优值一直尚未解决。

    youdao

  • Genetic algorithms (GAs) with self-adapting step size can search the best solution directly and more likely to acquire the global optimum result.

    具有自适应步长的遗传算法可以直接搜索全局最优解。

    youdao

  • Comparing with other searching methods using GA directly for obtaining global optimum, MMS combines ds with GA to achieve rapid convergence speed.

    与其它直接利用GA进行全局优化的方法相比,MMS利用DS配合GA实现加速收敛。

    youdao

  • The immune memory units guarantee this algorithm rapid convergence to global optimum and the uniform crossover operator embody the idea of evolution.

    算法中的免疫记忆单元确保了快速收敛于全局最优解,算法中的均匀交叉操作则体现了进化的思想。

    youdao

  • It maintains the serial sequence that the simulated annealing requires, and converges to a global optimum solution. And at the same time, it speeds up...

    既确保了模拟退火的串行顺序,使解趋于最优,又缩短了达到最优所需时间,提高了并行计算效率。

    youdao

  • The calculation results of computational examples with the algorithm proposed are given. The algorithm is shown to be steadily convergent at global optimum.

    最后,给出了该算法的计算实例,结果表明,用该算法能较稳定地找出全局最优点。

    youdao

  • The GA uses a population of points at a time in contrast to the single point approach by the traditional ones, and will guarantee to find the global optimum.

    与经典优化算法不同的特点在于,遗传算法是从多个初始点开始寻优,沿多路径搜索实现全局或准全局最优。

    youdao

  • Theoretical analysis and simulation results show that AGA can not only get the global optimum value in arbitrary precision, but also raise efficiency remarkably.

    理论分析和仿真实验表明改进算法不仅具有以任意精度达到全局最优值的能力,而且具有更高的优化效率。

    youdao

  • In the paper, the problem of computing discrepancy in the LH design is studied, a lower-bound of discrepancy is obtained, and the global optimum LH design is studied.

    本文对LH设计编差的计算进行了研究,并得到了LH设计偏差的下界,对寻求整体最优LH设计进行了讨论。

    youdao

  • In the paper, the problem of computing discrepancy in the LH design is studied, a lower-bound of discrepancy is obtained, and the global optimum LH design is studied.

    本文对LH设计编差的计算进行了研究,并得到了LH设计偏差的下界,对寻求整体最优LH设计进行了讨论。

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定