The PAC-learnability of planning algorithms: Investigating simple planning domains (Q1818761): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:40, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The PAC-learnability of planning algorithms: Investigating simple planning domains |
scientific article |
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
