Faites connaître cet article à vos amis:
Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition - Lecture Notes in Computer Science Malte Helmert 2008 edition
Commandé depuis un entrepôt distant
Les cadeaux de Noël peuvent être échangés jusqu'au 31 janvier
Nos clients disent :
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
| Médias | Livres Paperback Book (Livre avec couverture souple et dos collé) |
| Validé | 24 janvier 2008 |
| ISBN13 | 9783540777229 |
| Éditeurs | Springer-Verlag Berlin and Heidelberg Gm |
| Pages | 270 |
| Dimensions | 155 × 235 × 18 mm · 430 g |
| Langue et grammaire | Anglais |
Voir tous les Malte Helmert ( par ex. Paperback Book )