Technical note: Trading off quick versus slow actions in optimal search (Q3453336)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6512711
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Technical note: Trading off quick versus slow actions in optimal search |
scientific article; zbMATH DE number 6512711 |
Statements
Technical Note—Trading Off Quick versus Slow Actions in Optimal Search (English)
0 references
20 November 2015
0 references
optimal search
0 references
Markov decision process
0 references
approximate dynamic programming
0 references
branch-and-bound
0 references
0 references
0.8209415078163147
0 references
0.8167847394943237
0 references
0.8166986703872681
0 references
0.8079977035522461
0 references
