Bezmaksas piegāde pasūtījumiem virs 29€

  • check 10+ miljoni grāmatu
  • check Jaunumi katru dienu
  • check Vairāk nekā 1 miljons klientu mums uzticas
  • check Labas cenas un atlaides
  • check Piegāde visā Eiropā

Towards Dynamic Randomized Algorithms in Computational Geometry - Monique Teillaud

angļu valoda
1993-11-23
59,28 € 84,68 €

-30% ar kodu BOOKS

Piegādātāja noliktavā

Piegāde 12-18 darba dienu laikā

30 dienu atgriešanas politika

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 ... Pilns apraksts

Jums varētu patikt arī

Aprašymas

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.

Vairāk informācijas

Autors Monique Teillaud
Izdevējs Springer Berlin Heidelberg
Series Lecture Notes in Computer Science
Izlaides gads 1993
Vāka tips Mīkstais vāks
EAN 9783540575030
Rakstiet savu atsauksmi
Jūs vērtējat: Towards Dynamic Randomized Algorithms in Computational Geometry
Jūsu novērtējums:

Goodreads atsauksmes

59,28 € 84,68 €