upper bound algorithm

[ˈʌpɚ baʊnd ˈælɡəˌrɪðəm][ˈʌpə baund ˈælɡəriðəm]

[计] 上界算法

  • In the proof of the upper bound of the algorithm we consider mainly the last four batches . Then either there exist idle times among them or they are executed contiguously .

    在证明 算法 上界的过程中,我们主要考虑最后四批,它们之间要么有空闲时间,要么相继排列。

  • The binary decision tree algorithm are studied . the upper bound of its VC dimension was calculated and concluded that : upper bound of the VC dimension of binary decision tree algorithm rises as the node number of its result ( binary decision tree ) increases .

    运用二叉决策树算法,计算了它的VC维上限,并定性地指出:二叉决策树 算法的VC维 上限 随其结果(决策树)复杂度的增大而提高。

  • By using a tighter upper bound than current existing algorithms and a pruning strategy the algorithm is more efficient than the current existing algorithms .

    该算法通过采用一个比现有 算法更优的 上界和一个剪枝策略获得了更高的效率。

  • A lower guaranteed cost function upper bound and jumps and a suboptimal guaranteed cost state feedback controller are obtained by solving the optimization problem . A new algorithm is presented to design an impulsive controller and a feedback controller for a class of impulsive switched singular systems .

    求解这个优化问题能够得到较小的保成本函数 上界和状态跳变及一个次优的保成本状态反馈控制器。对一类脉冲切换广义系统,提出了脉冲控制器和反馈控制器设计的一个新 算法

  • Approximate Upper - Bound Solution for Bearing Capacity of Strip Footings near Excavations The Models of Approximate Algorithm

    临近基坑条形基础地基承载力简化 上限解近似 算法的几种模型

  • The concepts of competitive algorithm are introduced and competitive algorithm for on line multiprocessor scheduling is obtained . The best upper bound of the algorithm 's competitive rate is proved to be 2-1 m .

    介绍了局内问题的竞争算法,给出了多种任务加工表局内问题的竞争算法, 估计了竞争率,并且证明了2-1m是该竞争 算法竞争率的最好 上界,其中m是机器台数。

  • A hybrid algorithm combined with dynamic programming and the lower bound ( or upper bound ) algorithm is proposed . It is on the basis of analysing the depth first search ( DFS ) and the breadth first search ( BFS ) methods .

    本文分析了深度优先搜索方法(DFS)和广度优先搜索(BFS)方法的特点,提出了一种混合使用动态规划方法和下界( 上界算法的精确求解方法求解组合优化问题。

  • The upper bound of errors of the algorithm is also analyzed theoretically . 2 .

    并对 算法的误差 上界进行了理论分析研究。 算法具有 较高 时空 效率和精确度。

  • Control input is restricted by using the upper bound for its Euclidian 2-norm . An improved ILMI ( Iterative LMI ) algorithm is proposed to solve the problem of PI output feedback control with constraint on control input for aero-engine .

    利用被控对象中控制向量2范数 上界的限制,提出了一种改进ILMI(IterativeLMI) 算法,用于解决控制受约束的航空发动机PI控制器的一种LMI描述求解问题。

  • An upper bound on the length of the test set and the complexity of computation are analyzed . It shows that this algorithm is suitable for large combinational networks .

    对算法的计算复杂性和测试长度的 上界进行了分析,表明该 算法可用于大型组合网络的多故障测试生成。

  • Besides in view of the long computing time of precise algorithm upper bound method and multi-thread technique is successively used for making improvement to the recursive algorithm . These two methods decrease the operation time effectively .

    此外,针对递归技术是精确算法,计算时间较长的缺陷,先后运用 上界法和多线程技术对递归 算法进行改进,有效减少运算时间。

  • The elaborate theoretical analyses prove the upper bound of dynamic programming and no sharing method and the lower bound of greedy algorithm and dynamic programming .

    使用理论分析证明了动态规划与不共享的性能 上界,以及贪心 算法与动态规划方法的性能下界。

  • Although it has the high time complexity the new lower and upper bound method can be used as the second step of the whole algorithm with the increased pruning power .

    新的 下界函数的时间复杂度比较高,但由于过滤能力的较大增强,可以作为两步式 方法的第二步。

  • Minimizing the LOO upper bound is one of efficient method to select kernel-parameter . Usually the steepest descent algorithm is used to find the minimum of LOO upper-bound .

    通过最速下降法求 LOO 上界的极小点来确定核参数是一种新的核参数选择方法。

  • FFD-LPT algorithm DLPT improved binary search algorithm is the upper bound of the algorithm the search space smaller .

    FFD-LPT算法改进了DLPT算法二分搜索的 上界,使 算法的搜索空间较小。