Learn IT - Books tags discrete

Computational Probability: Algorithms and Applications in the Mathematical Sciences (International Series in Operations Research & Management Science)

Springer, 2007

This title organizes computational probability methods into a systematic treatment. The book examines two categories of problems. "Algorithms for Continuous Random Variables" covers data structures and algorithms, transformations of random variables, and products of independent random variables. "Algorithms for...

Knapsack Problems: Algorithms and Computer Implementations (Wiley Series in Discrete Mathematics and Optimization)

John Wiley & Sons, 1990

Here is a state of art examination on exact and approximate algorithms for a number of important NP-hard problems in the field of integer linear programming, which the authors refer to as ``knapsack.'' Includes not only the classical knapsack problems such as binary, bounded, unbounded or binary multiple, but also less familiar problems...

Schaum's Outline of Signals and Systems

McGraw-Hill, 1995

This powerful study guide gives you 571 problems in signals and systems, fully solved step-by-step! From SchaumÕs, the original study guide, and studentsÕ favorite with over 30 million guides soldÑthis solution-packed timesaver helps you master every type of problem you will face on your tests, from simple questions on linear...

Design Sensitivity Analysis and Optimization of Electromagnetic Systems (Mathematical and Analytical Techniques with Applications to Engineering)

Springer, 2018

This book presents a comprehensive introduction to design sensitivity analysis theory as applied to electromagnetic systems. It treats the subject in a unified manner, providing numerical methods and design examples. The specific focus is on continuum design sensitivity analysis, which offers significant advantages over discrete...

Approximation Algorithms

Springer, 2010

Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results, and conveys the beauty and excitement of work in the field. He gives clear, lucid explanations of key results and ideas, with intuitive proofs, and provides critical examples and numerous...

Linear Algebra and Probability for Computer Science Applications

CRC Press, 2012

Based on the author’s course at NYU, Linear Algebra and Probability for Computer Science Applications gives an introduction to two mathematical fields that are fundamental in many areas of computer science. The course and the text are addressed to students with a very weak mathematical background. Most of the...

MATLAB Control Systems Engineering

Apress, 2014

MATLAB is a high-level language and environment for numerical computation, visualization, and programming. Using MATLAB, you can analyze data, develop algorithms, and create models and applications. The language, tools, and built-in math functions enable you to explore multiple approaches and reach a solution faster than with spreadsheets or...

Discrete Mathematics With Algorithms

John Wiley & Sons, 1988

This first-year course in discrete mathematics requires no calculus or computer programming experience. The approach stresses finding efficient algorithms, rather than existential results. Provides an introduction to constructing proofs (especially by induction), and an introduction to algorithmic problem-solving. All algorithms are presented in...

Probability: With Applications and R

John Wiley & Sons, 2013

An introduction to probability at the undergraduate level

Chance and randomness are encountered on a daily basis. Authored by a highly qualified professor in the field, Probability: With Applications and R delves into the theories and applications essential to obtaining a thorough understanding of probability.

...

Fourier Analysis on Finite Groups with Applications in Signal Processing and System Design

John Wiley & Sons, 2005

Discover applications of Fourier analysis on finite non-Abelian groups

The majority of publications in spectral techniques consider Fourier transform on Abelian groups. However, non-Abelian groups provide notable advantages in efficient implementations of spectral methods.

Fourier Analysis on Finite Groups with Applications in...

Mathematics of Discrete Structures for Computer Science

Springer, 2012

Mathematics plays a key role in computer science, some researchers would consider computers as nothing but the physical embodiment of mathematical systems. And whether you are designing a digital circuit, a computer program or a new programming language, you need mathematics to be able to reason about the design -- its correctness,...

Analysis and Synthesis for Discrete-Time Switched Systems: A Quasi-Time-Dependent Method (Studies in Systems, Decision and Control)

Springer, 2019

This book presents recent theoretical advances in the analysis and synthesis of discrete-time switched systems under the time-dependent switching scheme, including stability and disturbance attenuation performance analysis, control and filtering, asynchronous switching, finite-time analysis and synthesis, and reachable set...

Result Page: 36 35 34 33 32 31 30 29 28 27