Complexity Analysis of Real-time Reinforcement Learning Applied to Finding Shortest Paths in Deterministic Domains
| Author | : Carnegie-Mellon University. Computer Science Department |
| Publisher | : |
| Total Pages | : 99 |
| Release | : 1992 |
| ISBN-10 | : OCLC:123335728 |
| ISBN-13 | : |
| Rating | : 4/5 (28 Downloads) |
Book Synopsis Complexity Analysis of Real-time Reinforcement Learning Applied to Finding Shortest Paths in Deterministic Domains by : Carnegie-Mellon University. Computer Science Department
Download or read book Complexity Analysis of Real-time Reinforcement Learning Applied to Finding Shortest Paths in Deterministic Domains written by Carnegie-Mellon University. Computer Science Department and published by . This book was released on 1992 with total page 99 pages. Available in PDF, EPUB and Kindle. Book excerpt: The worst-case analysis of the reinforcement learning algorithms is complemented by an empirical study of their average-case complexity in three domains."