Comparative Benchmarking Of Constraints T-Way Test Generation Strategy Based On Late Acceptance Hill Climbing Algorithm
This paper describes the new t-way strategy based the Late Acceptance based Hill Climbing algorithm, called LAHC, for constraints t-way test generation. Unlike earlier competing work, LAHC does not require significant tuning in order to have it working. In fact, LAHC merely requires minor adjustmen...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Penerbit UMP
2015
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/9145/1/Comparative%20Benchmarking%20Of%20Constraints%20T-Way%20Test%20Generation%20Strategy%20Based%20On%20Late%20Acceptance%20Hill%20Climbing%20Algorithm.pdf http://umpir.ump.edu.my/id/eprint/9145/ http://ijsecs.ump.edu.my/images/archive/vol1/02kamal_IJSECS.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This paper describes the new t-way strategy based the Late Acceptance based Hill Climbing algorithm, called LAHC, for constraints t-way test generation. Unlike earlier competing
work, LAHC does not require significant tuning in order to have it working. In fact, LAHC merely requires minor adjustment of the common controlling parameters involving iteration and population size depending on the given system configuration. Our benchmarking results have been promising as LAHC gives competitive results in most constraints configurations considered. |
|---|