在此基础上，以整数规划算法为数学工具给出了时间算法复杂度为多项式的最优基本信标的计算方法。
Furthermore, the integer programming method is exploited as the mathematical tool for the generation of a polynomial algorithm producing the optimal set elementary siphons.
实验结果表明该联合算法得到的优化结果劣于整数线性规划算法，但是优于表调度算法。
The result shows that the combining algorithm can arrive at worse code than ILP but better than list scheduling.
实验结果表明该联合算法得到的优化结果劣于整数线性规划算法，但是优于表调度算法。
The result shows that the combining algorithm can arrive at worse code than ILP but better than list scheduling.
应用推荐