12 titles from eBooks.com

Cambridge University Press (2008)

US$39.50

Textbook that teaches students how to think about algorithms like an expert, without getting bogged down in formal proof.

Textbook that teaches students how to think about algorithms like an expert, without getting bogged...

Wiley (2007)

US$142.20

The only single-source——now completely updated and revised——to offer a unified treatment of the theory, methodology, and applications of the EM algorithm Complete with updates that capture developments from the past decade, The EM Algorithm and Extensions, Second Edition successfully provides a basic understanding of the EM algorithm by describing...

The only single-source——now completely updated and revised——to offer a unified treatment of the...

OUP Oxford (2006)

US$139.99

An application-oriented introduction to the highly topical area of the development and analysis of efficient fixed-parameter algorithms for hard problems. Aimed at graduate and research mathematicians, algorithm designers, and computer scientists, it provides a fresh view on this highly innovative field of algorithmic research.

An application-oriented introduction to the highly topical area of the development and analysis of...

Springer Berlin Heidelberg (2009)

US$209.00

The first book to offer a comprehensive view of the LLL algorithm, this text surveys computational aspects of Euclidean lattices and their main applications. It includes many detailed motivations, explanations and examples.

The first book to offer a comprehensive view of the LLL algorithm, this text surveys computational...

CRC Press (2015)

US$57.95

Choose the Correct Solution Method for Your Optimization Problem Optimization: Algorithms and Applications presents a variety of solution techniques for optimization problems, emphasizing concepts rather than rigorous mathematical details and proofs. The book covers both gradient and stochastic methods as solution techniques for...

Choose the Correct Solution Method for Your Optimization Problem Optimization: Algorithms and...

Springer Berlin Heidelberg (2007)

US$79.99

This book constitutes the refereed proceedings of the 4th International Symposium on Stochastic Algorithms: Foundations and Applications, SAGA 2007. The nine revised full papers and five invited papers presented were carefully selected for inclusion in the book. The contributed papers included in this volume cover both theoretical as well as...

This book constitutes the refereed proceedings of the 4th International Symposium on Stochastic...

Springer Berlin Heidelberg (2005)

US$84.99

Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits of what is possible with the available resources. An understanding of these limits prevents the search for non-existing efficient algorithms. This textbook considers randomization as a key concept and emphasizes...

Complexity theory is the theory of determining the necessary resources for the solution of...

US$32.76

This proceedings contains contributions on topics such as the models of computation, analysis and design of sequential and parallel algorithms, data structures and their applications, approximating algorithms and probabilistic analysis, and computational complexity. Contents: Analysis and Implementation of Parallel Uniform Hashing (F Luccio et al);...

This proceedings contains contributions on topics such as the models of computation, analysis and...

Springer New York (2012)

US$64.99

This undergraduate textbook in topological combinatorics covers such topics as fair division, graph coloring problems, evasiveness of graph properties, and embedding problems from discrete geometry. Includes many figures and exercises.

This undergraduate textbook in topological combinatorics covers such topics as fair division, graph...

Springer Netherlands (2007)

US$209.00

The idea of the present volume emerged in 2002 from a series of talks by Frank Stephan in 2002, and John Case in 2003, on developments of algorithmic learning theory. These talks took place in the Mathematics Department at the George Washington University. Following the talks, ValentinaHarizanovandMichèleFriendraised thepossibility ofanexchange of...

The idea of the present volume emerged in 2002 from a series of talks by Frank Stephan in 2002, and...