A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems (Q4364997)
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 1081933
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems |
scientific article; zbMATH DE number 1081933 |
Statements
A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems (English)
0 references
1 February 1998
0 references
stochastic shortest path problem
0 references
pruning
0 references
label setting
0 references
0.8249008655548096
0 references
0.756786048412323
0 references
0.7549571990966797
0 references
0.7545084953308105
0 references
0.7524842023849487
0 references
