{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:56:24Z","timestamp":1750308984802,"version":"3.41.0"},"reference-count":0,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[1983,4,1]],"date-time":"1983-04-01T00:00:00Z","timestamp":418003200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[1983,4]]},"abstract":"<jats:p>The paper describes a completed and independent module of a large-scale system, the Quasi-Optimizer (&lt;u&gt;QO&lt;\/u&gt;). The &lt;u&gt;QO&lt;\/u&gt; system has three major objectives: (i) to observe and measure adversaries' behavior in a competitive environment, to infer their strategies and to construct a computer model, a &lt;u&gt;descriptive theory&lt;\/u&gt;, of each; (ii) to identify strategy components, evaluate their effectiveness and to select the most satisfactory ones from a set of computed descriptive theories; (iv) to combine these components in a quasi-optimum strategy that represents a &lt;u&gt;normative theory&lt;\/u&gt; in the statistical sense.The measurements on the input strategies can take place either in a sequence of confrontations unperturbed by the &lt;u&gt;QO&lt;\/u&gt;, or, for efficiency's sake, in a series of environments specified according to some experimental design. The module completed first, &lt;u&gt;QO-I&lt;\/u&gt;, can perform the experiments either in an exhaustive manner---when every level of a decision variable is combined with every level of the other decision variables---or, in relying on the assumption of a monotonically changing response surface, it uses the binary chopping technique.The module discussed here, &lt;u&gt;QO-3&lt;\/u&gt;, does not assume monotonic response surfaces and can deal also with multidimensional responses. It starts with a (loosely) balanced incomplete block design for the experiments and computes dynamically the specifications for each subsequent experiment. Accordingly, the levels of the decision variables in any single experiment and the length of the whole sequence of experiments depend on the responses obtained in previous experiments. In general, &lt;u&gt;QO-3&lt;\/u&gt; is an on-line, dynamic generator of experimental design that minimizes the total number of experiments performed for a predetermined level of precision.<\/jats:p>","DOI":"10.1145\/1008923.1008930","type":"journal-article","created":{"date-parts":[[2004,10,12]],"date-time":"2004-10-12T15:20:46Z","timestamp":1097594446000},"page":"77-77","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["An artificial intelligence technique to generate self-optimizing experimental designs"],"prefix":"10.1145","volume":"15","author":[{"given":"Nicholas V.","family":"Findler","sequence":"first","affiliation":[{"name":"Arizona State University, Tempe, Arizona"}]},{"given":"Robert F.","family":"Cromp","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, Arizona"}]}],"member":"320","published-online":{"date-parts":[[1983,4]]},"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1008923.1008930","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1008923.1008930","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:41:08Z","timestamp":1750282868000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1008923.1008930"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,4]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,4]]}},"alternative-id":["10.1145\/1008923.1008930"],"URL":"https:\/\/doi.org\/10.1145\/1008923.1008930","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[1983,4]]},"assertion":[{"value":"1983-04-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}