<?xml version="1.0" encoding="UTF-8"?>
<oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:title>Maximum One-Factor-at-a-Time Designs</dc:title>
  <dc:title>R package MOFAT version 1.0</dc:title>
  <dc:description>Identifying important factors from a large number of potentially important factors of a highly nonlinear and computationally expensive black box model is a difficult problem. Xiao, Joseph, and Ray (2022) &lt;doi:10.1080/00401706.2022.2141897&gt; proposed Maximum One-Factor-at-a-Time (MOFAT) designs for doing this. A MOFAT design can be viewed as an improvement to the random one-factor-at-a-time (OFAT) design proposed by Morris (1991) &lt;doi:10.1080/00401706.1991.10484804&gt;. The improvement is achieved by exploiting the connection between Morris screening designs and Monte Carlo-based Sobol' designs, and optimizing the design using a space-filling criterion. This work is supported by a U.S. National Science Foundation (NSF) grant CMMI-1921646 &lt;https://www.nsf.gov/awardsearch/showAward?AWD_ID=1921646&gt;.</dc:description>
  <dc:type>Software</dc:type>
  <dc:relation>Imports: SLHD, stats</dc:relation>
  <dc:creator>V. Roshan Joseph &lt;roshan@gatech.edu&gt;</dc:creator>
  <dc:publisher>Comprehensive R Archive Network (CRAN)</dc:publisher>
  <dc:contributor>Qian Xiao [aut],
  V. Roshan Joseph [aut, cre]</dc:contributor>
  <dc:rights>GPL (&gt;= 2)</dc:rights>
  <dc:date>2022-10-29</dc:date>
  <dc:format>application/tgz</dc:format>
  <dc:identifier>https://CRAN.R-project.org/package=MOFAT</dc:identifier>
  <dc:identifier>doi:10.32614/CRAN.package.MOFAT</dc:identifier>
</oai_dc:dc>
