期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Discussion on Cost Control of Sales Service
1
作者 songchen 《外文科技期刊数据库(文摘版)经济管理》 2020年第1期043-044,共3页
The development of social economy and the adjustment of enterprises themselves have forced enterprises to keep pace with the times in cost management. Facing the opportunities and challenges, enterprises should establ... The development of social economy and the adjustment of enterprises themselves have forced enterprises to keep pace with the times in cost management. Facing the opportunities and challenges, enterprises should establish the correct concept of cost control, formulate effective cost control management system, and implement scientifically and effectively. Only by doing a good job of cost control can an enterprise be in an invincible position in the market competition and ensure its sustainable development. 展开更多
关键词 SALES after-sales service cost control
原文传递
Fast Evaluation of Bounded Slice-Line Grid
2
作者 songchen Xian-LongHong +3 位作者 She-QinDong Yu-ChunMa Chung-KuanCheng JunGu 《Journal of Computer Science & Technology》 SCIE EI CSCD 2004年第6期973-980,共8页
Bounded Slice-line Grid (BSG) is an elegant representation of block placement, because it is very intuitionistic and has the advantage of handling various placement constraints. However, BSG has attracted little atten... Bounded Slice-line Grid (BSG) is an elegant representation of block placement, because it is very intuitionistic and has the advantage of handling various placement constraints. However, BSG has attracted little attention because its evaluation is very time-consuming. This paper proposes a simple algorithm independent of the BSG size to evaluate the BSG representation in O(n log log n) time, where n is the number of blocks. In the algorithm, the BSG-rooms are assigned with integral coordinates firstly, and then a linear sorting algorithm is applied on the BSG-rooms where blocks are assigned to compute two block sequences, from which the block placement can be obtained in O(n log log n) time. As a consequence, the evaluation of the BSG is completed in O(n log log n) time, where n is the number of blocks. The proposed algorithm is much faster than the previous graph-based O(n(2)) algorithm. The experimental results demonstrate the efficiency of the algorithm. 展开更多
关键词 BSG FLOORPLAN PLACEMENT VLSI
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部