Quickest online selection of an increasing subsequence of specified size (Q2820269)
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: Quickest online selection of an increasing subsequence of specified size |
scientific article; zbMATH DE number 6627523
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Quickest online selection of an increasing subsequence of specified size |
scientific article; zbMATH DE number 6627523 |
Statements
Quickest online selection of an increasing subsequence of specified size (English)
0 references
15 September 2016
0 references
increasing subsequence problem
0 references
online selection
0 references
sequential selection
0 references
stopping times
0 references
time-focused decision problem
0 references
Markov decision problem
0 references
dynamic programming
0 references
0 references
0 references
0 references
0 references
