Recomienda este artículo a tus amigos:
Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition - Lecture Notes in Computer Science Malte Helmert 2008 edition
Pedido desde almacén remoto
Los regalos de Navidad se podrán canjear hasta el 31 de enero
Nuestros clientes opinan:
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
| Medios de comunicación | Libros Paperback Book (Libro con tapa blanda y lomo encolado) |
| Publicado | 24 de enero de 2008 |
| ISBN13 | 9783540777229 |
| Editores | Springer-Verlag Berlin and Heidelberg Gm |
| Páginas | 270 |
| Dimensiones | 155 × 235 × 18 mm · 430 g |
| Lengua | Inglés |
Ver todo de Malte Helmert ( Ej. Paperback Book )