Parallel programs for adaptive designs

Handbook of Parallel Computing and Statistics

Volumn , Issue , 2005, Pages 347-373

  Stout, Quentin F ^a   Hardwick, Janis ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 65349158022     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (33)

1. Armitage, P. (1985). The search for optimality in clinical trials. Int. Stat. Rev. 53:1-13.
2. Bandyopadhyay, U. and Biwas, A. (1996). Delayed response in randomized play-the-winner rule: a decision theoretic outlook. Calcutta Stat. Assoc. Bull. 46:69-88.
3. Berry, D.A. and Fristedt, B. (1985). Bandit Problems: Sequential Allocation of Experiments. Chapman &Hall, London.
4. Bellman, R. (1956). A problem in the sequential design of experiments. SankhyaA 16:221-229.
5. Bradt, R. and Karlin, S. (1956). On the design and comparison of certain dichotomous experiments. Ann. Math. Stat. 27:390-409.
6. Douke, H. (1994). On sequential design based on Markov chains for selecting one of two treatments in clinical trials with delayed observations. J. Japanese Soc. Comput. Stat. 7:89-103.
7. Eick, S. (1998). The two-armed bandit with delayed responses. Ann. Stat. 16:254-264.
8. Hardwick, J. (1989). Computational problems associated with minimizing the risk in a simple clinical trial. In Contemporary Mathematics: Statistical Multiple Integration, Flournoy, N. and Tsutakawa, R. (Eds) American Mathematics Association, 115:239-257.
9. Hardwick, J. (1995). A modified bandit as an approach to ethical allocation in clinical trials. In Adaptive Designs, Vol. 25, Flournoy, N. and Rosenberger, W., Eds. IMS Lecture Notes - Monograph Series, pp.65-87.
10. Hardwick, J., Oehmke, R., and Stout, Q.F. (1999). A program for sequential allocation of three Bernoulli populations. Comp. Stat. Data Anal. 31:397-416.
11. Hardwick, J., Oehmke, R., and Stout, Q.F. (2001). Optimal adaptive designs for delayed response models: exponential case. In MODA6: Model Oriented Data Analysis, Atkinson, A., and Hackl, P., and Muller, W., Eds. Physica Verlag, Heidelberg, pp. 127-134.
12. Hardwick, J. and Stout, Q.F. (1998). Flexible algorithms for creating and analyzing adaptive sampling procedures. In New Developments and Applications in Experimental Design, Vol. 34 IMS Lecture Notes - Monograph Series, pp. 91-105.
13. Hardwick, J. and Stout, Q.F. (1999). Using path induction to evaluate sequential allocation procedures. SIAMJ. Sci. Comput. 21:67-87.
14. Hardwick, J. and Stout, Q.F. (2001). Optimal few-stage designs. J. Stat. Plan. Inf. 104:121-145.
15. Ibarra, O.H., Wang, W., and Jiang, T. (1993). On efficient parallel algorithms for solving set recurrence equations. J. Algorithms 14:244-257.
16. Ivanova, A. and Rosenberger, W. (2000). A comparison of urn designs for randomized clinical trials of k > 2 treatments. J. Biopharm. Stat. 10:93-107.
17. Kulkarni, R. and Kulkarni, V. (1987). Optimal Bayes procedures for selecting the better of two Bernoulli populations. J. Stat. Plan. Inf. 15:311-330.
18. Lew, A. and Halverson, A., Jr. (1993). Dynamic programming, decision tables, and the Hawaii parallel computer. Comput. Math. Appl. 27:121-127.
19. Lewandowski, G., Condon, A., and Bach, E. (1996). Asynchronous analysis of parallel dynamic programming algorithms. IEEE Trans. Parallel Distrib. Syst. 7:425-438.
20. Lokuta, B. and Tchuente, M. (1988). Dynamic programming on two dimensional systolic arrays. Inf. Proc. Lett. 29:97-104.
21. Test Guideline 425: Acute Oral Toxicity - Up-and-Down Procedure, Organization for Economic Cooperation and Development (OECD), www.epa.gov/oppfead1/harmonization/docs/E425guideline.pdf, 2001.
22. Oehmke, R. (2004). High-Performance Dynamic Array Structures on Parallel Computers. Ph.D. dissertation, University of Michigan, Ann Arbor, MI.
23. Oehmke, R., Hardwick, J., and Stout, Q.F. (1998). Adaptive allocation in the presence of censoring. Comput. Sci. Stat. 30:219-223.
24. Oehmke, R., Hardwick, and J., Stout, Q.F. (2000). Scalable algorithms for adaptive statistical designs. Sci. Program. 8:183-193.
25. Ranka, S. and Sahni, S. (1990). String editing on a SIMD hypercube multicomputer. J. Parallel Distrib. Comput. 9:411-418.
26. Rytter, W. (1988). On efficient parallel computations for some dynamic programming problems. Theoret. Comput. Sci. 59:297-307.
27. Sastry, R. and Ranganathan, N. (1993). A systolic array for approximate string matching. Proceedings IEEE International Conference on Computer Design, pp. 402-405.
28. Simon, R. (1977). Adaptive treatment assignment methods and clinical trials. Biometrics 33:743-744.
29. Strate, S.A., Wainwright, R.L., Deaton, E., George, K.M., Bergel, H., and Hedrick, G. (1993). Load balancing techniques for dynamic programming algorithms on hypercube multicomputers. Applied Computing: States of the Art and Practice, 562-569.
30. Tang, E. (1995). An efficient parallel dynamic programming algorithm. Comput. Math. Appl. 30:65-74.
31. Wang, X. (2000). A bandit process with delayed responses. Stat. Prob. Lett. 48:303-307.
32. Wang, Y.-G. (1991). Sequential allocation in clinical trials. Comm. Stat.: Theory Meth. 20:791-805.
33. Wei, L.J. and Durham, S. (1978). The randomized play the winner rule in medical trials. J. Am. Stat. Assoc. 73:840-843.