Kaikki kirjat 25 % alennuksella koodilla: BOOKS

  • check Yli 10 miljoonaa kirjaa
  • check Uutuuksia joka päivä
  • check Yli 1 miljoona asiakasta luottaa meihin
  • check Hyvät hinnat ja alennukset
  • check Toimitus koko Eurooppaan

Towards Dynamic Randomized Algorithms in Computational Geometry - Monique Teillaud

englanti
1993-11-23
63,51 € 84,68 €

-25% koodilla BOOKS

Toimittajalla varastossa

Toimitus 12-18 arkipäivässä

30 päivän palautusoikeus

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 ... Täydellinen kuvaus

Saatat myös pitää

Kuvaus

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.

Lisätietoja

Kirjoittaja Monique Teillaud
Julkaisija Springer Berlin Heidelberg
Series Lecture Notes in Computer Science
Julkaisuvuosi 1993
Kannen tyyppi Pehmeäkantinen
EAN 9783540575030
Kirjoita oma arvostelusi
Arvostelet: Towards Dynamic Randomized Algorithms in Computational Geometry
Arvostelusi:

Goodreads-arvostelut

63,51 € 84,68 €