Testing a simple symmetric hypothesis by a finite-memory deterministic algorithm
Anderson, Calvin Marion
MetadataShow full item record
A 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.
Showing items related by title, author, creator and subject.
Taylor, James G.; Neta, Beny (Monterey, California. Naval Postgraduate School, 2001-09); NPS-MA-01-001The goal of this study effort was to assess the ability of the Joint Conflict and Tactical Simulation (JCATS) to simulate the capabilities of non- lethal weapons (NLW) and to provide a product that can be incorporated into ...
Tappe, J.; Kim, J.J.; Jordan,A.; Agrawal, B.N. (2011);This paper presents a study of star tracker attitude estimation algorithms and implementation on an indoor ground-based Three Axis Spacecraft Simulator (TASS). Angle, Planar Triangle, and Spherical Triangle algorithms are ...
De Kooter, Peter M. (Monterey, California. Naval Postgraduate School, 1997-03);As part of the existing acoustic transient localization program, a feasibility study was performed to apply existing algorithms to signals at higher carrier frequencies. The coherent matching, autocorrelation matching and ...