Optimal search for a moving target with no time information maximizing the expected reward (Q4538142)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal search for a moving target with no time information maximizing the expected reward |
scientific article; zbMATH DE number 1766727
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal search for a moving target with no time information maximizing the expected reward |
scientific article; zbMATH DE number 1766727 |
Statements
11 July 2002
0 references
search-efforts-optimizing problem
0 references
expected reward criterion
0 references
convex programming
0 references
gradient projection method
0 references
multiplier method
0 references
sensitivity analysis
0 references
Optimal search for a moving target with no time information maximizing the expected reward (English)
0 references
0.9272028
0 references
0 references
0.9071777
0 references
0.9024761
0 references
0 references
0.8982096
0 references
