6 search results - page 1 / 2 » A New Backtracking Algorithm for Constructing Binary Coverin... |
MICAI
2009
Springer
14 years 3 months ago
2009
Springer
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
— This paper presents new upper bounds for binary covering arrays of variable strength constructed by using a new Simulated Annealing (SA) algorithm. This algorithm incorporates ...
AE
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. This paper presents a new Memetic Algorithm (MA) designed to compute near-optimal solutions for the covering array construction problem. It incorporates several distingui...
ICSE
2003
IEEE-ACM
14 years 8 months ago
2003
IEEE-ACM
Software system faults are often caused by unexpected interactions among components. Yet the size of a test suite required to test all possible combinations of interactions can be...
ISSRE
2003
IEEE
14 years 1 months ago
2003
IEEE
Component based software development is prone to unexpected interaction faults. The goal is to test as many potential interactions as is feasible within time and budget constraint...