Vertel uw vrienden over dit artikel:
Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition - Lecture Notes in Computer Science Malte Helmert 2008 edition
Besteld in een afgelegen magazijn
Kerstcadeautjes kunnen tot en met 31 januari worden ingewisseld
Onze klanten zeggen:
Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition - Lecture Notes in Computer Science
Malte Helmert
This monograph is a revised version of Malte Helmert's doctoral thesis, Solving Planning Tasks in Theory and Practice, written under the supervision of Professor Bernhard Nebel at Albert-Ludwigs-Universität Freiburg, Germany, in 2006. The book contains an exhaustive analysis of the computational complexity of the benchmark problems that have been used in the past decade. Not only that, but it also provides an in-depth analysis of so-called routing and transportation problems.
270 pages, biography
| Media | Boeken Paperback Book (Boek met zachte kaft en gelijmde rug) |
| Vrijgegeven | 24 januari 2008 |
| ISBN13 | 9783540777229 |
| Uitgevers | Springer-Verlag Berlin and Heidelberg Gm |
| Pagina's | 270 |
| Afmetingen | 155 × 235 × 18 mm · 430 g |
| Taal en grammatica | Engels |
Bekijk alles van Malte Helmert ( bijv. Paperback Book )