查询词典 problem

The problem is divided into two sub-problems: task assignment problem and task merging problem.

提出了将原问题分解为任务分配与任务合成的分解优化思路。

It is related to the variational inequality problem, bilinear programming, nonlinear equation. So there is actual meaning and theories value to study how to solve it.In recent years, many algorithms for solving the generalized linear complementarity problem are put forward. But they basically belong to the traditional iterative methods, and may not be efficient since the computing time required for a solution is greatly dependent on the dimension, structure of the problem and the complexity of the algorithm used. Different from the traditional algorithms, the neural network has many advantages on calculations and real-time applications for its inherent massive parallelism and electric circuit implementation.

近年来，人们对广义线性互补问题提出了许多算法，但这些方法基本上属于传统的迭代法，由于它们的计算时间极大地依赖于问题的规模、维数以及所使用的算法，因此很难满足实时并行的要求，与传统数值方法不同，由于内在的并行分布处理信息的特点及电路实现的潜能，神经网络有着许多计算上的优势和实时性的应用，自Hopfield提出著名的人工神经网络模型-Hopfield神经网络，并将其成功应用于优化问题后，用神经网络求解优化问题得到了相当深入的研究，并取得了许多重要的成果。

Abortion is a problem closely related to women, meanwhile, it is a social ethics problem and bioethics problem.

堕胎是一个与女性密切相关的问题，同时，它又是一个社会伦理问题和生命伦理问题。

The general form of solution for the non symmetric matrix A is given, the expression of optimal approximation solution is presented, and an algorithm for solving the problem is described. The total least squares problem with symmetric and bisymmetry constraints is discussed respectively. A sufficient condition for existence of solution is derived by use of the theory of matrix Ricaati equation. The general form of solution is given if the problem has a solution, and the expression of optimal approximation solution is presented. Some numerical examples are given.

对矩阵A是非对称情形，给出了解的一般表达式，证明了最佳逼近问题解的存在唯一性，并给出了其解的表达式，描述了求解问题的算法；讨论了带对称和双对称约束的总体最小二乘问题，利用Ricaati矩阵方程的理论得到了解存在的一个充分条件，分别对对称矩阵和双对称矩阵两种情形，给出了解的一般表达式，证明了最佳逼近问题解的存在唯一性，给出了其解的表达式，提出了求解这些问题的算法，并给出了数值例子。

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

但如果你知道这是个变异的问题，或者是一个凸优化问题，或者一个布尔的逻辑问题，然后你起码能知道从哪着手开始寻找解决方案。

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.

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

Plunder melds and run with this jewel!

掠夺melds和运行与此宝石！

My dream is to be a crazy growing tree and extend at the edge between the city and the forest.

此刻，也许正是在通往天国的路上，我体验着这白色的晕旋。