Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

Towards Dynamic Randomized Algorithms in Computational Geometry - Monique Teillaud

inglise keel
1993-11-23
50,81 € 84,68 €

-40% koodiga BOOKS

Meie tarnija laos

Saadetis 12-18 tööpäeva jooksul

30-päevane tagastamisõigus

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äielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

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.

Lisateave

Autor Monique Teillaud
Kirjastaja Springer Berlin Heidelberg
Series Lecture Notes in Computer Science
Väljalaskeaasta 1993
Kaanetüüp Pehme kaanega
EAN 9783540575030
Kirjuta oma arvustus
Te vaatate: Towards Dynamic Randomized Algorithms in Computational Geometry
Teie hinnang:

Goodreads'i arvustused

50,81 € 84,68 €