Research Article

A Simulated Annealing Algorithm to Construct Covering Perfect Hash Families

Table 4

New upper bounds of obtained from SCPHFs. The of the first column generates the of the second column. The third column shows the number of rows of the previous best-known covering array, and the fourth column contains the number of upper bounds of improved by the covering array constructed.

Previous New UBs

2671
4851
10831
12762
21811
26671
36531
2461
5113
13963
15881
40931
58722
66401
74081
86802
94484
112601
184241
204761
266081
307001
337721
378641
419561
3732
4974
6218
24971
87451
112451
143651
168652
206052
437451
843651
1031051
10272