Algorithms for Programmers: Ideas and Source Code
This is a draft of a book about selected algorithms. The audience in mind are programmers who are interested in the treated algorithms and actually want to create and understand working and reasonably optimized code.
Algorithms for Programmers: Ideas and Source Code
This is a draft of a book about selected algorithms. The audience in mind are programmers who are interested in the treated algorithms and actually want to create and understand working and reasonably optimized code.
Optimal Quadratic Programming Algorithms
Solving optimization problems in complex systems often requires the implementation of advanced mathematical techniques. Quadratic programming (QP) is one technique that allows for the optimization of a quadratic function in several variables
The Algorithm Design Manual
“…the book is an algorithm-implementation treasure trove, and putting all of these implementations in one place was no small feat. The list of implementations [and] extensive bibliography make the book an invaluable resource for
Algorithm Design
Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understandin
The Art of Application Performance Testing: Help for Programmers and Quality Assurance
This practical book provides a step-by-step approach to testing mission-critical applications for scalability and performance before they’re deployed — a vital topic to which other books devote one chapter, if that. Businesses to
Finite Element Methods: Parallel-Sparse Statics and Eigen-Solutions
This textbook should be useful for graduate students, practicing engineers, and researchers who wish to thoroughly understand the detailed step-by-step algorithms, used during the finite element (truly sparse) assembly, the “direct&rdqu
Complexity Theory: Exploring the Limits of Efficient Algorithms
Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits what is possible with the available resources. The results prevent the search for non-existing efficien