A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search (Q958076)
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: A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search |
scientific article; zbMATH DE number 5376950
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search |
scientific article; zbMATH DE number 5376950 |
Statements
A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search (English)
0 references
2 December 2008
0 references
search theory
0 references
heuristics
0 references
Markov processes
0 references
network flows
0 references
0 references
0 references
0 references
0 references
0.8828546
0 references
0.8757975
0 references
0.8632292
0 references
0.8626171
0 references
0 references
0.85973674
0 references
0.8574806
0 references
