查询词典 combinatorial optimization problem

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-着色问题的均场退火求解算法。

Although the IPv4 has already obtained to make the person is hard to place the success of the letter, along with lately- apply flow out continuously now, the traditional IPv4 agreement is hard have already supported an Internet to extend further with the characteristic of the new business, among them the most attractive with the most remarkable of can improve it to be placed in in its address space of size, expand a sex problem,manage a problem and choose road in addition a difficulty,service of the consignation and the safety problem of the improvement and the service quality characteristic is also convex appear, so the IPv6 transitions become no time for waiting now.

虽然IPv4已经取得了令人难以置信的成功，但随着新应用的不断涌现，传统的IPv4协议已经难以支持互联网的进一步扩张和新业务的特性，其中最显眼和最值得注意的可改进之处在于其地址空间的大小，除此之外扩展性问题、管理问题、选路困难、服务的改进和服务质量特性的交付以及安全性问题也凸现出来，因此现IPv6过渡变得迫不及待了。

The user's utility is a function of his data throughput, thus the bandwidth resource utilization problem is modeled as a utility based constrained maximization problem, called a system problem.

通过设置站点吞吐量的对数效用函数，将带宽资源的有效利用问题建模为系统效用最大化问题；应用最优化理论将此系统问题等效为可分布式求解的用户问题，即各站点只须独立选择最大化其净效用的竞争参数，则系统整体效用也获得最大化。

An exceptional condition is a problem that divvents the continuation of the method or scope that you're in. It's important to distinguish an exceptional condition from a normal problem, in which you have enough information in the current context to somehow cope with the difficulty. With an exceptional condition, you cannot continue processing because you don't have the information necessary to deal with the problem in the current context .

异常条件是阻止你的方法正常运行的一个问题，在普通的问题当中分别出这些异常的条件是很重要的，对于普通的问题在当前的环境中你有足够的信息来应付这个难题，但是对于一个异常条件你则无法解决因为在当前的环境中你没有足够的信息来处理这个问题。

Keywords Closed convex cone;gradient projection method;Least-squares solution;Inverse matrix problem;Inverse eigenvalue problem;Matrix completion problem;Optimal approximation

Article From 湖南大学；应用数学博士论文 2005年度闭凸锥；投影梯度法；最小二乘解；矩阵反问题；矩阵逆特征值问题；矩阵完全化；最佳逼近

In the first part, convex duality method linearizes convex wealth equation, and the introduction of Lagrange multiplier converts original problem to an unconstrained static optimum problem. At last, we obtain another equivalent optimum problem with convex control domain.

文章前一部分运用凸对偶的方法先将财富方程线性化，Lagrange乘子的引入使最优问题等价与一个无约束的静态最优问题，最后转化为一个凸控制域的最优问题。

To increase the running speed of the collision detection algorithm, a new approach is proposed, which uses convex Bounding Volume Hierarchies to express convex polyhedron. Thus the distance problem of two convex polyhedrons is come down to a nonlinear programming problem with constraints. The nonlinear programming problem can be solved by simulated annealing genetic algorithm.

为了提高碰撞检测算法的速度，提出用顶点的凸包表示凸多面体，将两个凸多面体间距离的问题归结为一个带约束条件的非线性规划问题，利用模拟退火遗传算法对该问题进行求解。

Effective local search tactics reaches local searchers when they are ready to buy - with every way that it is possible for them to buy from you.

有效的地方搜索策略达到当地的搜索，当他们准备购买-以各种方式，这是他们有可能从您那里进行购买。

The first two are periodic sentences for their beginnings; and the fifth and the last are also periodic sentences each for the embedding of a parenthetic structure.

1960年代中后期，当战后女权主义和当时的许多其他抗议运动在西欧和北美发展成某种势力时，性别的概念演绎成补充和延伸生物性别差异的概念。