Fortæl dine venner om denne vare:
Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition - Lecture Notes in Computer Science Malte Helmert 2008 edition
Pris
DKK 449
Bestilles fra fjernlager
Forventes klar til forsendelse 8. - 14. jan. 2026
Julegaver kan byttes frem til 31. januar
Tilføj til din iMusic ønskeseddel
eller
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
| Medie | Bøger Paperback Bog (Bog med blødt omslag og limet ryg) |
| Udgivet | 24. januar 2008 |
| ISBN13 | 9783540777229 |
| Forlag | Springer-Verlag Berlin and Heidelberg Gm |
| Antal sider | 270 |
| Mål | 155 × 235 × 18 mm · 430 g |
| Sprog | Engelsk |
Se alt med Malte Helmert ( f.eks. Paperback Bog )