Towards Dynamic Randomized Algorithms in Computational Geometry: 758 (Lecture Notes in Computer Science, 758) - Tapa blanda
Sinopsis
Computational geometry concerns itself with designing and analyzing algorithms for solving geometric problems. The field has reached a high level of sophistication, and very complicated algorithms have been designed.However, it is also useful to develop more practical algorithms, so long as they are based on rigorous methods. One such method is the use of randomized algorithms. These algorithms have become more and more popular, turning into one of the hottest areas of recent years. Dynamic algorithms are particularly interesting because in practice the data of a problem are often acquired progressively. In this monograph the author studies the theoretical complexity and practical efficiency of randomized dynamic algorithms.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
Computational geometry concerns itself with designing and analyzing algorithms for solving geometric problems. The field has reached a high level of sophistication, and very complicated algorithms have been designed.However, it is also useful to develop more practical algorithms, so long as they are based on rigorous methods. One such method is the use of randomized algorithms. These algorithms have become more and more popular, turning into one of the hottest areas of recent years. Dynamic algorithms are particularly interesting because in practice the data of a problem are often acquired progressively. In this monograph the author studies the theoretical complexity and practical efficiency of randomized dynamic algorithms.
"Sobre este título" puede pertenecer a otra edición de este libro.
Otras ediciones populares con el mismo título
Resultados de la búsqueda para Towards Dynamic Randomized Algorithms in Computational...
Imagen del vendedor
Towards dynamic randomized algorithms in computational geometry.
Publicado por
Springer, Berlin, 1993
ISBN 10: 3540575030
ISBN 13: 9783540575030
Antiguo o usado
Tapa blanda
Librería: Emile Kerssemakers ILAB, Heerlen, Holanda
Calificación del vendedor: 5 de 5 estrellas
23 cm. original paperback. 158 pp. diagrams. bibliography. index. "Lecture Notes in Computer Science". -(libr labels, otherwise (very) good). 250g. Nº de ref. del artículo: 71736
Comprar usado
EUR 25,00
Envío por EUR 44,00
Se envía de Holanda a Estados Unidos de America
Se envía de Holanda a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen de archivo
Towards Dynamic Randomized Algorithms in Computational Geometry (Lecture Notes in Computer Science, 758)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9783540575030_new
Comprar nuevo
EUR 58,69
Envío por EUR 13,84
Se envía de Reino Unido a Estados Unidos de America
Se envía de Reino Unido a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Towards Dynamic Randomized Algorithms in Computational Geometry (Lecture Notes in Computer Science)
Librería: Chiron Media, Wallingford, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: New. Nº de ref. del artículo: 6666-IUK-9783540575030
Comprar nuevo
EUR 56,85
Envío por EUR 17,90
Se envía de Reino Unido a Estados Unidos de America
Se envía de Reino Unido a Estados Unidos de America
Cantidad disponible: 10 disponibles
Imagen del vendedor
Towards Dynamic Randomized Algorithms in Computational Geometry.
Publicado por
Berlin, Springer Berlin Heidelberg, 1993
ISBN 10: 3540575030
ISBN 13: 9783540575030
Antiguo o usado
Tapa blanda
Librería: Antiquariat Bookfarm, Löbnitz, Alemania
Calificación del vendedor: 5 de 5 estrellas
Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. so7943 3540575030 Sprache: Englisch Gewicht in Gramm: 900. Nº de ref. del artículo: 2347641
Comprar usado
EUR 52,60
Envío por EUR 40,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Towards Dynamic Randomized Algorithms in Computational Geometry
Publicado por
Springer Berlin Heidelberg, 1993
ISBN 10: 3540575030
ISBN 13: 9783540575030
Nuevo
Tapa blanda
Librería: moluna, Greven, Alemania
Calificación del vendedor: 4 de 5 estrellas
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Computational geometry concerns itself with designing andanalyzing algorithms for solving geometric problems. Thefield has reached a high level of sophistication, and verycomplicated algorithms have been designed.However, it isalso useful to dev. Nº de ref. del artículo: 4894346
Comprar nuevo
EUR 48,37
Envío por EUR 48,99
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Towards Dynamic Randomized Algorithms in Computational Geometry
Publicado por
Springer Berlin Heidelberg Nov 1993, 1993
ISBN 10: 3540575030
ISBN 13: 9783540575030
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Computational geometry concerns itself with designing andanalyzing algorithms for solving geometric problems. Thefield has reached a high level of sophistication, and verycomplicated algorithms have been designed.However, it isalso useful to develop more practical algorithms, so long asthey are based on rigorous methods. One such method is theuse of randomized algorithms. These algorithms have becomemore and more popular, turning into one of the hottest areasof recent years. Dynamic algorithms are particularlyinteresting because in practice the data of a problem areoften acquired progressively. In this monograph the authorstudies the theoretical complexity and practical efficiencyof randomized dynamic algorithms. 180 pp. Englisch. Nº de ref. del artículo: 9783540575030
Comprar nuevo
EUR 74,89
Envío por EUR 23,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Towards Dynamic Randomized Algorithms in Computational Geometry
Publicado por
Springer Berlin Heidelberg, Springer Berlin Heidelberg Nov 1993, 1993
ISBN 10: 3540575030
ISBN 13: 9783540575030
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Computational geometry concerns itself with designing andanalyzing algorithms for solving geometric problems. The field has reached a high level of sophistication, and very complicated algorithms have been designed.However, it is also useful to develop more practical algorithms, so long as they are based on rigorous methods. One such method is the use of randomized algorithms. These algorithms have become more and more popular, turning into one of the hottest areas of recent years. Dynamic algorithms are particularly interesting because in practice the data of a problem are often acquired progressively. In this monograph the author studies the theoretical complexity and practical efficiency of randomized dynamic algorithms.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 180 pp. Englisch. Nº de ref. del artículo: 9783540575030
Comprar nuevo
EUR 53,49
Envío por EUR 60,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Towards Dynamic Randomized Algorithms in Computational Geometry
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Computational geometry concerns itself with designing andanalyzing algorithms for solving geometric problems. Thefield has reached a high level of sophistication, and verycomplicated algorithms have been designed.However, it isalso useful to develop more practical algorithms, so long asthey are based on rigorous methods. One such method is theuse of randomized algorithms. These algorithms have becomemore and more popular, turning into one of the hottest areasof recent years. Dynamic algorithms are particularlyinteresting because in practice the data of a problem areoften acquired progressively. In this monograph the authorstudies the theoretical complexity and practical efficiencyof randomized dynamic algorithms. Nº de ref. del artículo: 9783540575030
Comprar nuevo
EUR 53,49
Envío por EUR 61,42
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Towards Dynamic Randomized Algorithms in Computational Geometry
Librería: preigu, Osnabrück, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Towards Dynamic Randomized Algorithms in Computational Geometry | Monique Teillaud | Taschenbuch | xi | Englisch | 1993 | Springer | EAN 9783540575030 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Nº de ref. del artículo: 102131708
Comprar nuevo
EUR 50,25
Envío por EUR 70,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 5 disponibles