The PAC-learnability of planning algorithms: Investigating simple planning domains (Q1818761)
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: The PAC-learnability of planning algorithms: Investigating simple planning domains |
scientific article; zbMATH DE number 1384382
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The PAC-learnability of planning algorithms: Investigating simple planning domains |
scientific article; zbMATH DE number 1384382 |
Statements
The PAC-learnability of planning algorithms: Investigating simple planning domains (English)
0 references
30 October 2000
0 references
speedup learning
0 references
search algorithms
0 references
