Constructions of uniform designs by using resolvable packings and coverings |
| |
| Affiliation: | 1. Department of Mathematics, Hong Kong Baptist University, Kowloon Tong, Hong Kong, People''s Republic of China;2. Department of Mathematical Science, Tsinghua University, Beijing 100084, People''s Republic of China;3. Department of Mathematics, Suzhou University, Suzhou 215006, People''s Republic of China |
| |
| Abstract: | ![]()
Uniform designs have been widely used in computer experiments, as well as in industrial experiments when the underlying model is unknown. Based on the discrete discrepancy, the link between uniform designs, and resolvable packings and coverings in combinatorial theory is developed. Through resolvable packings and coverings without identical parallel classes, many infinite classes of new uniform designs are then produced. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
