- 更多网络例句与极小解相关的网络例句 [注:此内容来源于网络,仅供参考]
-
With the definition of discrete local minimal solution of an integer programming problem,this paper presents a neighbourhood search algorithm for finding a discrete local minimal solution of the problem.
首先,给出整数规划问题的离散局部极小解的定义,并设计找离散局部极小解的邻域搜索算法。其次,构造整数规划问题的填充函数算法。
-
The solution by the method is egalitarian and efficient. Under some condition, it is the lexicographic maximin solution.
柔性 决策方法,根据这种方法求出的解具有公平性和有效性,符合管理科学的基本原则;在一定的条件下,这种解也是字典序极大极小解。
-
When the target is of nonpositive curvature in the sense of Alexandrov, the noncharacteristic condition of the domain was removed and the uniqueness and local Holder continuity of energy minimizers were obtained.
当靶空间是非正曲率(Alexandrov意义下)空间时,定义域的非特征条件可以去掉,并可以得到能量极小解的唯一性和局部Hlder连续性。
-
It may be possible to overcome local minima and converge more fast when it is used with the initializing method.
若结合本文的初始化方法一同使用,则收敛更快速,且有可能克服局部极小解问题。
-
This is a group of solutions "to be minimal solution."
这样得到的一组解为"拟极小解"。
-
When election time element, the number of available "to be minimal solution."
当被选元素不同时,可得到多个"拟极小解"。
-
Then a filled function method for the integer programming problem is proposed,which tries to find a better discrete local minimal solution of the problem by minimizing a filled function.
该方法通过寻找填充函数的离散局部极小解以期找到整数规划问题的比当前离散局部极小解好的解。该文的算法是直接法,数值试验表明算法是有效的。
-
By employing the approaches for upper and lower solutions and monotone iterative technique, the authors have obtained the sufficient conditions for the existence of coupled maximal solution and minimal solution.
通过上下解方法和单调迭代技术得到了边值问题存在耦合极大解β-和极小解α-的充分条件。
-
If moreover the domain is a smooth open set in a Carnot group, the energy minimizer is locally Lipschitz continuous.
如果进一步假设定义域是Carnot群中的区域,作者证明了能量极小解的局部Lipschitz连续性。
-
Further, it is found that the limit curve is a uniform rational cubic B-spline curve or the curve's control polygon when its tension parameters tend to zero or infinity respectively.
Barsky[4 ] 将具有张力参数样条的双曲样条曲线引入CAGD ,称之为张力样条参数曲线,并证明了这种曲线是一类泛函问题的极小解。
- 更多网络解释与极小解相关的网络解释 [注:此内容来源于网络,仅供参考]
-
minimal propositional calculus:极小命题演算
minimal polynomial 极小多项式 | minimal propositional calculus 极小命题演算 | minimal solution 极小解
-
minimal solution:极小解
minimal propositional calculus 极小命题演算 | minimal solution 极小解 | minimal submanifold 极小子廖
-
The minimal solution:最小解
极小子群:minimal subgroups | 最小解:The minimal solution | 最小覆盖:minimal cover
-
minimal submanifold:极小子廖
minimal solution 极小解 | minimal submanifold 极小子廖 | minimal sufficient estimator 最小充分估计量
-
minimax solution:极大极小解,极小极大解,极值解
minimax search in game trees 博弈树极大极小搜索 | minimax solution 极大极小解,极小极大解,极值解 | minimization of Boolean function 布尔函数的最小化
-
minimum density:极小密度
minimum covering 极小覆盖 | minimum density 极小密度 | minimum integral 极小解
-
minimum integral:极小解
minimum density 极小密度 | minimum integral 极小解 | minimum modulus 最小模
-
minimum modulus:最小模
minimum integral 极小解 | minimum modulus 最小模 | minimum modulus principle 最小模原理
-
minimum problem:极小问题
minimum principle 极小原理 | minimum problem 极小问题 | minimum solution 极小解
-
minimum solution:极小解
minimum problem 极小问题 | minimum solution 极小解 | minimum value 最小值