For the total tardiness scheduling with precedence constraints , an approximation algorithm with polynomial complexity was presented by transplanting the backward - shift algorithm of the case without precedence constraints 摘要把工件之间不带前后约束的延误排序的后移算法移植到带有前后约束的情况,提出一个多项式时间的近似算法。
Simulation results show that under that under certain precision demand , this improved approximate algorithm decreases the burden of computations greatly and can be used as an alternative of parameter estimation 仿真结果表明,在一定的精确度要求下,这种近似算法极大地降低了参数估计的计算量,可以作为参数估计方法的一种很好的选择。
Aiming at the problem that the rotational response is difficult to measure in structural identification , an improved approximate algorithm based on generalized inverse matrix theory is developed for rotational response reconstruction 摘要针对结构识别中转角信息难以测量的问题,完善了一种基于广义逆理论的转角信息重构问题近似算法。
We prove that the worst - case ratio of algorithm d is 15 / 13 , which is better than any other approximation algorithm except polynomial time approximation scheme considering with both worst - case ratio and time complexity 我们证明了对三台机情形,算法d的最坏情况界为15 13 ,该算法的最坏情况界和时间复杂性优于除近似方案以外的已有近似算法。
The corresponding image formation algorithms , both in tune domain and frequency domain , are introduced . beginning with the projection reconstruction theory , convolution - backprojection and its approximated algorithm , backprojection algorithm are given 根据这一投影重建理论,导出了impsar目标投影重建的卷积-反投影算法及其近似算法-反向投影算法。