Buch, Englisch, 240 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 400 g
On Computing Methodologies for Computer Algorithms Performance Evaluation
Buch, Englisch, 240 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 400 g
Reihe: Monographs in Computer Science
ISBN: 978-1-4612-9160-2
Verlag: Springer
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Informatik Theoretische Informatik
- Mathematik | Informatik Mathematik Stochastik Wahrscheinlichkeitsrechnung
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
- Mathematik | Informatik Mathematik Mathematik Allgemein Diskrete Mathematik, Kombinatorik
- Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
Weitere Infos & Material
1 Introduction.- 1.1 Criteria for the Performance and Quality of Algorithms.- 1.2 The Analysis of a Very Simple Algorithm.- 1.3 Comments on Sources and Resources.- 2 Tools of the Trade.- 2.1 Introduction to Asymptotics.- 2.2 Generating Functions.- 2.3 Integral Transforms (it’s).- 2.4 Combinatorial Calculus (The Symbolic Operator Method).- 2.5 Asymptotics from Generating Functions.- 2.6 Selected Results from Probability Theory.- 3 Algorithms over Permutations.- 3.1 MAX — Locating the Largest Term in a Permutation.- 3.2 Representations of Permutations.- 3.3 Analysis of Sorting Algorithms.- 4 Algorithms for Communications Networks.- 4.1 The Efficiency of Multiple Connections.- 4.2 Collision Resolution Stack Algorithms.- 5 Bin Packing Heuristics.- 5.1 The Next-Fit Bin Packing Algorithm.- 5.2 The Next-Fit-Decreasing Bin Packing Algorithm.- Appendix A: Binomial Coefficients.- Appendix B: Stirling Numbers.- Appendix C: Inequalities.- References.- Notation Index.