The design and analysis of algorithms for the first class semi on - line parallel machine scheduling problems are considered 介绍它们定义和在不同机器环境和目标函数下半在线排序问题分类,以及第一类半在线模型的近似算法的设计及其竞争比分析。
But , while scale increases , solving process become too long , so we need approximate algorithm to achieve the balance between the quality of result and time 当规模增大时,求解的规模呈指数增长,需要采用近似算法均衡最终解质量和求解时间。
Conf . knowledge discovery and data mining , san diego , ca , usa , aug . 1999 , pp . 23 - 32 . 22 vitter j s . an efficient algorithm for sequentialrandom sampling 可以说, ms在一定程度上较好地解决了基于取样策略的关联规则挖掘近似算法“取样复杂性”难于确定的问题。
Numerical examples are given to illustrate that the norm errors of the approximate algorithm is generally small , while the smaller the absolute value is , the greater the component errors will be 数值算例表明:该近似算法的范数误差一般较小,而绝对量较小的分量误差较大。