Home | Amazing | Today | Tags | Publishers | Years | Account | Search 
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...

A Java Library of Graph Algorithms and Optimization (Discrete Mathematics and Its Applications)
A Java Library of Graph Algorithms and Optimization (Discrete Mathematics and Its Applications)
Because of its portability and platform-independence, Java is the ideal computer programming language to use when working on graph algorithms and other mathematical programming problems. Collecting some of the most popular graph algorithms and optimization procedures, A Java Library of Graph Algorithms and Optimization provides the source code for...
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...

Challenging Mathematical Problems With Elementary Solutions, Vol. 1
Challenging Mathematical Problems With Elementary Solutions, Vol. 1
Over 170 challenging problems ranging from the relatively simple to the extremely difficult. Volume 1 contains 100 problems on probability theory and combinatorial analysis.

This book is the first of a two-volume translation and adaptation of a well-known Russian problem book entitled Non-Elementary Problems in an...

WALCOM: Algorithms and Computation: Second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008, Proceedings (Lecture Notes in Computer Science)
WALCOM: Algorithms and Computation: Second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008, Proceedings (Lecture Notes in Computer Science)

This book constitutes the refereed proceedings of the Second International Workshop on Algorithms and Computation, WALCOM 2008, held in Dhaka, Bangladesh, in February 2008.

The 19 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 57 submissions. The papers feature...

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

Computer Design and Architecture Revised and Expanded
Computer Design and Architecture Revised and Expanded
This unique and proven text provides a hands-on introduction to the design of a computer system-depicting, step by step, the arrangement of a simple but complete hypothetical computer followed by detailed architectural features of existing computer systems as enhancements to the structure of the simple computer. Changes in the Third Edition of...
Combinatorial Group Theory: Presentations of Groups in Terms of Generators and Relations
Combinatorial Group Theory: Presentations of Groups in Terms of Generators and Relations
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...
Steiner Tree Problems In Computer Communication Networks
Steiner Tree Problems In Computer Communication Networks
The Steiner tree problem is one of the most important combinatorial optimization problems. It has a long history that can be traced back to the famous mathematician Fermat (1601 1665). This book studies three significant breakthroughs on the Steiner tree problem that were achieved in the 1990s, and some important applications of Steiner tree...
Algorithmic Game Theory
Algorithmic Game Theory
In the last few years game theory has had a substantial impact on computer science, especially on Internet- and e-commerce-related issues. More than 40 of the top researchers in this field have written chapters that go from the foundations to the state of the art. Basic chapters on algorithmic methods for equilibria, mechanism design and...
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...

Recent Advances in Algorithms and Combinatorics
Recent Advances in Algorithms and Combinatorics
From the reviews:

"Combinatorics is one of the fastest growing fields of mathematics. … From the table of contents one can see the wide range of topics covered. The authors are acknowledged researchers of the presented fields and guarantee the high quality of the volume. If you want to be up-to-date in combinatorics you should...

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