Fr. 69.00

Algorithm Engineering - Selected Results and Surveys

Inglese · Tascabile

Spedizione di solito entro 1 a 2 settimane (il titolo viene stampato sull'ordine)

Descrizione

Ulteriori informazioni

Algorithm Engineering is a methodology for algorithmic research that combines theory with implementation and experimentation in order to obtain better algorithms with high practical impact. Traditionally, the study of algorithms was dominated by mathematical (worst-case) analysis. In Algorithm Engineering, algorithms are also implemented and experiments conducted in a systematic way, sometimes resembling the experimentation processes known from fields such as biology, chemistry, or physics. This helps in counteracting an otherwise growing gap between theory and practice.

Sommario

Engineering a Lightweight and Efficient Local Search SAT Solver.- Route Planning in Transportation Networks.- Theoretical Analysis of the k-Means Algorithm - A Survey.- Recent Advances in Graph Partitioning.- How to Generate Randomized Roundings with Dependencies and How to Derandomize Them.- External-Memory State Space Search.- Algorithm Engineering Aspects of Real-Time Rendering Algorithms.- Algorithm Engineering in Robust Optimization.- Clustering Evolving Networks.- Integrating Sequencing and Scheduling: A Generic Approach with Two Exemplary Industrial Applications.- Engineering a Bipartite Matching Algorithm in the Semi-Streaming Model.- Engineering Art Galleries.

Info autore

Lectures of the Reasoning Web Summer School

Riassunto

Algorithm Engineering is a methodology for algorithmic research that combines theory with implementation and experimentation in order to obtain better algorithms with high practical impact. Traditionally, the study of algorithms was dominated by mathematical (worst-case) analysis. In Algorithm Engineering, algorithms are also implemented and experiments conducted in a systematic way, sometimes resembling the experimentation processes known from fields such as biology, chemistry, or physics. This helps in counteracting an otherwise growing gap between theory and practice.

Dettagli sul prodotto

Con la collaborazione di Lass Kliemann (Editore), Lasse Kliemann (Editore), Sanders (Editore), Sanders (Editore), Peter Sanders (Editore)
Editore Springer, Berlin
 
Lingue Inglese
Formato Tascabile
Pubblicazione 01.01.2016
 
EAN 9783319494869
ISBN 978-3-31-949486-9
Pagine 419
Dimensioni 173 mm x 26 mm x 234 mm
Peso 684 g
Illustrazioni X, 419 p. 68 illus.
Serie Lecture Notes in Computer Science
Theoretical Computer Science and General Issues
Springer
Lecture Notes in Computer Science
Theoretical Computer Science and General Issues
Categoria Scienze naturali, medicina, informatica, tecnica > Matematica > Teoria delle probabilità, stocastica, statistica matematica

Recensioni dei clienti

Per questo articolo non c'è ancora nessuna recensione. Scrivi la prima recensione e aiuta gli altri utenti a scegliere.

Scrivi una recensione

Top o flop? Scrivi la tua recensione.

Per i messaggi a CeDe.ch si prega di utilizzare il modulo di contatto.

I campi contrassegnati da * sono obbligatori.

Inviando questo modulo si accetta la nostra dichiarazione protezione dati.