Home | Amazing | Today | Tags | Publishers | Years | Search 
Geometric Problems on Maxima and Minima
Geometric Problems on Maxima and Minima
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...
Biocommunication and Natural Genome Editing
Biocommunication and Natural Genome Editing

This is the first uniform description of all key levels of communication in the organismic kingdoms of plants, fungi, animals and bacteria based on the most recent empirical data. Biocommunication occurs on three levels (A) intraorganismic, i.e. intra- and intercellular, (B) interorganismic, between the same or related species and (C)...

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

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

Matrices and Matroids for Systems Analysis (Algorithms and Combinatorics)
Matrices and Matroids for Systems Analysis (Algorithms and Combinatorics)

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

Pearls of Functional Algorithm Design
Pearls of Functional Algorithm Design

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

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

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

Understanding Concurrent Systems (Texts in Computer Science)
Understanding Concurrent Systems (Texts in Computer Science)

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

Encryption for Digital Content (Advances in Information Security)
Encryption for Digital Content (Advances in Information Security)

Encryption for Digital Content is an area in cryptography that is widely used in commercial productions (e.g., Blu-Ray and HD-DVDs). This book provides a comprehensive mathematical treatment of combinatorial encryption techniques used in digital content distribution systems and related attack models. A complete description of...

Computability and Complexity Theory (Texts in Computer Science)
Computability and Complexity Theory (Texts in Computer Science)

The theory of computing provides computer science with concepts, models, and formalisms for reasoning about both the resources needed to carry out computations and the efficiency of the computations that use these resources. It provides tools to measure the difficulty of combinatorial problems both absolutely and in comparison with other...

Handbook of Approximation Algorithms and Metaheuristics
Handbook of Approximation Algorithms and Metaheuristics

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical applications. It is the first book to comprehensively study both approximation algorithms and metaheuristics.

Starting with basic approaches, the
...

Algorithms Unplugged
Algorithms Unplugged

Algorithms specify the way computers process information and how they execute tasks. Many recent technological innovations and achievements rely on algorithmic ideas – they facilitate new applications in science, medicine, production, logistics, traffic, communi¬cation and entertainment. Efficient algorithms not only enable your...

Testing Complex and Embedded Systems
Testing Complex and Embedded Systems

Many enterprises regard system-level testing as the final piece of the development effort, rather than as a tool that should be integrated throughout the development process. As a consequence, test teams often execute critical test plans just before product launch, resulting in much of the corrective work being performed in a rush and at the...

Result Page: 13 12 11 10 9 8 7 6 5 4 3 2 1 
©2024 LearnIT (support@pdfchm.net) - Privacy Policy