Algorithms and data structures Books

This book presents new optimization approaches and methods and their application in real-world and industrial problems. Numerous processes and problems in real life and industry can be represented as optimization problems, including modeling physical...

This book focuses on the development of approximation-related algorithms and their relevant applications. Individual contributions are written by leading experts and reflect emerging directions and connections in data approximation and optimization...

This book constitutes the refereed proceedings of the 10th International Conference on Evolutionary Multi-Criterion Optimization, EMO 2019 held in East Lansing, MI, USA, in March 2019.The 59 revised full papers were carefully reviewed and...

This book introduces the linkage between evolutionary computation and complex networks and the advantages of cross-fertilising ideas from both fields. Instead of introducing each field individually, the authors focus on the research that sits at the...

This book introduces the first programming language for which average-case time analysis of its programs is guaranteed to be modular. The main time measure currently used for real-time languages (worst-case time) is well-known not to be modular in...

This instructive book introduces the key ideas behind practical nonlinear optimization, accompanied by computational examples and supporting software. It combines computational finance with an important class of numerical techniques.

Bioinformatics is growing by leaps and bounds; theories/algorithms/statistical techniques are constantly evolving. Nevertheless, a core body of algorithmic ideas have emerged and researchers are beginning to adopt a "problem solving" approach to...

I felt deeply honored when Professor Sumit Ghosh asked me to write the foreword to his book with an extraordinary perspective. I have long admired him, ?rst as a student leader at Stanford, where he initiated the ?rst IEEE...

This book introduces resource-aware data fusion algorithms to gather and combine data from multiple sources (e.g., sensors) in order to achieve inferences. These techniques can be used in centralized and distributed systems to overcome sensor failure,...

An understanding of emergent computation requires a profound revision of the most fundamental ideas. A noticeable attempt of such a rethinking is a world view in which natural systems are seen not as separate entities but as...

These days, the nature of services and the volume of demand in the telecommu­ nication industry is changing radically, with the replacement of analog transmis­ sion and traditional copper cables by digital technology and fiber...

As genetic algorithms (GAs) become increasingly popular, they are applied to difficult problems that may require considerable computations. In such cases, parallel implementations of GAs become necessary to reach ...

The author wrote a monograph 20 years ago on the construction of spin eigen­ functions; the monograph was published by Plenum. The aim of that mono­ graph was to present all aspects connected with the construction of spin...

Parsing technology traditionally consists of two branches, which correspond to the two main application areas of context-free grammars and their generalizations. Efficient deterministic parsing algorithms have been developed...

"This book collects in one volume the author's considerable results in the area of the summation of series and their representation in closed form, and details the techniques by which they have been obtained... the calculations...

Since the volume may be of interest to a broad variety of people, it is arranged in parts that require different levels of mathematical background. Part I can be assessed by those interested in the application of visualization...

Overview and Goals This book is dedicated to scheduling for parallel processing. Presenting a research ?eld as broad as this one poses considerable dif?culties. Scheduling for parallel computing is an interdisciplinary subject joining many ?elds of...

This book presents the state of the art in parallel numerical algorithms, applications, architectures, and system software. The book examines various solutions for issues of concurrency, scale, energy efficiency, and programmability, which are discussed...

This book discusses the use of the real numbers in theorem proving. Typ­ ically, theorem provers only support a few 'discrete' datatypes such as the natural numbers. However the availability of the real numbers opens up many...

This essential companion to Chaitin's successful books The Unknowable and The Limits of Mathematics, presents the technical core of his theory of program-size complexity. The two previous volumes are more concerned with...

Following an introduction to the various techniques and examples of their routine application, this potential is explored through the introduction of various strategies that support searches across a far broader set of possible...

The cryptosystems based on the Integer Factorization Problem (IFP), the Discrete Logarithm Problem (DLP) and the Elliptic Curve Discrete Logarithm Problem (ECDLP) are essentially the only three types of practical public-key cryptosystems in use. The...

In this book the theory of hyperbolic sets is developed, both for diffeomorphisms and flows, with an emphasis on shadowing. We show that hyperbolic sets are expansive and have the shadowing property. Then we use shadowing to...

Speed improvements in memory systems have not kept pace with the speed improvements of processors, leading to embedded systems whose performance is limited by the memory. This book presents design techniques for fast,...

Appendices A Rotastore A. l Tabular Results for Different Models A. 2 Tabular Results for Different Algorithms B OptiTrans B. l Input Data B. l. l Input Data Common to all Solution Approaches B. 1. 2 Specific Input Data for the...

In the field of engineering, optimization and decision-making have become pivotal concerns. The ever-increasing demand for data processing has given rise to issues such as extended processing times and escalated memory utilization, posing formidable...

In today's data-driven era, the persistent gap between theoretical understanding and practical implementation in data science poses a formidable challenge. As we navigate through the complexities of harnessing data, deciphering algorithms, and unleashing...

This well-organized and thoroughly revised text independent of programming language provides the design techniques of algorithms in a simple and straightforward manner. It describes the complete design, development and analysis of various algorithms...

Fundamentals.- Foiling the Adversary.- Fingerprinting.- Success Amplification and Random Sampling.- Abundance of Witnesses.- Optimization and Random Rounding.

Discover easy-to-follow solutions and techniques to help you to implement applied mathematical concepts such as probability, calculus, and equations using Python's numeric and scientific librariesKey FeaturesCompute complex mathematical problems...

Full of practical examples, Introduction to Scheduling presents the basic concepts and methods, fundamental results, and recent developments of scheduling theory. With contributions from highly respected experts, it provides self-contained,...

An Easy-to-Use Research Tool for Algorithm Testing and DevelopmentBefore the SeqAn project, there was clearly a lack of available implementations in sequence analysis, even for standard tasks. Implementations of needed algorithmic components were either...

The first in an ongoing series designed to take readers from zero experience to writing their own video games and interactive digital experiences using industry standard languages and tools, this book is a great way to turn a love of video games into a...

The topic of dynamic models tends to be splintered across various disciplines, making it difficult to uniformly study the subject. Moreover, the models have a variety of representations, from traditional mathematical notations to diagrammatic and...

The discrete mathematics and theoretical computer science communities have recently witnessed explosive growth in the area of algorithmic combinatorics on words. The next generation of research on combinatorics of partial words promises to have a...

"Mastering UI/UX Design: Theoretical Foundations and Practical Applications" is a comprehensive guide for anyone looking to deepen their understanding of user interface (UI) and user experience (UX) design. This book delves into the core principles and...

"The Art of Code: Exploring the World of Programming Languages" is a captivating journey into the realm of computer programming, where logic and creativity intersect to bring technology to life. In this immersive and enlightening book, readers...

Learn to Build Rust Programs, Test Applications and Create Your Own Cargo Packages with latest Rust 1.77"Rust In Practice, Second Edition" is an updated book that builds on the previous edition's excellent foundation and is intended to help readers...

Can an algorithm be democratic? And how can we understand algorithms not only as technical, but also as social and political phenomena? Democratic Algorithms offers theoretically and empirically informed perspectives on how we can imagine and design...

Unlock Java's full potential for cloud computing through expert insights from real-world case studies and stay ahead with the latest trends in agile and robust Java application developmentKey Features:- Master concurrency and parallelism to overcome...