9783540575030 - towards dynamic randomized algorithms in computational geometry: 758 (lecture notes in computer science, 758) de teillaud, monique (6 resultados)

- Tapa blanda
Librería: Emile Kerssemakers ILAB, Heerlen, HolandaEmile Kerssemakers ILAB
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado
EUR 25,00
Envío por EUR 33,00Se envía de Holanda a Estados Unidos de AmericaCantidad disponible: 1 disponibles
23 cm. original paperback. 158 pp. diagrams. bibliography. index. "Lecture Notes in Computer Science". -(libr labels, otherwise (very) good). 250g.

- Tapa blanda
Librería: Antiquariat Bookfarm, Löbnitz, AlemaniaAntiquariat Bookfarm
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado
EUR 52,60
Envío por EUR 40,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
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.

- Tapa blanda
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 58,39
Envío por EUR 61,42Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: 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 develo…p 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.

- Tapa blanda
- Impresión bajo demanda
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AlemaniaBuchWeltWeit Ludwig Meier e.K.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 74,89
Envío por EUR 23,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Taschenbuch. Condición: 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.

- Tapa blanda
- Impresión bajo demanda
Librería: moluna, Greven, Alemaniamoluna
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 48,37
Envío por EUR 48,99Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: 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.Howe…ver, it isalso useful to dev.

- Tapa blanda
- Impresión bajo demanda
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemaniabuchversandmimpf2000
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 53,49
Envío por EUR 60,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: 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 u…seful 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.