Towards Dynamic Randomized Algorithms in Computational Geometry: 758 (Lecture Notes in Computer Science, 758) - Softcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Towards Dynamic Randomized Algorithms in Computational...
Seller Image
Towards dynamic randomized algorithms in computational geometry.
Seller: Emile Kerssemakers ILAB, Heerlen, Netherlands
Seller rating 5 out of 5 stars
23 cm. original paperback. 158 pp. diagrams. bibliography. index. "Lecture Notes in Computer Science". -(libr labels, otherwise (very) good). 250g. Seller Inventory # 71736
Buy Used
£ 22.46
£ 28.78 shipping
Ships from Netherlands to U.S.A.
Ships from Netherlands to U.S.A.
Quantity: 1 available
Seller Image
Towards Dynamic Randomized Algorithms in Computational Geometry.
Published by
Berlin, Springer Berlin Heidelberg, 1993
ISBN 10: 3540575030
ISBN 13: 9783540575030
Used
Softcover
Seller: Antiquariat Bookfarm, Löbnitz, Germany
Seller rating 5 out of 5 stars
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. Seller Inventory # 2347641
Seller Image
Towards Dynamic Randomized Algorithms in Computational Geometry
Published by
Springer Berlin Heidelberg, 1993
ISBN 10: 3540575030
ISBN 13: 9783540575030
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # 4894346
Buy New
£ 43.45
£ 42.72 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Seller Image
Towards Dynamic Randomized Algorithms in Computational Geometry
Published by
Springer Berlin Heidelberg Nov 1993, 1993
ISBN 10: 3540575030
ISBN 13: 9783540575030
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783540575030
Seller Image
Towards Dynamic Randomized Algorithms in Computational Geometry
Published by
Springer, Springer Nov 1993, 1993
ISBN 10: 3540575030
ISBN 13: 9783540575030
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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 KG, Sachsenplatz 4-6, 1201 Wien 180 pp. Englisch. Seller Inventory # 9783540575030
Seller Image
Towards Dynamic Randomized Algorithms in Computational Geometry
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783540575030