Comparative Benchmarking Of Constraints T-Way Test Generation Strategy Based On Late Acceptance Hill Climbing Algorithm

Kamal Z., Zamli and Alsewari, Abdulrahman A. and Al-Kazemi, Basem (2015) Comparative Benchmarking Of Constraints T-Way Test Generation Strategy Based On Late Acceptance Hill Climbing Algorithm. International Journal of Software Engineering & Computer Sciences (IJSECS), 1. pp. 14-26. ISSN 2289-8522. (Published)

PDF Comparative Benchmarking Of Constraints T-Way Test Generation Strategy Based On Late Acceptance Hill Climbing Algorithm.pdf - Published Version Restricted to Repository staff only Download (1MB) | Request a copy

Abstract

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.

Item Type:	Article
Uncontrolled Keywords:	Optimization Algorithms, Software Testing, Artificial Intelligent
Subjects:	Q Science > QA Mathematics > QA76 Computer software
Faculty/Division:	Faculty of Computer System And Software Engineering
Depositing User:	Mrs. Neng Sury Sulaiman
Date Deposited:	13 May 2015 04:02
Last Modified:	15 Jan 2018 07:40
URI:	http://umpir.ump.edu.my/id/eprint/9145
Download Statistic:	View Download Statistics

Actions (login required)

View Item