Algorithms & Data Structures Books - Free eBooks Directory
Free Algorithms & Data Structures ebooks. Categorized directory of free Algorithms & Data Structures books. Read online or download free eBooks in different formats.
Free eBooks
89
Ebook Details
Author
Moshe Sipper
Publisher
Lulu.com 2011
Moshe Sipper and his group have produced a plethora of award-winning results, in numerous games of diverse natures, evidencing the success and efficiency of evolutionary algorithms in general.
Free eBooks
45
Ebook Details
Author
K. Mehlhorn, P. Sanders
Publisher
Springer 2008
This book is a concise introduction addressed to students and professionals familiar with programming and basic mathematical language.
Free eBooks
49
Ebook Details
Author
Jeffrey Scott Vitter
Publisher
Now Publishers 2008
Free eBooks
58
Ebook Details
Author
Eisuke Kita
Publisher
InTech 2011
Evolutionary algorithms are successively applied to wide optimization problems in the engineering, marketing, operations research, and social science, such as include scheduling, genetics,
Free eBooks
45
Ebook Details
Author
Nashat Mansour
Publisher
InTech 2011
Free eBooks
50
Ebook Details
Author
L. Spector, W.B. Langdon, U. O'Reilly, P.J. Angeline
Publisher
The MIT Press 1999
Genetic programming is a form of evolutionary computation that evolves programs and program-like executable structures for developing reliable time- and cost-
Free eBooks
66
Ebook Details
Author
Wolfgang Merkle
Publisher
ESSLLI 2001
Free eBooks
43
Ebook Details
Author
Clifford A. Shaffer
Publisher
Virginia Tech 2010
Free eBooks
42
Ebook Details
Author
Guy Blelloch
Publisher
The MIT Press 1990
Vector Models for Data-Parallel Computing describes a model of parallelism that extends and formalizes the Data-Parallel model on which the Connection Machine and other supercomputers are based. It presents many algorithms based on the model.
Free eBooks
69
Ebook Details
Author
D. P. Williamson, D. B. Shmoys
Publisher
Cambridge University Press 2010
This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms.