My Account Log in

1 option

Algorithm Engineering : Bridging the Gap Between Algorithm Theory and Practice / edited by Matthias Müller-Hannemann, Stefan Schirra.

SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online

View online
Format:
Book
Contributor:
Müller-Hannemann, Matthias, editor.
Schirra, Stefan, editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 5971.
Theoretical Computer Science and General Issues ; 5971
Language:
English
Subjects (All):
Computer programming.
Algorithms.
Logic, Symbolic and mathematical.
Software engineering.
Computer simulation.
Data structures (Computer science).
Programming Techniques.
Algorithm Analysis and Problem Complexity.
Mathematical Logic and Formal Languages.
Software Engineering.
Simulation and Modeling.
Data Structures.
Local Subjects:
Programming Techniques.
Algorithm Analysis and Problem Complexity.
Mathematical Logic and Formal Languages.
Software Engineering.
Simulation and Modeling.
Data Structures.
Physical Description:
1 online resource (XVI, 513 pages) : 72 illustrations.
Edition:
First edition 2010.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010.
System Details:
text file PDF
Summary:
Algorithms are essential building blocks of computer applications. However, advancements in computer hardware, which render traditional computer models more and more unrealistic, and an ever increasing demand for efficient solution to actual real world problems have led to a rising gap between classical algorithm theory and algorithmics in practice. The emerging discipline of Algorithm Engineering aims at bridging this gap. Driven by concrete applications, Algorithm Engineering complements theory by the benefits of experimentation and puts equal emphasis on all aspects arising during a cyclic solution process ranging from realistic modeling, design, analysis, robust and efficient implementations to careful experiments. This tutorial - outcome of a GI-Dagstuhl Seminar held in Dagstuhl Castle in September 2006 - covers the essential aspects of this process in ten chapters on basic ideas, modeling and design issues, analysis of algorithms, realistic computer models, implementation aspects and algorithmic software libraries, selected case studies, as well as challenges in Algorithm Engineering. Both researchers and practitioners in the field will find it useful as a state-of-the-art survey.
Contents:
1. Foundations of Algorithm Engineering
2. Modeling
3. Selected Design Issues
4. Analysis of Algorithms
5. Realistic Computer Models
6. Implementation Aspects
7. Libraries
8. Experiments
9. Case Studies
10. Challenges in Algorithm Engineering.
Other Format:
Printed edition:
ISBN:
978-3-642-14866-8
9783642148668
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account