Learn IT - Books tags combinatorial

Mathematics for Informatics and Computer Science (ISTE)

John Wiley & Sons, 2010

How many ways do exist to mix different ingredients, how many chances to win a gambling game, how many possible paths going from one place to another in a network ? To this kind of questions Mathematics applied to computer gives a stimulating and exhaustive answer. This text, presented in three parts (Combinatorics, Probability, Graphs)...

Algorithms and Data Structures: The Basic Toolbox

Springer, 2008

Algorithms are at the heart of every nontrivial computer application, and algorithmics is a modern and active area of computer science. Every computer scientist and every professional programmer should know about the basic algorithmic toolbox: structures that allow efficient organization and retrieval of data, frequently used algorithms, and basic...

Combinatorial Optimization: 3-Volume Set (ISTE)

John Wiley & Sons, 2010

Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major domains: mathematics, theoretical computer science and management.

The three volumes of the Combinatorial Optimization set aim to cover a wide range of topics in this area. These topics also deal with fundamental notions and...

Graph Algorithms in the Language of Linear Algebra (Software, Environments, and Tools)

SIAM, 2011

Graphs are among the most important abstract data types in computer science, and the algorithms that operate on them are critical to modern life. Graphs have been shown to be powerful tools for modeling complex problems because of their simplicity and generality. Graph algorithms are one of the pillars of mathematics, informing research in...

Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications

Springer, 2006

This book provides a good opportunity for computer science practitioners and researchers to get in sync with the current state-of-the-art and future trends in the field of combinatorial optimization and online algorithms. Recent advances in this area are presented focusing on the design of efficient approximation and on-line algorithms. One central...

Computing for Numerical Methods Using Visual C++

John Wiley & Sons, 2007

A visual, interdisciplinary approach to solving problems in numerical methods

Computing for Numerical Methods Using Visual C++ fills the need for a complete, authoritative book on the visual solutions to problems in numerical methods using C++. In an age of boundless research, there is a need for a programming language that can successfully...

Proofs that Really Count: The Art of Combinatorial Proof (Dolciani Mathematical Expositions)

The Mathematical Association of America, 2003

'This book is written in an engaging, conversational style, and this reviewer found it enjoyable to read through (besides learning a few new things). Along the way, there are a few surprises, like the 'world's fastest proof by induction' and a magic trick. As a resource for teaching, and a handy basic reference, it will be a great addition to the...

Algorithm Design

Addison Wesley, 2005

Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the...

Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments and the Third Workshop (Proceedings in Applied Mathematics)

SIAM, 1987

The annual Workshop on Algorithm Engineering and Experiments (ALENEX) provides a forum for the presentation of original research in all aspects of algorithm engineering, including the implementation and experimental evaluation of algorithms and data structures. The workshop was sponsored by SIAM, the Society for Industrial and Applied...

Language and Automata Theory and Applications: 5th International Conference

Springer, 2012

These proceedings contain the papers that were presented at the 5th International Conference on Language and Automata Theory and Applications (LATA 2011), held in Tarragona, Spain, during May 26–31, 2011.

The scope of LATA is rather broad, including: algebraic language theory; algorithms for semi-structured...

Evolutionary Algorithms in Molecular Design (Methods and Principles in Medicinal Chemistry)

John Wiley & Sons, 2000

Nature has solved its most complicated problem, the creation, variation, and improvement of living organisms, in a simple and efficient manner. Starting from primitive forms in earth history, mutation and crossover produced variations that had to struggle for their existence and to compete with their ancestors and genetically...

A Mathematical Tapestry: Demonstrating the Beautiful Unity of Mathematics

Cambridge University Press, 2010

This easy-to-read book demonstrates how a simple geometric idea reveals fascinating connections and results in number theory, the mathematics of polyhedra, combinatorial geometry, and group theory. Using a systematic paper-folding procedure it is possible to construct a regular polygon with any number of sides. This remarkable algorithm has...

Result Page: 13 12 11 10 9 8 7 6 5 4 3 2 1