Show simple item record

dc.contributor.authorWashburn, Alan R.
dc.date1978-10
dc.date.accessioned2013-08-14T17:27:38Z
dc.date.available2013-08-14T17:27:38Z
dc.date.issued1978-10
dc.identifier.urihttp://hdl.handle.net/10945/35244
dc.description.abstractExisting algorithms for computing the optimal distribution of effort in search for a moving target operate by producing a sequence of progressively better distributions. This report shows how to compute an upper bound on the detection proability for each of those effort distributions in the case where the detection function is concave.en_US
dc.language.isoen_US
dc.publisherMonterey, California: Naval Postgraduate School.en_US
dc.subjectSearchen_US
dc.subjectMovingen_US
dc.subjectTargeten_US
dc.titleSearch for a Moving Target: Upper Bound on Detection Probabilityen_US
dc.typeTechnical Reporten_US
dc.contributor.secondreaderSovereign, Michael G.
dc.contributor.departmentOperations Researchen_US
dc.identifier.npsreportNPS55-78-029
dc.description.distributionstatementApproved for public release; distribution is unlimited.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record