Unobstructed Shortest Paths in Polyhedral Environments - Lecture Notes in Computer Science - Varol Akman - Knjige - Springer-Verlag Berlin and Heidelberg Gm - 9783540176299 - 11. marca 1987
Če se naslovnica in naslov ne ujemata, je naslov pravilen

Varol Akman
Unobstructed Shortest Paths in Polyhedral Environments - Lecture Notes in Computer Science 1987 edition

Cena
€ 59,99

Naročeno iz oddaljenega skladišča

Predvidena dobava 28. avg - 11. sep
Prejemajte obvestila o novih izdajah izvajalca Varol Akman

Kaj pravijo naše stranke:

14-dnevna politika vračila v skladu z evropsko zakonodajo o varstvu potrošnikov
Najvišja ocena na Trustpilot
Dodaj na svoj seznam želja iMusic

Not rated yet

Presents algebraic and geometric algorithms to deal with a specific problem, which frequently occurs in model-based robotics systems and is of utmost importance in calibrating the complexity of robotics tasks in general. The algorithms are based on several ideas from areas such as elimination theory, optimization, polyhedral theory and Voronoi diagrams. The algorithms were also implemented in a Lisp in a workbench to allow experimentation with shortest path problems.

106 pages, biography

Medij Knjige     Paperback Book   (Knjiga z mehkimi platnicami in lepljenim hrbtom)
Izdano 11. marca 1987
ISBN13 9783540176299
Založniki Springer-Verlag Berlin and Heidelberg Gm
Strani 106
Dimenzije 156 × 234 × 6 mm   ·   172 g
Jezik Angleščina  

Več od istega **izdajatelja**

Ogled vseh Varol Akman ( Na primer Paperback Book in Hardcover Book )