Algorithms for Mobile Agents with Limited Capabilities - Couverture souple

Schmidt, Christiane

9783869558295: Algorithms for Mobile Agents with Limited Capabilities

Couverture souple

ISBN 10 : 3869558296 ISBN 13 : 9783869558295

Editeur : Cuvillier Verlag, 2011

Afficher les exemplaires de cette �dition comportant l'ISBN

0 D'occasion

8 Neuf

De EUR 31,23

D�tails de l'�dition

�diteur: Cuvillier Verlag
Date d'�dition: 2011
Langue: anglais
ISBN 10: 3869558296
ISBN 13: 9783869558295
Reliure: Broch�
Nombre de pages: 158
Coordonn�es du fabricant: info@cuvillier.de
info@cuvillier.de

Nonnenstieg 8
G�ttingen
37075
Allemagne

R�sultats de recherche pour Algorithms for Mobile Agents with Limited Capabilities

Image d'archives

Algorithms for Mobile Agents with Limited Capabilities

Christiane Schmidt

ISBN 10 : 3869558296 ISBN 13 : 9783869558295

Neuf Couverture souple

Vendeur : California Books, Miami, FL, Etats-Unis

�valuation du vendeur 4 sur 5 �toiles

Etat : New. N� de r�f. du vendeur I-9783869558295

Contacter le vendeur

Acheter neuf

EUR 31,23

Livraison gratuite
Exp�dition nationale�: Etats-Unis

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image d'archives

Algorithms for Mobile Agents with Limited Capabilities

Schmidt, Christiane

Edit� par Cuvillier, 2011

ISBN 10 : 3869558296 ISBN 13 : 9783869558295

Neuf PAP

Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis

�valuation du vendeur 5 sur 5 �toiles

PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N� de r�f. du vendeur L2-9783869558295

Contacter le vendeur

Acheter neuf

EUR 32,59

Livraison gratuite
Exp�dition nationale�: Etats-Unis

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image d'archives

Algorithms for Mobile Agents with Limited Capabilities

Schmidt, Christiane

Edit� par Cuvillier, 2011

ISBN 10 : 3869558296 ISBN 13 : 9783869558295

Neuf PAP

Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni

�valuation du vendeur 5 sur 5 �toiles

PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N� de r�f. du vendeur L2-9783869558295

Contacter le vendeur

Acheter neuf

EUR 27,98

Exp�dition �EUR 6,86
Exp�dition depuis Royaume-Uni vers Etats-Unis

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Algorithms for Mobile Agents with Limited Capabilities

Christiane Schmidt

Edit� par Cuvillier Jul 2011, 2011

ISBN 10 : 3869558296 ISBN 13 : 9783869558295

Neuf Taschenbuch

impression � la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This work deals with geometric problems and the use of limited capability agents for these problems. Exploration and guarding problems have been extensively studied in computational geometry. The basic task is to monitor an environment (a polygon) either with a mobile guard or with a number of sta tionary guards (or guards with hard restrictions on the allowed movements). Though all these problems are easy to formulate�and have real-world interpretations that vividly illustrate them�some of these problems (as the classical art gallery problem) are hard to solve. The task of exploring an environment becomes more challenging if the environment is not known in advance, that is, there is no given ground plan and only areas that have already been visibly encountered by the explorer are known. Problems with this kind of uncertainty are called online problems. For �ine problems the ground plan of the environment is known in advance. In this work we study one �ine exploration problem and one exploration and guarding problem in the �ine and online version, where the focus is on the latter. For our problems we do not deal with �almighty� explorers, but face limits on their perceptive capabilities. Other types of geometric problems can exploit this kind of limited agents: We present an exact and fast algorithm for an image analysis task with polyomino-shaped objects on a grid. 158 pp. Englisch. N� de r�f. du vendeur 9783869558295

Contacter le vendeur

Acheter neuf

EUR 25,80

Exp�dition �EUR 23
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 2 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Algorithms for Mobile Agents with Limited Capabilities

Schmidt, Christiane

Edit� par Cuvillier Verlag, 2011

ISBN 10 : 3869558296 ISBN 13 : 9783869558295

Neuf Kartoniert / Broschiert

impression � la demande

Vendeur : moluna, Greven, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Kartoniert / Broschiert. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. KlappentextrnrnThis work deals with geometric problems and the use of limited capability agents for these problems. Exploration and guarding problems have been extensively studied in computational geometry. The basic task is to monitor an enviro. N� de r�f. du vendeur 140365917

Contacter le vendeur

Acheter neuf

EUR 25,80

Exp�dition �EUR 48,99
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Algorithms for Mobile Agents with Limited Capabilities

Christiane Schmidt

Edit� par Cuvillier, Cuvillier Jul 2011, 2011

ISBN 10 : 3869558296 ISBN 13 : 9783869558295

Neuf Taschenbuch

impression � la demande

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -This work deals with geometric problems and the use of limited capability agents for these problems. Exploration and guarding problems have been extensively studied in computational geometry. The basic task is to monitor an environment (a polygon) either with a mobile guard or with a number of sta tionary guards (or guards with hard restrictions on the allowed movements). Though all these problems are easy to formulate-and have real-world interpretations that vividly illustrate them-some of these problems (as the classical art gallery problem) are hard to solve. The task of exploring an environment becomes more challenging if the environment is not known in advance, that is, there is no given ground plan and only areas that have already been visibly encountered by the explorer are known. Problems with this kind of uncertainty are called online problems. For �ine problems the ground plan of the environment is known in advance. In this work we study one �ine exploration problem and one exploration and guarding problem in the �ine and online version, where the focus is on the latter. For our problems we do not deal with 'almighty' explorers, but face limits on their perceptive capabilities. Other types of geometric problems can exploit this kind of limited agents: We present an exact and fast algorithm for an image analysis task with polyomino-shaped objects on a grid.Cuvillier Verlag, Nonnenstieg 8, 37075 G�ttingen 158 pp. Englisch. N� de r�f. du vendeur 9783869558295

Contacter le vendeur

Acheter neuf

EUR 25,80

Exp�dition �EUR 60
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Algorithms for Mobile Agents with Limited Capabilities

Christiane Schmidt

Edit� par Cuvillier

ISBN 10 : 3869558296 ISBN 13 : 9783869558295

Neuf Taschenbuch

impression � la demande

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This work deals with geometric problems and the use of limited capability agents for these problems. Exploration and guarding problems have been extensively studied in computational geometry. The basic task is to monitor an environment (a polygon) either with a mobile guard or with a number of sta tionary guards (or guards with hard restrictions on the allowed movements). Though all these problems are easy to formulate�and have real-world interpretations that vividly illustrate them�some of these problems (as the classical art gallery problem) are hard to solve. The task of exploring an environment becomes more challenging if the environment is not known in advance, that is, there is no given ground plan and only areas that have already been visibly encountered by the explorer are known. Problems with this kind of uncertainty are called online problems. For �ine problems the ground plan of the environment is known in advance. In this work we study one �ine exploration problem and one exploration and guarding problem in the �ine and online version, where the focus is on the latter. For our problems we do not deal with �almighty� explorers, but face limits on their perceptive capabilities. Other types of geometric problems can exploit this kind of limited agents: We present an exact and fast algorithm for an image analysis task with polyomino-shaped objects on a grid. N� de r�f. du vendeur 9783869558295

Contacter le vendeur