Towards Dynamic Randomized Algorithms in Computational Geometry

Name: Towards Dynamic Randomized Algorithms in Computational Geometry
Brand: Springer, Berlin
SKU: 9783540575030
Price: 276.36 RON
Availability: InStock

Autor: Monique Teillaud

Limbă:

Legare: Carte broșată

Editura: Springer, Berlin

Disponibilitate: În depozitul extern

Expediem în 5-8 zile

276.36 lei

Computational geometry concerns itself with designing andanalyzing algorithms for solving geometric...

Informații despre carte

Autor

Monique Teillaud

Limbă

engleză

Legare

Carte - Carte broșată

Publicat

1993

Pagini

169

EAN

9783540575030

ISBN

3540575030

Enbook ID

01565744

Editura

Springer, Berlin

Greutate

243

Dimensiuni

155 x 233 x 9

Descriere completă

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 hot test 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 efficiencyof randomized dynamic algorithms.

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Towards Dynamic Randomized Algorithms in Computational Geometry

Informații despre carte

Descriere completă

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și