پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 162 |
| تعداد شماره‌ها | 6,691 |
| تعداد مقالات | 72,219 |
| تعداد مشاهده مقاله | 129,110,972 |
| تعداد دریافت فایل اصل مقاله | 101,915,123 |
Profiles of covering arrays of strength two | ||
| Journal of Algorithms and Computation | ||
| مقاله 4، دوره 44، شماره 1، اسفند 2013، صفحه 31-59 اصل مقاله (798.41 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22059/jac.2013.7914 | ||
| نویسندگان | ||
| Charles Colbourn* 1؛ Jose Torres-Jimenez2 | ||
| 1Arizona State University, P.O. Box 878809, , Tempe, AZ 85287-8809, U.S.A. and State Key Laboratory of Software Development Environment,, Beihang University, Beijing 100191, China. | ||
| 2CINVESTAV-Tamaulipas, Information Technology Laboratory,, Km. 6 Carretera Victoria-Monterrey, 87276 Victoria Tamps., Mexico | ||
| چکیده | ||
| Covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. While numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. Random generation techniques can overcome these computational difficulties, but for strength two do not appear to yield a number of tests that is competitive with the fewest known. | ||
| کلیدواژه‌ها | ||
| covering array؛ interaction testing؛ direct product؛ simulated annealing | ||
|
آمار تعداد مشاهده مقاله: 2,144 تعداد دریافت فایل اصل مقاله: 1,648 |
||
سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب