A program for sequential allocation of three Bernoulli populations
DOI10.1016/S0167-9473(99)00039-0zbMath0942.62086OpenAlexW2130884607WikidataQ127662893 ScholiaQ127662893MaRDI QIDQ1978413
R. Oehmke, Quentin F. Stout, Janis P. Hardwick
Publication date: 4 June 2000
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-9473(99)00039-0
design of experimentsdynamic programmingparallel computingclinical trialsload balancingsequential samplinghigh-performance computingrecursive equationsadaptive allocationmulti-arm bandit
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A high-performance, portable implementation of the MPI message passing interface standard
- Optimal Bayes procedures for selecting the better of two Bernoulli populations
- Selecting the best binomial population: Parametric empirical Bayes approach
- An O'Brien-Fleming sequential trial for comparing three treatments
- A program for sequential allocation of three Bernoulli populations
- A sequential clinical trial for comparing three treatments
- Sequential allocation in clinical trials
- The Search for Optimality in Clinical Trials
- Sequential procedures for comparing several medical treatments
- Sequential Analysis of Censored Survival Data From Three Treatment Groups
- Using Path Induction to Evaluate Sequential Allocation Procedures
This page was built for publication: A program for sequential allocation of three Bernoulli populations