期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Bounded space algorithms for variant of variable-sized bin packing
1
作者 李波 《Journal of Chongqing University》 CAS 2005年第3期164-169,共6页
Given a list of items and a sequence of variable-sized bins arriving one by one, it is NP-hard to pack the items into the bin list with a goal to minimize the total size of bins from the earliest one to the last used.... Given a list of items and a sequence of variable-sized bins arriving one by one, it is NP-hard to pack the items into the bin list with a goal to minimize the total size of bins from the earliest one to the last used. In this paper a set of approximation algorithms is presented for cases in which the ability to preview at most k(〉=2) arriving bins is given. With the essential assumption that all bin sizes are not less than the largest item size, analytical results show the asymptotic worst case ratios of all k-bounded space and offiine algorithms are 2. Based on experiments by applying algorithms to instances in which item sizes and bin sizes are drawn independently from the continuous uniform distribution respectively in the interval [0,u] and [u,l ], averagecase experimental results show that, with fixed k, algorithms with the Best Fit packing(closing) rule are statistically better than those with the First Fit packing(closing) rule. 展开更多
关键词 variable-sized bin packing bounded space algorithms offiine algorithms worst case performance average case performance
下载PDF
THE FIRST CASE OF DYNAMIC CARDIOMYOPLASTY IN CHINA WAS SUCCESSFULLY PERFORMED
2
《Chinese Medical Journal》 SCIE CAS CSCD 1994年第12期24-24,共1页
Professor Wang Tian-you.Director of Department of Thoracic Cardiovascular Surgery of Beijng Fricndship Hospital,
关键词 WAS THE FIRST CASE OF DYNAMIC CARDIOMYOPLASTY IN CHINA WAS SUCCESSFULLY PERFORMED WANG
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部