问题求解

Genetic Algorithm 0-1 knapsack problem, including steps to solve the problem.

遗传算法求解0-1背包问题，包含问题的求解步骤。

This problem is usually solved through Lagrangian relaxation, but this method is not effective in some situation.

因此，采用穷举法求解该问题，并通过实际的计算验证，使用穷举法可以很快求解出该问题的最优值。

In order to solve the linear strong parametrical excitation equation, the method for solving strong parametrical excitation Mathieu equation is brought out. With the introduction of a new conversion, the strong parametrical excitation problem is converted to weak parametrical excitation problem. The second order approximate periodic solutions are obtained and the transition curves are gained by using a modified strained parametrical method.

为适应求解垂荡与纵摇耦合运动的线性强参数激励方程，提出了强参数激励Mathieu方程的求解方法，通过引入新的变换，将强参数激励问题转化为弱参数激励问题，应用改进的变形参数法求其二阶近似周期解和过渡曲线。

In this paper, an algorithm based on heuristic function for minimum set covering problem is presented, as well as the definition of complete strategy concept and the method to structure heuristic function.

本文给出了求解NP困难问题的完备策略的概念，在此基础上提出了一个求解集合覆盖问题的启发函数算法SCHF（set－coveringheuristicfunction），文中对该算法的合理性、时间复杂性以及解的精度进行了分析，本文的主要创新点是用已知的完备策略建立启发函数，并用该启发函数进行空间搜索求出优化解。

Aiming at the difficulties of invalid solution and local minimum problems when traveling salesman problemis studied using Hopfield artificial neural network.

针对Hopfield神经网络在求解旅行商问题时出现的无效解和局部极小值问题，分析和比较两种改进的求解方法，首先从理论上证明算法的有效性，然后对两种算法分别进行计算机仿真，探讨网络收敛于全局有效解的途径。

The monodromy matrix of the closed-loop system is represented as a special form by which the periodic control law can be obtained via the solution to a time-inviant Sylvester matrix equation.

通过将闭环单值性矩阵进行一系列转化，周期输出反馈律的求解问题可以转化为一类Sylvester矩阵方程的求解问题。

In order to achieve accurate solutions of ill-conditioned GPS equations with a few observational epochs, the ill-conditioned normal equations of GPS rapid positioning was transformed as a function optimization problem. Then genetic algorithm was used to calculate parameter solutions, which avoided the inversion of coefficient matrix of normal equations.

为准确解算仅有少数几个历元的GPS载波相位观测数据的病态定位方程，将GPS快速定位的病态法方程求解问题转化为一个函数优化问题，应用遗传算法求解病态方程，避免了法方程的求逆运算，从而可以得到参数的近似最优解。

The research area involves computation of many optimization problems as well as many classical problems in numerical computation.

这方面研究不仅包括各种最优化问题的求解，也包括数值计算经典问题的求解。

The first part of this thesis is to solve the problem in one-dimensional.

在第一部分中，给出一维问题的求解，第二部分给出二维问题的求解，并用数值算例表明其有效性。

Based on the special decomposition of Hankel matrix, we can transform the problem of approximating a given matrix with a positive semidefinite real Hankel matrix of lower rank to a smooth unconstrained optimization problem.

对矩阵的低秩Hankel半正定矩阵逼近，采用特殊的分解形式，可将其转化为一个无约束的优化问题进行求解，本文应用拟牛顿方法求解无约束优化问题。

In the negative and interrogative forms, of course, this is identical to the non-emphatic forms.

。但是，在否定句或疑问句里，这种带有"do"的方法表达的效果却没有什么强调的意思。

Go down on one's knees;kneel down

屈膝跪下。。。下跪祈祷