In a fraction of the run time required by DETMAX, the sequential algorithm finds a design with a relative D-efficiency of 46.4009 / 46.4922 = 99.8% compared to the best design found by the DETMAX ...

Search Methods The search procedures available in the OPTEX procedure offer various compromises between speed and reliability in finding the optimum. In general, the longer an algorithm takes to ...

Original Article Published: 01 May 2013 A sequential coalescent algorithm for chromosomal inversions S Peischl, E Koch, R F Guerrero & M Kirkpatrick Heredity 111, 200–209 (2013) Cite this article ...

This article presents a sequential Monte Carlo (SMC) algorithm that can be used for any one-at-a-time Bayesian sequential design problem in the presence of model uncertainty where discrete data are ...