Research Article

A Simulated Annealing Algorithm to Construct Covering Perfect Hash Families

Table 5

New upper bounds obtained from CPHFs. 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

1396 4
1708 8
1840 3
2812 1
6640 2
7660 2
8932 4
9700 4
10720 3
11992 7
12508 7
14332 1
19444 2
27628 2
30700 2
34792 3
37864 3
42976 2
2245 1
2865 1
3365 1
20605 4
23105 3
87485 2
103105 2
112485 1