极小极大
甲骨文公司
汉明距离
一般化
汉明码
构造(python库)
班级(哲学)
计算机科学
数学
理论计算机科学
算法
数学优化
离散数学
距离测量
汉明图
计算机实验
汉明重量
组合数学
电子邮件
标识
DOI:10.1093/jrsssb/qkag075
摘要
Abstract The maximin distance is an attractive criterion for constructing space-filling designs. As factors in computer experiments are generally quantitative, the Lp-distance is appropriate. Theoretical construction of maximin Lp-distance designs, however, is extremely challenging. Given that directly attacking the problem is difficult, we propose an indirect approach that first constructs maximin Hamming distance designs and then constructs maximin Lp-distance designs using the former. The approach turns out to be very fruitful. We introduce oracle arrays, which are a special class of maximin Hamming distance arrays that also allow other maximin Hamming distance arrays to be easily constructed. We then examine how to use oracle arrays to construct maximin Lp-distance designs. Although the approach is motivated by the desire of constructing maximin Lp-distance designs, it can also be thought of as a generalization of the idea of orthogonal array based designs.
科研通智能强力驱动
Strongly Powered by AbleSci AI