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.
|