查询词典 sequencing problem

How to deal with the restrictions of deep excavation is a very difficult problem. This paper analyzes the restrictions of pile-support structure detailedly, uses a castigatory function to deal with the restrictions, and adds the castigation to the function. Now the problem has changed to solve a minimal problem, and GA can be used to the optimal design successfully.

束条件的处理是遗传算法应用到深基坑支护结构优化的难题和重点，本文详细分析了桩撑支护结构的约束条件，采用了罚函数法对约束条件进行处理并反映到适应度函数上，使其变为无约束的极小值问题，从而使遗传算法得以顺利实施。

One of graph edge coloring and graph total coloring problem, as well as whole graph chromatic number problem can be converted to graph vertex coloring to deal with problem.

其中图的边着色和图的全着色问题以及图的色数问题都可以转化为图的顶点着色问题进行处理。

We also show that the one-to-one defensive competition problem is a generalization of the Tukey median problem and the smallest enclosing circle problem which are two famous problems in computational geometry.

同时我们也讨论了竞争性区位设施之防御问题与其他计算几何领域内的著名题目例如，Tukey 中间值及最小圆盘集合之间的关系。

The structure theorem is obtained by defining "ternary ordered partition method" which is used to choose the test-sets of the first $k$ tests, and by defining two operations and two relations on feedback sequences; The isomorphism classification theorem is strictly proved by virtue of the structure theorem, thus the complicated problem of discussing $3^k$ possible search domains is reduced to the relatively easy problem on $k+1$ representative search domains; By the techniques of "super-coin construction method" and "image-union method", the search problem on $k+1$ representative search domains is reduced to the simple verification of several conditions on finite space of small cardinality.

通过引入用于选取前$k$次试验的试验集的"三元有序剖分法"以及关于反馈序列的两种运算和两种关系，得到了结构定理；基于结构定理严格地证明了同构类定理，从而将必须针对$3^k$个搜索域的复杂问题转变为讨论$k+1$个具代表性的搜索域的相对简单的问题；通过"构造超币法"和"并像法"等技术手段，将关于$k+1$个具代表性的搜索域的搜索问题转化为简单的关于势非常小的有限空间的几个条件的验证问题。

Third, remember when the subject made the problem clear paste, post the contents in detail, so that other machines You can understand your problem and solve your problem faster.

三、发问题贴时切记主题明确，贴子内容详细，以便其他机友能够明白你的问题所在而更快的解决你的问题。

The collisions of rigid bodies is a classical problem, however, the coefficient of restitution is used in the conventional researches to study this problem. The authors present a new way for this kind of problem. A theory of the collision between two rigid bodies in two dimensions, taking account of friction, is proposed according the Newton first law. And the shortages of former researchers are justified.

刚体碰撞是力学上的一个经典问题，但目前大都采用给定恢复系数进行分析的方法，本文则直接从两刚体碰撞时Newton第二定律出发，建立了计及摩擦的两刚体碰撞基本理论，并指出了以往研究通过给定恢复系数方法的错误之处。

In the paper, the via minimization problem in multi layer routing with adjacent constraints is translated to a k colorable problem which has more general meanings, and a mean field annealing algorithm for the k colorable problem is proposed.

该文把具有相邻约束的多层通孔最小化问题转换为更具广泛意义的 k-着色问题，并提出了 k-着色问题的均场退火求解算法。

The maximum network flow problem is not only a classical combinatorial optimization problem, but also a special linear programming problem.

网络最大流问题是一个经典的组合优化问题，同时也是一个特殊的线性规划问题。

the container loading problem with wide practical application is a combinatorial optimization problem, and is np-hard problem.

集装箱装载问题是一种有广泛应用背景的组合优化问题，它属于np-hard问题。

QoS multicast routing problem is a nonlinear combinatorial optimization problem,which has been proved that the problem is NP-complete problems.

QoS组播路由问题是一个非线性的组合优化问题，已证明了该问题是NP完全问题。

Chimborazo and Cotopaxi, took me by the hand.

越过琴博腊索山和科托帕克西山。

This car is in a good condition.

这辆车的状况很好。