英语人>网络例句>optimization problem 相关的网络例句
optimization problem相关的网络例句

查询词典 optimization problem

与 optimization problem 相关的网络例句 [注:此内容来源于网络,仅供参考]

Moreover, if the optimization problem has certain special feature, the simpler relaxation methods can be provided. For example, considering a generalized geometric programming problem, relevant relaxation linear programming can be obtained using its special structure. Based on the branch and bound method, a linear relaxation algorithm of global optimization is presented for generalized geometric programming, and the convergence of the algorithm is also proven.

此外,当优化问题具有某种特殊性质时,我们能给出更加简便的松弛化方法,如考虑广义几何规划问题,能充分利用其特殊结构,建立了广义几何规划问题的松弛线性规划问题;在分枝定界技术的基础上,提出了一个求广义几何规划全局解的线性松弛算法;证明了算法的收敛性。

The membership function can exactly express the fuzzy satisfaction set by considering the vagueness of satisfaction degree of objectives and introducing the membership function for the fuzzy satisfaction sets of system reliability and system cost. The normal distribution and Cauchy distribution of this membership function is modified according to the fuzzy satisfaction sets. By doing this, the multi-objective optimization problem can be converted to a single-objective optimization problem to be solved.

模型充分考虑到目标满意度的模糊性,通过引入系统可靠度与费用的模糊满意集的隶属函数,并根据它们的模糊满意集对其正态分布、柯西分布进行适当修改,使之能够准确表达通常情况下的这两个目标的模糊满意集,最终,把两目标优化问题转化为常规单目标优化问题求解。

The center coordinates of the n circles can then be obtained. The problem is reduced to a nonlinear constrained optimization problem of finding the minimum circumscribed circle for the n central points through regional optimization.

为求这平面点列的最小包容圆,将问题转化为非线性约束最优化问题,通过分区优化搜索算法求解目标。

The maximum clique problem is a classical combinatorial optimization problem, and finds many important applications in different domains, this paper surveys the current progress on MCP. The Cross Entropy method for combinatorial optimization is proposed by Reuven Y.

最大团问题是一个经典的组合优化问题,在理论研究和实际应用方面都有重要的价值,本文对最大团问题的最新研究进展做了分析综述。

In the optimization problem, the more common is combinatorial optimization problem.

在优化问题中,比较常见的是组合优化问题。

Optimization solution algorithm is the most important in topology optimization.Algorithms fit for discrete structure and continuum structure are all investigated. Thecharacteristic and different using limit of both optimization criteria method andmathematics programming method are all analyzed in this paper. OC algorithm and theseries MMA algorithm based on SIMP approach are deducedand used for the topology optimization problem of continuum structure.

优化求解算法是拓扑优化问题求解的核心和关键,本文系统分析了适用于离散结构和连续体结构优化的优化求解算法,重点讨论了 OC 算法和 MP 算法,分析比较了不同算法的特点和适用范围,推导了基于 SIMP 理论的优化准则法和 MMA 系列算法,并将MMA 系列算法应用于连续体结构拓扑优化问题的求解。

By defining time span combination, the continuous varying parameter optimization problem is transformed to discrete multi-parameter optimization problem and model is constructed.

引入时段组合的概念,将连续问题转化成离散问题,将变参数优化问题转化成多参数优化问题,建立了相应的数学模型,并给出简化求解的方法。

Optimization design is often used in the design of MRI superconducting main magnet, where all variables are treated as continuous ones. According to the fact that not all variables are continuous, here the design problem is seen as a global optimization problem with discrete variables.

软件简介:在进行MRI超导主磁体的设计时常采用优化设计的方法,将各设计参数看作连续变量处理,但实际上很多参数是离散变量,为了更符合工程实际,将超导MRI 主磁体的设计作为一个含有离散变量的全局优化问题。

This algorithm constructs a set of linear equations. As a result, the relation of the reconstructed design variables and the original design variables is derived, the variable number of optimum design is decreased from m + n + 2 to 4, and the equality constraint optimization problem is converted into reduced- dimension no equality constraint optimization problem.

该算法通过构造一组线性方程,得到了由重构设计变量到原设计变量的映射关系,使优化设计的变量由原来的m + n + 2个减少到4个,并将有等式约束优化问题转换成降维的无等式约束优化问题。

In this paper, we show that when the data matrices are $2\times 2$ and $3\times 3$-dimensional, we can transfer the problem into an optimization problem with quadratic matrix inequality constraints, based on another equivalent robust optimization problem converted from the original one.

本文表明,当数据矩阵为2乘2阶,3乘3阶矩阵时,我们可以把上述问题转化成二次矩阵不等式约束的最优化问题。

第3/64页 首页 < 1 2 3 4 5 6 7 8 9 ... > 尾页
推荐网络例句

We have no common name for a mime of Sophron or Xenarchus and a Socratic Conversation; and we should still be without one even if the imitation in the two instances were in trimeters or elegiacs or some other kind of verse--though it is the way with people to tack on 'poet' to the name of a metre, and talk of elegiac-poets and epic-poets, thinking that they call them poets not by reason of the imitative nature of their work, but indiscriminately by reason of the metre they write in.

索夫农 、森那库斯和苏格拉底式的对话采用的模仿没有一个公共的名称;三音步诗、挽歌体或其他类型的诗的模仿也没有——人们把&诗人&这一名词和格律名称结合到一起,称之为挽歌体诗人或者史诗诗人,他们被称为诗人,似乎只是因为遵守格律写作,而非他们作品的模仿本质。

The relationship between communicative competence and grammar teaching should be that of the ends and the means.

交际能力和语法的关系应该是目标与途径的关系。

This is not paper type of business,it's people business,with such huge money involved.

这不是纸上谈兵式的交易,这是人与人的业务,而且涉及金额巨大。