Time-bounded best-first search for reversible and non-reversible search graphs (Q2818234)
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: Time-bounded best-first search for reversible and non-reversible search graphs |
scientific article; zbMATH DE number 6624545
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Time-bounded best-first search for reversible and non-reversible search graphs |
scientific article; zbMATH DE number 6624545 |
Statements
7 September 2016
0 references
Time-bounded best-first search for reversible and non-reversible search graphs (English)
0 references
