A Method for Obtaining Suboptimal Group-Testing Policies Using Dynamic Programming and Information Theory

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A Method for Obtaining Suboptimal Group-Testing Policies Using Dynamic Programming and Information Theory

Full text

Pdf (408 KB)

Source

Journal of the ACM (JACM) archive
Volume 10 , Issue 1 (January 1963) table of contents

Pages: 89 - 96

Year of Publication: 1963

ISSN:0004-5411

Author

Brian Gluss

University of California, Berkeley

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 14, Citation Count: 0

Additional Information:

references index terms

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/321150.321156 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Richard Ernest Bellman, Dynamic Programming, Dover Publications, Incorporated, 2003
	2	----, Adaptive Control Processes; A Guided Tour. Princeton University Press, 1961.
	3	SOBEL, M. AND GROLL, P.A. Group testing to eliminate efficiently all defectives in binomial sample. Bell Tech. J. (Sept. t959), 1179-1252.
	4	BELLMAN, R. AND GLrSSS, B. On various versions of the defective coin problem. Informat. Control (Sept. 1961), 118-131.