Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition - Lecture Notes in Computer Science - Malte Helmert - Grāmatas - Springer-Verlag Berlin and Heidelberg Gm - 9783540777229 - 2008. gada 24. janvāris
Ja vāks un nosaukums nesakrīt, pareizs ir nosaukums

Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition - Lecture Notes in Computer Science 2008 edition

Cena
€ 53,99

Pasūtīts no attālās noliktavas

Paredzamā piegāde . gada 20. - 28. jūl.
Pievienot savam iMusic vēlmju sarakstam

Not rated yet

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

Mediji Grāmatas     Paperback Book   (Grāmata ar mīksto vāku un līmēto muguru)
Izlaists 2008. gada 24. janvāris
ISBN13 9783540777229
Izdevēji Springer-Verlag Berlin and Heidelberg Gm
Lapas 270
Izmēri 155 × 235 × 18 mm   ·   430 g
Valoda Angļu  

Mere med samme udgiver

Skatīt visus Malte Helmert ( piem., Paperback Book )