Learn IT - Books tags combinatorial

Bio-inspired Algorithms for the Vehicle Routing Problem (Studies in Computational Intelligence)

Springer, 2008

The vehicle routing problem (VRP) is one of the most famous combinatorial optimization problems. In simple terms, the goal is to determine a set of routes with overall minimum cost that can satisfy several geographical scattered demands. Biological inspired computation is a field devoted to the development of computational tools modeled after...

Boolean Functions in Cryptology and Information Security (Nato Science for Peace and Security)

IOS Press, 2008

This book contains the proceedings of the NATO-Russia Advanced Study Institute (ASI) 'Boolean Functions in Cryptology and Information Security', which was held in Zvenigorod, Moscow region, Russia. These proceedings consist of three parts. The first part contains survey lectures on various areas of Boolean function theory that are of primary...

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...

Combinatorial Group Theory: Presentations of Groups in Terms of Generators and Relations

Dover Publications, 1976

This seminal, much-cited account begins with a fairly elementary exposition of basic concepts and a discussion of factor groups and subgroups. The topics of Nielsen transformations, free and amalgamated products, and commutator calculus receive detailed treatment. The concluding chapter surveys word, conjugacy, and related problems; adjunction...

Statistical Field Theory: An Introduction to Exactly Solved Models in Statistical Physics (Oxford Graduate Texts)

Oxford University Press, 2009

This book provides a thorough introduction to the fascinating world of phase transitions as well as many related topics, including random walks, combinatorial problems, quantum field theory and S-matrix. Fundamental concepts of phase transitions, such as order parameters, spontaneous symmetry breaking, scaling transformations, conformal...

Understanding Concurrent Systems (Texts in Computer Science)

Springer, 2010

CSP notation has been used extensively for teaching and applying concurrency theory, ever since the publication of the text Communicating Sequential Processes by C.A.R. Hoare in 1985. Both a programming language and a specification language, the theory of CSP helps users to understand concurrent systems, and to decide whether a program meets...

Effective Computational Geometry for Curves and Surfaces (Mathematics and Visualization)

Springer, 2006

This book covers combinatorial data structures and algorithms, algebraic issues in geometric computing, approximation of curves and surfaces, and computational topology. Each chapter fully details and provides a tutorial introduction to important concepts and results. The focus is on methods which are both well founded mathematically and...

Pearls of Functional Algorithm Design

Cambridge University Press, 2010

Richard Bird takes a radically new approach to algorithm design, namely, design by calculation. These 30 short chapters each deal with a particular programming problem drawn from sources as diverse as games and puzzles, intriguing combinatorial tasks, and more familiar areas such as data compression and string matching. Each pearl starts with...

Matrices and Matroids for Systems Analysis (Algorithms and Combinatorics)

Springer, 2009

A matroid is an abstract mathematical structure that captures combinatorial properties of matrices. This book offers a unique introduction to matroid theory, emphasizing motivations from matrix theory and applications to systems analysis.
This book serves also as a comprehensive presentation of the theory and application of mixed...

Geometric Problems on Maxima and Minima

Birkhauser, 2005

Questions of maxima and minima have great practical significance, with applications to physics, engineering, and economics; they have also given rise to theoretical advances, notably in calculus and optimization. Indeed, while most texts view the study of extrema within the context of calculus, this carefully constructed problem book takes a...

The Theory of Matrices in Numerical Analysis

Dover Publications, 1975

This book represents an effort to select and present certain aspects of the theory of matrices that are most useful in developing and appraising computational methods for solving systems of linear equations (including the inversion of matrices) and for finding characteristic roots. The solution of linear inequalities and the problems of linear...

Discrete Mathematics and its Applications

McGraw-Hill, 2002

Discrete Mathematics and its Applications is a focused introduction to the primary themes in a discrete mathematics course, as introduced through extensive applications, expansive discussion, and detailed exercise sets. These themes include mathematical reasoning, combinatorial analysis, discrete structures, algorithmic thinking, and enhanced...

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