查询词典 problem on obstacle

Problem, or a convex optimization problem, or a boolean logic problem, then you at least know where to start looking for the solution.

者是一个凸优化问题，或者一个布尔的逻辑问题，然后你起码能知道从哪着手开始寻找解决

The braid group is infinite non-commutative group, and it has many hard problems that can be utilized to design cryptographic primitives, such as the word problem, conjugacy problem and root problem.

辫群是一种非交换的无限群，该群中有许多困难问题是不可解的，如字问题、共轭问题和根问题等，利用这些困难问题可以去设计一些密码协议。

The topics are divided into three parts: the first part introduced the basic concepts of algorithms, mathematical algorithms and algorithms based on complexity analysis scheduling problem for the second part of the problem and plans to discuss a variety of existing algorithms, and describes the design of commonly used algorithms including sub-rule law, greedy method, dynamic programming, backtracking and branch and bound method, and describes the complexity of the calculation, as well as NP-complete problem the third part of the model on parallel computing and parallel algorithm design techniques.

全书分为3个部分：第一部分介绍算法的基本概念、算法的数学基础以及算法复杂度分析；第二部分针对排序问题和图的问题，讨论各种已有的算法，并介绍常用的算法设计方法包括分治法、贪心法、动态规划法、回溯法和分支限界法，并介绍了计算的复杂性以及NP完全问题；第三部分讲述并行计算模型和并行算法设计技术。

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 Porsche Owner: But it's my car!

可，这是我的车呀。

LOX_83}{Oh, another bunch of wackos.

{LOX_83}{呃，又一群怪人。