Skip to Content

Books by Subject

Algorithms & Complexity Books

You are currently browsing 41–50 of 143 new and published books in the subject of Algorithms & Complexity — sorted by publish date from newer books to older books.

For books that are not yet published; please browse forthcoming books.

New and Published Books – Page 5

  1. Shadow Algorithms Data Miner

    By Andrew Woo, Pierre Poulin

    Shadow Algorithms Data Miner provides a high-level understanding of the complete set of shadow concepts and algorithms, addressing their usefulness from a larger graphics system perspective. It discusses the applicability and limitations of all the direct illumination approaches for shadow...

    Published June 12th 2012 by A K Peters/CRC Press

  2. Combinatorics of Permutations, Second Edition

    By Miklos Bona

    Series: Discrete Mathematics and Its Applications

    A Unified Account of Permutations in Modern CombinatoricsA 2006 CHOICE Outstanding Academic Title, the first edition of this bestseller was lauded for its detailed yet engaging treatment of permutations. Providing more than enough material for a one-semester course, Combinatorics of Permutations,...

    Published June 11th 2012 by Chapman and Hall/CRC

  3. Combinatorial Scientific Computing

    Edited by Uwe Naumann, Olaf Schenk

    Series: Chapman & Hall/CRC Computational Science

    Combinatorial Scientific Computing explores the latest research on creating algorithms and software tools to solve key combinatorial problems on large-scale high-performance computing architectures. It includes contributions from international researchers who are pioneers in designing software and...

    Published January 25th 2012 by Chapman and Hall/CRC

  4. Applications of Combinatorial Matrix Theory to Laplacian Matrices of Graphs

    By Jason J. Molitierno

    Series: Discrete Mathematics and Its Applications

    On the surface, matrix theory and graph theory seem like very different branches of mathematics. However, adjacency, Laplacian, and incidence matrices are commonly used to represent graphs, and many properties of matrices can give us useful information about the structure of graphs. Applications...

    Published January 25th 2012 by Chapman and Hall/CRC

  5. Multiple-Base Number System

    Theory and Applications

    By Vassil Dimitrov, Graham Jullien, Roberto Muscedere

    Series: Circuits and Electrical Engineering

    Computer arithmetic has become so fundamentally embedded into digital design that many engineers are unaware of the many research advances in the area. As a result, they are losing out on emerging opportunities to optimize its use in targeted applications and technologies. In many cases, easily...

    Published January 24th 2012 by CRC Press

  6. Fundamentals of Dependable Computing for Software Engineers

    By John Knight

    Series: Chapman & Hall/CRC Innovations in Software Engineering and Software Development Series

    Fundamentals of Dependable Computing for Software Engineers presents the essential elements of computer system dependability. The book describes a comprehensive dependability-engineering process and explains the roles of software and software engineers in computer system dependability. Readers...

    Published January 12th 2012 by Chapman and Hall/CRC

  7. A Concise Introduction to Programming in Python

    By Mark J. Johnson

    Series: Chapman & Hall/CRC Textbooks in Computing

    Suitable for newcomers to computer science, A Concise Introduction to Programming in Python provides a succinct, yet complete, first course in computer science using the Python programming language. The book features: Short, modular chapters with brief and precise explanations, intended for one...

    Published December 21st 2011 by Chapman and Hall/CRC

  8. Particle Swarm Optimisation

    Classical and Quantum Perspectives

    By Jun Sun, Choi-Hong Lai, Xiao-Jun Wu

    Series: Chapman & Hall/CRC Numerical Analysis and Scientific Computing Series

    Although the particle swarm optimisation (PSO) algorithm requires relatively few parameters and is computationally simple and easy to implement, it is not a globally convergent algorithm. In Particle Swarm Optimisation: Classical and Quantum Perspectives, the authors introduce their concept of...

    Published December 19th 2011 by CRC Press

  9. Cost-Sensitive Machine Learning

    Edited by Balaji Krishnapuram, Shipeng Yu, R. Bharat Rao

    Series: Chapman & Hall/CRC Machine Learning & Pattern Recognition

    In machine learning applications, practitioners must take into account the cost associated with the algorithm. These costs include: Cost of acquiring training data Cost of data annotation/labeling and cleaning Computational cost for model fitting, validation, and testing Cost of collecting...

    Published December 19th 2011 by CRC Press

  10. Undocumented Secrets of MATLAB-Java Programming

    By Yair M. Altman

    For a variety of reasons, the MATLAB®-Java interface was never fully documented. This is really quite unfortunate: Java is one of the most widely used programming languages, having many times the number of programmers and programming resources as MATLAB. Also unfortunate is the popular claim that...

    Published December 5th 2011 by Chapman and Hall/CRC