|Categories||Free Downloadable Data Structures and Algorithms eBooks!|
|Digraphs: Theory, Algorithms and Applications
Substantially revised, reorganised and updated, the book now comprises eighteen chapters, carefully arranged in a straightforward and logical manner, with many new results and open problems..
Fast Fourier Transforms
This book uses an index map, a polynomial decomposition, an operator factorization, and a conversion to a filter to develop a very general and efficient description of fast algorithms to calculate the discrete Fourier transform (DFT). The work of Winograd is outlined, chapters by Selesnick, Pueschel, and Johnson are included, and computer programs are provided.
Search Algorithms and Applications
Search algorithms aim to find solutions or objects with specified properties and constraints in a large solution search space or among a collection of objects. A solution can be a set of value assignments to variables that will satisfy the constraints or a sub-structure of a given discrete structure. In addition, there are search algorithms, mostly probabilistic, that are designed for the prospective quantum computer.
Algorithms and Data Structures in VLSI Design: OBDD - Foundations and Applications
This book presents broad and in-depth coverage of the entire field of modern VLSI Design with ordered binary decision diagrams (OBDDs).
Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations
Multiagent systems are those systems that include multiple autonomous entities with either diverging information or diverging interests, or both. This comprehensive introduction to a burgeoning field is written from a computer science perspective, while bringing together ideas from operations research, game theory, economics, logic, and even philosophy and linguistics.
This book covers fundamental, theoretical topics as well as advanced, practical applications of Greedy Algorithms.
Clever Algorithms: Nature-Inspired Programming Recipes
The book describes 45 algorithms from the field of Artificial Intelligence. All algorithm descriptions are complete and consistent to ensure that they are accessible, usable and understandable by a wide audience.
Advances in Evolutionary Algorithms
Genetic and evolutionary algorithms (GEAs) have often achieved an enviable success in solving optimization problems in a wide range of disciplines. The goal of this book is to provide effective optimization algorithms for solving a broad class of problems quickly, accurately, and reliably by employing evolutionary mechanisms.
The Design of Approximation Algorithms
Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design; to computer science problems in databases; to advertising issues in viral marketing. Yet most such problems are NP-hard. Thus unless P = NP, there are no efficient algorithms to find optimal solutions to such problems. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions.
Algorithmic Game Theory
The subject matter of Algorithmic Game Theory covers many of the hottest area of useful new game theory research, introducing deep new problems, techniques, and perspectives that demand the attention of economists as well as computer scientists. The all-star list of author-contributors makes this book the best place for newcomers to begin their studies.
Art Gallery Theorems and Algorithms
Art gallery theorems and algorithms are so called because they relate to problems involving the visibility of geometrical shapes and their internal surfaces. This book explores generalizations and specializations in these areas. Among the presentations are recently discovered theorems on orthogonal polygons, polygons with holes, exterior visibility, visibility graphs, and visibility in three dimensions.