Automated Competitive Analysis and Computer-Aided Development Systems for Online Algorithms

在分析在线问题的算法时，需要对大量的案例进行划分，以获得更好的解决方案。在线问题建模时不知道未来的情况。实际上，手工进行这样的案例划分是困难的。在这项研究中，提出了一种在线算法的自动分析技术和计算机辅助开发系统。设计并分析了k帧吞吐量最大化问题和在线分簇问题的在线算法。

For analyzing algorithms for online problems, which model situations without knowledge of the future, a great number of case divisions are needed in order to obtain better solutions. It is practically difficult to perform such case divisions by hand. In this research, an automated analysis technique and computer-aided development systems for online algorithms are proposed. Online algorithms for the k-frame throughput maximization problem and the online clustering problem are designed and analyzed.