Learn IT - Books tags computation

Matrix Algorithms, Volume I

SIAM, 1998

This book, Basic Decompositions, is the first volume in a projected five-volume series entitled Matrix Algorithms. The other four volumes will treat eigensystems, iterative methods for linear systems, sparse direct methods, and special topics, including fast algorithms for structured matrices.

My intended audience is the nonspecialist...

Embedded SoPC Design with Nios II Processor and Verilog Examples

John Wiley & Sons, 2012

Explores the unique hardware programmability of FPGA-basedembedded systems, using a learn-by-doing approach to introduce theconcepts and techniques for embedded SoPC design with Verilog

An SoPC (system on a programmable chip) integrates a processor,memory modules, I/O peripherals, and custom hardware acceleratorsinto a single FPGA...

Super-Recursive Algorithms (Monographs in Computer Science)

Springer, 2004

This book introduces the new realm of superrecursive algorithms and the development of mathematical models for them. Although many still believe that only recursive algorithms exist and that only some of them are realizable, there are many situations in which people actually work with superrecursive algorithms....

Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)

John Wiley & Sons, 2006

The latest edition of this classic is updated with new problem sets and material

The Second Edition of this fundamental textbook maintains the book's tradition of clear, thought-provoking instruction. Readers are provided once again with an instructive mix of mathematics, physics, statistics, and information theory.

All the...

Programming F# (Animal Guide)

O'Reilly, 2009

Why learn F#? This multi-paradigm language not only offers you an enormous productivity boost through functional programming, it also lets you develop applications using your existing object-oriented and imperative programming skills. With Programming F#, you'll quickly discover the many advantages of Microsoft's new language, which...

Handbook of Floating-Point Arithmetic

Birkhauser, 2009

Floating-point arithmetic is by far the most widely used way of implementing real-number arithmetic on modern computers. Although the basic principles of floating-point arithmetic can be explained in a short amount of time, making such an arithmetic reliable and portable, yet fast, is a very difficult task. From the 1960s to the early 1980s,...

Unified Modeling Language Reference Manual

Addison Wesley, 2004

“If you are a serious user of UML, there is no other book quite like this one. I have been involved with the UML specification process for some time, but I still found myself learning things while reading through this book—especially on the changes and new capabilities that have come with UML.”

...

Simulating Fuzzy Systems

Springer, 2005

Simulating Fuzzy Systems demonstrates how many systems naturally become fuzzy systems and shows how regular (crisp) simulation can be used to estimate the alpha-cuts of the fuzzy numbers used to analyze the behavior of the fuzzy system. This monograph presents a concise introduction to fuzzy sets, fuzzy logic, fuzzy estimation,...

Bond Graph Methodology: Development and Analysis of Multidisciplinary Dynamic System Models

Springer, 2010

Nowadays, engineering systems are becoming increasingly complex and, for design purposes, must be considered as multidisciplinary systems made up of components from different engineering disciplines. With regard to the systematic development and the analysis of models, interdisciplinary methodologies supported by software become more and more...

Theory of Automata, Formal Languages and Computation

New Age Publications, 2008

Presents an introduction to the basic models of computability to the undergraduate students. This book deals with Finite Automata and their properties. It provides a class of models and enables the analysis of context-free languages.

This book deals with a fascinating and important subject which has the fundamentals of computer...

Spatially Structured Evolutionary Algorithms: Artificial Evolution in Space and Time (Natural Computing Series)

Springer, 2005

Evolutionary algorithms (EAs) is now a mature problem-solving family of heuristics that has found its way into many important real-life problems and into leading-edge scientific research. Spatially structured EAs have different properties than standard, mixing EAs. By virtue of the structured disposition of the population members they bring about...

DNA Computing: 8th International Workshop on DNA Based Computers, DNA8, Sapporo, Japan, June 10-13, 2002, Revised Papers

Springer, 2003

Biomolecular computing has emerged as an interdisciplinary field that draws together chemistry, computer science, mathematics, molecular biology, and physics. Our knowledge on DNA nanotechnology and biomolecular computing increases exponentially with every passing year. The international meeting on DNA Based Computers has been a forum where...

Result Page: 34 33 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16