|
|
|
|
| LEADER |
03293nam a22005655i 4500 |
| 001 |
978-3-319-49487-6 |
| 003 |
DE-He213 |
| 005 |
20161110160822.0 |
| 007 |
cr nn 008mamaa |
| 008 |
161110s2016 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783319494876
|9 978-3-319-49487-6
|
| 024 |
7 |
|
|a 10.1007/978-3-319-49487-6
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.9.A43
|
| 072 |
|
7 |
|a UMB
|2 bicssc
|
| 072 |
|
7 |
|a COM051300
|2 bisacsh
|
| 082 |
0 |
4 |
|a 005.1
|2 23
|
| 245 |
1 |
0 |
|a Algorithm Engineering
|h [electronic resource] :
|b Selected Results and Surveys /
|c edited by Lasse Kliemann, Peter Sanders.
|
| 264 |
|
1 |
|a Cham :
|b Springer International Publishing :
|b Imprint: Springer,
|c 2016.
|
| 300 |
|
|
|a X, 419 p. 68 illus.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 9220
|
| 505 |
0 |
|
|a 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.
|
| 520 |
|
|
|a 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.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Computer communication systems.
|
| 650 |
|
0 |
|a Computers.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer science
|x Mathematics.
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Information Systems Applications (incl. Internet).
|
| 650 |
2 |
4 |
|a Artificial Intelligence (incl. Robotics).
|
| 650 |
2 |
4 |
|a Computer Communication Networks.
|
| 650 |
2 |
4 |
|a Computation by Abstract Devices.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 700 |
1 |
|
|a Kliemann, Lasse.
|e editor.
|
| 700 |
1 |
|
|a Sanders, Peter.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783319494869
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 9220
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-319-49487-6
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
