Find the Best Greedy Algorithm with Base Choice Experiments for Covering Array Generation
A number of greedy algorithms have been conducted for covering array construction, and most of them can be integrated into a framework, and more approaches can be derived from the framework. However, such a framework is affected by many factors, which makes its deployment and optimization very challenging. In order to identify the best configuration, we design Base Choice experiments based on six decisions of the framework to study systematically, providing theoretical and practical guideline for the design and optimization of the greedy algorithms.
Jing Jiang Changhai Nie
The State Key Laboratory for Novel Software Technique, Nanjing University, Nanjing, China
国际会议
13th International Conference on Enterprise Information System(第13届企业信息系统国际会议 ICEIS 2011)
北京
英文
1623-1630
2011-06-08（万方平台首次上网日期，不代表论文的发表时间）