您要查找的是不是：
- upper bound algorithm [计] 上界算法
- A number X is called an almost upper bound of A. 数X称为A的殆上界。
- No upper bound on the event detail length is set. 则不设置事件详细信息长度的上限。
- Sets the upper bound of the constraint. 设置最大的约束范围。
- The upper bound of a stack,the highest numbered location. 堆栈的上界，即编号最大的存储单元。
- The upper bound of a stack;the highest numbered location. 堆栈的上界，即编号最大的存储单元。参阅stack。
- Gets the upper bound of the range of invalid indexes. 获取无效索引范围的上限。
- An integer representing the upper bound of the range. 表示范围上限的整数。
- Each index can vary from zero through its upper bound value. 每个索引可以在零到上限值之间变化。
- Specify the index upper bound in the array variable declaration. 在数组变量声明中指定索引上限。
- The upper bound of Km1,m2 is worked out,and accordingly,lessened. 找出了Km1,m2表示数的上限,并进一步缩小上限;
- The upper bound of a stack; the highest numbered location. 堆栈的上界，即编号最大的存储单元。参阅stack。
- The upper bound of life span for the solution was obtained. 得到了解的爆破时间跨度的上界。
- First we provide an analog of the extended Games-Chan algorithm which can yield a tight upper bound for the 2-adic complexity of periodic binary sequences with period 2~mp~n. 首先给出了类似的扩展Games-Chan算法,利用这一算法,可以确定周期为2~mp~n的二元序列的2-adic复杂度的一个有效上界。
- 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. 针对一类非线性比式和问题首次提出一种求其全局最优解的单纯形分枝定界算法。
- It is possible to use -1 to declare the upper bound of an array dimension. 可以使用-1来声明数组维度的上限。
- There are many classical solution methods for bilevel programming such as culmination searching algorithm,branch and bound algorithm and penalty function algorithm. 对于二层规划问题有许多经典的求解方法,如极点搜索法、分支定界法和罚函数法等。
- Now the best estimate of upper bound is L_K
