Show simple item record

dc.contributor.advisorShubert, B.O.
dc.contributor.authorAnderson, Calvin Marion
dc.date.accessioned2012-11-13T23:52:58Z
dc.date.available2012-11-13T23:52:58Z
dc.date.issued1973-09
dc.identifier.urihttp://hdl.handle.net/10945/16844
dc.description.abstractA class of finite-memory deterministic algorithms is introduced and investigated, Optimiim algorithms are found for a small number of states (up to 21) and an asymptotic bound on error probability is obtained for a large number of states. The algorithms provide their own stopping rule.en_US
dc.description.urihttp://archive.org/details/testingsimplesym00ande
dc.language.isoen_US
dc.publisherMonterey, California. Naval Postgraduate Schoolen_US
dc.titleTesting a simple symmetric hypothesis by a finite-memory deterministic algorithmen_US
dc.typeThesisen_US
dc.contributor.secondreaderWang, Peter
dc.contributor.corporateNaval Postgraduate School
dc.contributor.schoolNaval Postgraduate School
dc.contributor.departmentOperations Research
dc.description.serviceMajor, United States Armyen_US
etd.thesisdegree.nameM.S. in Operations Researchen_US
etd.thesisdegree.levelMastersen_US
etd.thesisdegree.disciplineOperations Researchen_US
etd.thesisdegree.grantorNaval Postgraduate Schoolen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record