The PAC-learnability of planning algorithms: Investigating simple planning domains (Q1818761): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A theory of the learnable / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4013527 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Occam's razor / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4004178 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0020-0255(98)10095-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1991176166 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:48, 30 July 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
