首页> 外文期刊>Journal of Computer Science & Technology >Deep Performance Analysis of Refined Harmonic Bin Packing Algorithm
【24h】

Deep Performance Analysis of Refined Harmonic Bin Packing Algorithm

机译:精简谐波装箱算法的深层性能分析

获取原文
获取原文并翻译 | 示例
           

摘要

Refined Harmonic (RH) is one of the best on-line bin packing algorithms. The algorithm was first proposed by Lee & Lee in 1985 and the upper bound of the worst-case Performance ratio has been proved to be 1.63596…. In this paper, it is proved that 1.63596… Is also the lower bound. The average performance of RH is also studied for the first time. It is shown that the average-case performance ratio of RH id 1.28243…under the uniform Distribution.
机译:精谐(RH)是最好的在线装箱算法。该算法由Lee&Lee于1985年首次提出,最坏情况下的性能比率的上限已证明为1.63596…。本文证明1.63596…也是下界。还首次研究了RH的平均性能。结果表明,在均匀分布条件下,RH id的平均性能比为1.28243…。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号