Muutke küpsiste eelistusi

E-raamat: Algorithm Engineering: Selected Results and Surveys

Edited by , Edited by
  • Formaat - PDF+DRM
  • Hind: 55,56 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

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.

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.
Engineering a Lightweight and Efficient Local Search SAT Solver
1(18)
Adrian Balint
Uwe Schoning
Route Planning in Transportation Networks
19(62)
Hannah Bast
Daniel Delling
Andrew Goldberg
Matthias Muller-Hannemann
Thomas Pajor
Peter Sanders
Dorothea Wagner
Renato F. Werneck
Theoretical Analysis of the k-Means Algorithm -- A Survey
81(36)
Johannes Blomer
Christiane Lammersen
Melanie Schmidt
Christian Sohler
Recent Advances in Graph Partitioning
117(42)
Aydin Buluc
Henning Meyerhenke
Ilya Safro
Peter Sanders
Christian Schulz
How to Generate Randomized Roundings with Dependencies and How to Derandomize Them
159(26)
Benjamin Doerr
Magnus Wahlstrom
External-Memory State Space Search
185(41)
Stefan Edelkamp
Algorithm Engineering Aspects of Real-Time Rendering Algorithms
226(19)
Matthias Fischer
Claudius Jahn
Friedhelm Meyer auf der Heide
Ralf Petring
Algorithm Engineering in Robust Optimization
245(35)
Marc Goerigk
Anita Schobel
Clustering Evolving Networks
280(50)
Tanja Hartmann
Andrea Kappes
Dorothea Wagner
Integrating Sequencing and Scheduling: A Generic Approach with Two Exemplary Industrial Applications
330(22)
Wiebke Hohn
Rolf H. Mohring
Engineering a Bipartite Matching Algorithm in the Semi-Streaming Model
352(27)
Lasse Kliemann
Engineering Art Galleries
379(40)
Pedro J. de Rezende
Cid C. de Souza
Stephan Friedrichs
Michael Hemmer
Alexander Kroller
Davi C. Tozoni
Author Index 419
Lectures of the Reasoning Web Summer School