优化问题

In fact, people's experience shows that it is among the hardest combinatorial optimization problems.

人们的经验表明，它是最难的组合优化问题之一。

The algorithm in parallel computer system for combinatorial optimization problems for the reflection of their own advantages.

该算法的并行计算机制在组合优化问题的求解中体现了自身的优势。

Computation results show that the algorithm is efficient to combinatorial optimization problems.

本文主要研究利用神经网络的计算原理和方法求解四个组合优化问题。

So it is widely applied to complication combinatorial optimization problems.

蚂蚁算法是一种新型的进化算法，它具有许多优良的性质，因此被广泛用于求解各类组合优化问题。

The main contributions of this dissertation can be summarized as follows: First of all, operation and compositor between interval numbers are summarized. Homology and dissimilarity between interval number and grey number are compared.

本文讨论了含有区间数的一类不确定性优化问题，主要研究内容如下：第一，对区间数之间的运算和排序进行了综述，对区间数和灰数从7个方面作了比较。

The experimental results show that for most continuous optimization problems, the strategy of concave function gains an advantage over the linear strategy, while the linear strategy outperforms strategy of convex function with the identical initial and final weights.

试验结果表明，对于多数连续优化问题，在初始权值和最终权值相同的情况下，凹函数递减策略优于线性策略，而线性策略优于凸函数策略，凹函数递减策略能够在不影响收敛精度的情况下较大幅度地提高粒子群算法的收敛速度。

In this paper, a trust region method with new conic model for linearly constrained optimization problems is proposed.

本文提出了一个解线性等式约束优化问题的新锥模型信赖域方法。

The conjugate gradient method is one of the most efficient methods for solving unconstrained optimization problems.

摘要共轭梯度法是求解无约束优化问题的一类有效方法。

The conjugate gradient method is one of the most effi...

共轭梯度方法是求解无约束优化问题的一类有效方法。

General method, including steepest descent method, conjugate gradient method and Dynamic Programming, is t...

新型的智能仿生算法在动态优化问题中的应用也逐渐增多。

For a big chunk of credit-card losses; the number of filings (and thus charge-off rates) would be rising again, whether

年美国个人破产法的一个改动使得破产登记急速下降，而后引起了信用卡大规模的亏损。

Eph. 4:23 And that you be renewed in the spirit of your mind

弗四23 而在你们心思的灵里得以更新