9783540575030 - towards dynamic randomized algorithms in computational geometry: 758 di teillaud, monique (6 risultati)
- Brossura
Da: Emile Kerssemakers ILAB, Heerlen, Paesi BassiEmile Kerssemakers ILAB
Contatta il venditoreVenditore con 5 stelleCondizione: Usato
EUR 25,00
EUR 33,00 spedizioneSpedito da Paesi Bassi a U.S.A.Quantità: 1 disponibili
23 cm. original paperback. 158 pp. diagrams. bibliography. index. "Lecture Notes in Computer Science". -(libr labels, otherwise (very) good). 250g.
- Brossura
Da: Antiquariat Bookfarm, Löbnitz, GermaniaAntiquariat Bookfarm
Contatta il venditoreVenditore con 5 stelleCondizione: Usato
EUR 52,60
EUR 40,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. so7943 3540575030 Sprache: Englisch Gewicht in Gramm: 900.
- Brossura
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 58,39
EUR 61,42 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Computational geometry concerns itself with designing andanalyzing algorithms for solving geometric problems. Thefield has reached a high level of sophistication, and verycomplicated algorithms have been designed.However, it isalso useful to devel…op more practical algorithms, so long asthey are based on rigorous methods. One such method is theuse of randomized algorithms. These algorithms have becomemore and more popular, turning into one of the hottest areasof recent years. Dynamic algorithms are particularlyinteresting because in practice the data of a problem areoften acquired progressively. In this monograph the authorstudies the theoretical complexity and practical efficiencyof randomized dynamic algorithms.
- Brossura
- Print on Demand
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, , GermaniaBuchWeltWeit Ludwig Meier e.K.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 74,89
EUR 23,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Computational geometry concerns itself with designing andanalyzing algorithms for solving geometric problems. Thefield has reached a high level of sophistication, and verycomplicated algorithms have been designed.However, it isalso… useful to develop more practical algorithms, so long asthey are based on rigorous methods. One such method is theuse of randomized algorithms. These algorithms have becomemore and more popular, turning into one of the hottest areasof recent years. Dynamic algorithms are particularlyinteresting because in practice the data of a problem areoften acquired progressively. In this monograph the authorstudies the theoretical complexity and practical efficiencyof randomized dynamic algorithms. 180 pp. Englisch.
- Brossura
- Print on Demand
Da: moluna, Greven, , Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 48,37
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Computational geometry concerns itself with designing andanalyzing algorithms for solving geometric problems. Thefield has reached a high level of sophistication, and verycomplicated algorithms have been designed.How…ever, it isalso useful to dev.
- Brossura
- Print on Demand
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 60,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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 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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 180 pp. Englisch.
