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 prohibitive in evenâ€¦ (More)

Complete interaction testing of components is too costly in all but the smallest systems. Yet component interactions are likely to cause unexpected faults. Recently, design of experiment techniquesâ€¦ (More)

We describe various computing techniques for tackling chessboard domination problems and apply these to the determination of domination and irredundance numbers for queens' and kings' graphs. Inâ€¦ (More)

A simulated annealing algorithm is used in the construction of subsquare free Latin squares. The algorithm is described and experience from its application is reported. Results obtained include theâ€¦ (More)

Computing techniques are described which have resulted in the establishment of new results for the queens domination problem. In particular it is shown that the minimum cardinalities of independentâ€¦ (More)

The queensâ€™ graph Qn has the squares of the n Ã— n chessboard as its vertices, with two squares adjacent if they are in the same row, column, or diagonal. An irredundant set of queens has the propertyâ€¦ (More)

"We investigate of the all-ones matrix .]V for 1) 16 over va,rious admissible groups. For 1) 16 all have been PIlumera,ted. For the case 7) 16 only some classes have been completely enumerated. Ofâ€¦ (More)