Optimized random chemistry
From MaRDI portal
Publication:6239577
arXiv1302.2895MaRDI QIDQ6239577FDOQ6239577
Authors: Jeffrey S. Buzas, Gregory S. Warrington 
Publication date: 12 February 2013
Abstract: The random chemistry algorithm of Kauffman can be used to determine an unknown subset S of a fixed set V. The algorithm proceeds by zeroing in on S through a succession of nested subsets V=V_0,V_1,...,V_m=S. In Kauffman's original algorithm, the size of each V_i is chosen to be half the size of V_{i-1}. In this paper we determine the optimal sequence of sizes so as to minimize the expected run time of the algorithm.
Randomized algorithms (68W20) Combinatorial probability (60C05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to calculus of variations and optimal control (49-01) Combinatorics (05-XX)
This page was built for publication: Optimized random chemistry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6239577)
