您要查找的是不是:
- lower bound algorithm [计] 下界算法
- X is the lower bound for integrating ERF. X为ERF函数的积分下限。
- Sets the lower bound of the constraint. 设置最小的约束范围。
- The lower bound always equals 0. 下限始终等于0。
- The greatest lower bound of A is also called the infimum of A. A的最大下界边称为A的下确界。
- If a lower bound or size is not specified, it is simply omitted. 如果未指定下限及大小,它将完全被省略。
- However, you cannot specify any other value for the lower bound. 但是,不能将任何其他值指定为下限。
- All dimensions of an array must have a zero lower bound. 数组的所有维数必须具有零下限。
- The lower bound is always zero, whether you specify it or not. 无论您是否指定,下限始终是零。
- The lower bound of an Array is the index of its first element. Array的下限是其第一个元素的索引。
- The Cramer-Rao lower bound is developed for the data model. 给出了所用模型的克拉美劳下限。
- The storage costs still imply a lower bound, but one below zero. 存储成本仍意味着一个下限,而这个下限是零以下。
- The exact solution proposed to the remaining of COP is a hybrid method combined with dynamic program, bound algorithm and heuristics. 最后综合动态规划方法、下界算法和近似方法提出了一种精确求解同顺序加工调度问题的启发式双侧广度优先搜索方法。
- An almost lower bound is defined similarly as an almost upper bound. 殆下界的定义与殆上界是类似的。
- This paper presents for the first time a simplicial branch and bound algorithm for globally solving a class of nonlinear sum of ratios problem. 针对一类非线性比式和问题首次提出一种求其全局最优解的单纯形分枝定界算法。
- The rank of the safe arrays is always 1 and the lower bound is always 0. 安全数组的秩始终为1,而下限始终为0。
- There are many classical solution methods for bilevel programming such as culmination searching algorithm,branch and bound algorithm and penalty function algorithm. 对于二层规划问题有许多经典的求解方法,如极点搜索法、分支定界法和罚函数法等。
- The resulting array is always one-dimensional with a lower bound of zero. 结果数组始终是具有零下限的一维数组。
- Branch and Bound algorithm is a general method for solving Combinatorial Optimization Problems.Parallelization is an effective means to improve the algorithm performance. 分枝限界算法是一种求解组合优化问题的一般性方法,并行化是提高算法性能的有效手段。
- C-style arrays are one-dimensional typed arrays with a fixed lower bound of 0. C样式数组是具有固定下限0的一维类型化数组。