MinT - Architecture and applications of the (t, m, s)-net and OOA database

Many different constructions for (t, m, s)-nets and (t, s)-sequences are known today. Propagation rules as well as connections to other mathematical objects make it difficult to determine the best net available in a given setting. The MinT database developed by the authors is one of the most elaborate solutions to this problem. In this article we discuss some aspects of the theory that makes MinT work. We also provide a synopsis of the strongest bounds and existence results known today as determined by MinT. Key words: MinT, (t, m, s)-net, ordered orthogonal array (OOA), database, quasi-Monte Carlo

• Type: Journal
• Year: 2010
• Where: MCS
• Authors: Rudolf Schürer, Wolfgang Ch. Schmid
• Keywords: Many Different Constructions, MCS 2010, MiNT, MinT Work, Pattern Recognition