Towards Dynamic Randomized Algorithms in Computational Geometry
Monique Teillaud (auth.)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.
Kategori:
Tahun:
1993
Edisi:
1
Penerbit:
Springer-Verlag Berlin Heidelberg
Bahasa:
english
Halaman:
169
ISBN 10:
3540575030
ISBN 13:
9783540575030
Nama seri:
Lecture Notes in Computer Science 758
File:
DJVU, 1.37 MB
IPFS:
,
english, 1993
Amazon 
Barnes & Noble 
Bookshop.org
Ingin menambahkan toko buku? Hubungi kami melalui support@z-lib.do
Konversi file
Lebih banyak hasil pencarian
Manfaat yang lain 
Istilah kunci
Daftar buku terkait
