The on-line shortest path problem under partial monitoring (Q3174159)
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 5957497
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The on-line shortest path problem under partial monitoring |
scientific article; zbMATH DE number 5957497 |
Statements
12 October 2011
0 references
on-line learning
0 references
shortest path problem
0 references
multi-armed bandit problem
0 references
0.9854378700256348
0 references
0.8319105505943298
0 references
0.7867401242256165
0 references
0.765199601650238
0 references
0.7532661557197571
0 references
