Nemokamas pristatymas nuo 29€

  • check 10 + milijonai knygų
  • check Naujienos (kiekvieną dieną)
  • check 1 + mln. klientų mus pasitiki
  • check Geros kainos % Nuolaidos
  • check Nemokamas pristatymas nuo 29 eur

Towards Dynamic Randomized Algorithms in Computational Geometry - Monique Teillaud

Anglų
1993-11-23
63,51 € 84,68 €

-25% su kodu BOOKS

Turime sandėlyje pas mūsų tiekėją

Pristatymas per 12-18 d.d.

30 dienų grąžinimo 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 ... Visas aprašymas

Jums taip pat gali patikti

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.

Daugiau informacijos

Autorius Monique Teillaud
Leidėjas Springer Berlin Heidelberg
Series Lecture Notes in Computer Science
Išleidimo metai 1993
Viršelio tipas Minkšti viršeliai
EAN 9783540575030
Parašykite savo atsiliepimą
Jūs peržiūrėjote: Towards Dynamic Randomized Algorithms in Computational Geometry
Jūsų įvertinimas:

Goodreads Atsiliepimai

63,51 € 84,68 €