Probability and Algorithms
Some of the hardest computational problems have been successfully attacked through the use of probabilistic algorithms, which have an element of randomness to them. Concepts from the field of probability are also increasingly useful in analyzing the performance of algorithms, broadening our understanding beyond that provided by the...
Absolute C++ (3rd Edition)
Organized around the structure of the C++ programming language, Absolute C++, Third Edition,
benefits C++ readers of all levels with its comprehensive coverage and accessible style. Best-selling author Walt Savitch presents concepts and techniques in a clear, concise manner using understandable language and code...
Super-Recursive Algorithms (Monographs in Computer Science)
This book introduces the new realm of superrecursive algorithms and the development
of mathematical models for them. Although many still believe that only recursive
algorithms exist and that only some of them are realizable, there are many
situations in which people actually work with superrecursive algorithms....
Discrete Mathematics With Algorithms
This first-year course in discrete mathematics requires no calculus or computer programming experience. The approach stresses finding efficient algorithms, rather than existential results. Provides an introduction to constructing proofs (especially by induction), and an introduction to algorithmic problem-solving. All algorithms are presented in...
|Result Page: Previous 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Next |