Skip to main content
Elsevier

Books in Analysis of algorithms and problem complexity

  • Analytical and Computational Modeling of Complex Systems

    A Systematic Approach to Understanding Real-World Complexity
    • 1st Edition
    • Florentin Paladi + 3 more
    • English
    Analytical and Computational Modeling of Complex Systems: A Systematic Approach to Understanding Real-World Complexity presents modern studies of complex systems by methods of statistical physics, numerical calculation, and computer modeling. Using general methods of investigating the branching (bifurcations) of solutions for nonlinear equations, the authors present an exhaustive analysis of the order parameter dependences on the control parameter in a small vicinity of the equilibrium values of parameters, including the stability analysis of the equilibrium states, and the asymptotic behavior of the order parameter dependences on the control parameter (bifurcation diagrams). The authors also present concepts and techniques used to model heterogeneous multi-agent interactions, complex neural networks, biochemical reaction networks in cells, and the dynamic behavior of economic systems over time. The book serves as both a learning resource and a practical reference for those engaged in the study of complex systems and their diverse real-world implementations. The book also offers a systematic learning path from theory to applications. It provides case studies that bridge the gap between mathematical formalism and complex systems modeling and simulation. Emphasizing hybrid and probabilistic modeling techniques, the book ensures greater flexibility for real-world applications. Covering a broad range of topics, it supports interdisciplinary use across departments such as physics, computer science, engineering, economics, and more.

  • Digital Transformation and Equitable Global Health

    A Future-Ready Perspective
    • 1st Edition
    • Arletty Pinel + 2 more
    • English
    Digital Transformation and Equitable Global Health: A Future-Ready Perspective presents a collective body of knowledge and global experiences that demonstrate current status and future trends in the use of exponential technologies and their potential for poverty reduction, improving health outcomes, strengthening health systems, and transforming traditional development aid structures. The book uses a translational innovation perspective to guide the reader—regardless of their area of expertise—on the rationale behind the co-creation of human-centered, affordable, and sustainable digital solutions.It addresses the interest of professionals from multiple areas (e.g., technology, health, social development, global financing), and it is a valuable resource for professionals, social scientists, practitioners, researchers, instructors, and undergraduate and graduate students interested in understanding the challenges and complexities of global public health and the applied uses of health technologies for equitable access to primary health care and universal health coverage.

  • Decision-Making Models

    A Perspective of Fuzzy Logic and Machine Learning
    • 1st Edition
    • Tofigh Allahviranloo + 2 more
    • English
    Decision Making Models: A Perspective of Fuzzy Logic and Machine Learning presents the latest developments in the field of uncertain mathematics and decision science. The book aims to deliver a systematic exposure to soft computing techniques in fuzzy mathematics as well as artificial intelligence in the context of real-life problems and is designed to address recent techniques to solving uncertain problems encountered specifically in decision sciences. Researchers, professors, software engineers, and graduate students working in the fields of applied mathematics, software engineering, and artificial intelligence will find this book useful to acquire a solid foundation in fuzzy logic and fuzzy systems.Other areas of note include optimization problems and artificial intelligence practices, as well as how to analyze IoT solutions with applications and develop decision-making mechanisms realized under uncertainty.

  • Recent Trends in Swarm Intelligence Enabled Research for Engineering Applications

    • 1st Edition
    • Siddhartha Bhattacharyya + 3 more
    • English
    Recent Trends in Swarm Intelligence Enabled Research for Engineering Applications focuses on recent, up-to-date technologies, combining other intelligent tools with swarm intelligence techniques to yield robust and failsafe solutions to real world problems. This book aims to provide audiences with a platform to learn and gain insights into the latest developments in hybrid swarm intelligence. It will be useful to researchers, engineers, developers, practitioners, and graduate students working in the major and interdisciplinary areas of computational intelligence, communication systems, computer networks, and soft computing.With the advent of data-intensive applications, the elimination of redundancy in disseminated information has become a serious challenge for researchers who are on the lookout for evolving metaheuristic algorithms which can explore and exploit the information feature space to derive the optimal settings for specific applications. Swarm intelligence algorithms have developed as one of the most widely used metaheuristic techniques for addressing this challenge in an effective way. Inspired by the behavior of a swarm of bees, these swarm intelligence techniques emulate the corresponding natural instincts to derive optimal solutions for data-intensive applications.

  • Federated Learning for Digital Healthcare Systems

    • 1st Edition
    • Agbotiname Lucky Imoize + 2 more
    • English
    Federated Learning for Digital Healthcare Systems critically examines the key factors that contribute to the problem of applying machine learning in healthcare systems and investigates how federated learning can be employed to address the problem. The book discusses, examines, and compares the applications of federated learning solutions in emerging digital healthcare systems, providing a critical look in terms of the required resources, computational complexity, and system performance.In the first section, chapters examine how to address critical security and privacy concerns and how to revamp existing machine learning models. In subsequent chapters, the book's authors review recent advances to tackle emerging efficient and lightweight algorithms and protocols to reduce computational overheads and communication costs in wireless healthcare systems. Consideration is also given to government and economic regulations as well as legal considerations when federated learning is applied to digital healthcare systems.

  • Advances in Domain Adaptation Theory

    • 1st Edition
    • Ievgen Redko + 4 more
    • English
    Advances in Domain Adaptation Theory gives current, state-of-the-art results on transfer learning, with a particular focus placed on domain adaptation from a theoretical point-of-view. The book begins with a brief overview of the most popular concepts used to provide generalization guarantees, including sections on Vapnik-Chervonenkis (VC), Rademacher, PAC-Bayesian, Robustness and Stability based bounds. In addition, the book explains domain adaptation problem and describes the four major families of theoretical results that exist in the literature, including the Divergence based bounds. Next, PAC-Bayesian bounds are discussed, including the original PAC-Bayesian bounds for domain adaptation and their updated version. Additional sections present generalization guarantees based on the robustness and stability properties of the learning algorithm.

  • Development of Online Hybrid Testing

    Theory and Applications to Structural Engineering
    • 1st Edition
    • Peng Pan + 2 more
    • English
    Development of Online Hybrid Testing: Theory and Applications to Structural Engineering provides comprehensive treatments of several topics pertinent to substructure online hybrid tests. Emphasis has been placed on explaining the three frameworks: the host-station framework, separated model framework and peer to peer framework These have been developed within the Internet environment and are particularly suitable for distributed hybrid testing. In order to help readers to understand the essence of online hybrid testing and further to build up their own systems, an engineering practice has been introduced at the end of this book with the source code appended. Development of Online Hybrid Testing: Theory and Applications to Structural Engineering is primarily written for readers with some background in structural dynamics, finite elements, and computer science. Material that has previously only appeared in journal articles has been consolidated and simplified which provides the reader with a perspective of the state-of-the-art.

  • Constraints, Language and Computation

    • 1st Edition
    • M. A. Rosner + 2 more
    • English
    Constraint-based linguistics is intersected by three fields: logic, linguistics, and computer sciences. The central theme that ties these different disciplines together is the notion of a linguistic formalism or metalanguage. This metalanguage has good mathematical properties, is designed to express descriptions of language, and has a semantics that can be implemented on a computer. Constraints, Language and Computation discusses the theory and practice of constraint-based computational linguistics. The book captures both the maturity of the field and some of its more interesting future prospects during a particulary important moment of development in this field.

  • Parallel Algorithms for Numerical Linear Algebra

    • 1st Edition
    • Volume 1
    • H. van der Vorst + 1 more
    • English
    This is the first in a new series of books presenting research results and developments concerning the theory and applications of parallel computers, including vector, pipeline, array, fifth/future generation computers, and neural computers.All aspects of high-speed computing fall within the scope of the series, e.g. algorithm design, applications, software engineering, networking, taxonomy, models and architectural trends, performance, peripheral devices.Papers in Volume One cover the main streams of parallel linear algebra: systolic array algorithms, message-passing systems, algorithms for parallel shared-memory systems, and the design of fast algorithms and implementations for vector supercomputers.

  • Parallel Processing for Artificial Intelligence 2

    • 1st Edition
    • Volume 15
    • V. Kumar + 2 more
    • English
    With the increasing availability of parallel machines and the raising of interest in large scale and real world applications, research on parallel processing for Artificial Intelligence (AI) is gaining greater importance in the computer science environment. Many applications have been implemented and delivered but the field is still considered to be in its infancy.This book assembles diverse aspects of research in the area, providing an overview of the current state of technology. It also aims to promote further growth across the discipline. Contributions have been grouped according to their subject: architectures (3 papers), languages (4 papers), general algorithms (6 papers), and applications (5 papers). The internationally sourced papers range from purely theoretical work, simulation studies, algorithm and architecture proposals, to implemented systems and their experimental evaluation.Since the book is a second volume in the parallel processing for AI series, it provides a continued documentation of the research and advances made in the field. The editors hope that it will inspire readers to investigate the possiblities for enhancing AI systems by parallel processing and to make new discoveries of their own!

  • Flow Networks

    Analysis and Optimization of Repairable Flow Networks, Networks with Disturbed Flows, Static Flow Networks and Reliability Networks
    • 1st Edition
    • Michael T. Todinov
    • English
    Repairable flow networks are a new area of research, which analyzes the repair and flow disruption caused by failures of components in static flow networks. This book addresses a gap in current network research by developing the theory, algorithms and applications related to repairable flow networks and networks with disturbed flows. The theoretical results presented in the book lay the foundations of a new generation of ultra-fast algorithms for optimizing the flow in networks after failures or congestion, and the high computational speed creates the powerful possibility of optimal control of very large and complex networks in real time. Furthermore, the possibility for re-optimizing the network flows in real time increases significantly the yield from real production networks and reduces to a minimum the flow disruption caused by failures. The potential application of repairable flow networks reaches across many large and complex systems, including active power networks, telecommunication networks, oil and gas production networks, transportation networks, water supply networks, emergency evacuation networks, and supply networks. The book reveals a fundamental flaw in classical algorithms for maximising the throughput flow in networks, published since the creation of the theory of flow networks in 1956. Despite the years of intensive research, the classical algorithms for maximising the throughput flow leave highly undesirable directed loops of flow in the optimised networks. These flow loops are associated with wastage of energy and resources and increased levels of congestion in the optimised networks.

  • Synchronous Precharge Logic

    • 1st Edition
    • Marek Smoszna
    • English
    Precharge logic is used by a variety of industries in applications where processor speed is the primary goal, such as VLSI (very large systems integration) applications. Also called dynamic logic, this type of design uses a clock to synchronize instructions in circuits. This comprehensive book covers the challenges faced by designers when using this logic style, including logic basics, timing, noise considerations, alternative topologies and more. In addition advanced topics such as skew tolerant design are covered in some detail. Overall this is a comprehensive view of precharge logic, which should be useful to graduate students and designers in the field alike. It might also be considered as a supplemental title for courses covering VLSI.

  • Computational Theory of Iterative Methods

    • 1st Edition
    • Volume 15
    • Ioannis Argyros
    • English
    The book is designed for researchers, students and practitioners interested in using fast and efficient iterative methods to approximate solutions of nonlinear equations. The following four major problems are addressed. Problem 1: Show that the iterates are well defined. Problem 2: concerns the convergence of the sequences generated by a process and the question of whether the limit points are, in fact solutions of the equation. Problem 3: concerns the economy of the entire operations. Problem 4: concerns with how to best choose a method, algorithm or software program to solve a specific type of problem and its description of when a given algorithm succeeds or fails. The book contains applications in several areas of applied sciences including mathematical programming and mathematical economics. There is also a huge number of exercises complementing the theory.

  • Computational Complexity: A Quantitative Perspective

    • 1st Edition
    • Volume 196
    • Marius Zimand
    • English
    There has been a common perception that computational complexity is a theory of "bad news" because its most typical results assert that various real-world and innocent-looking tasks are infeasible. In fact, "bad news" is a relative term, and, indeed, in some situations (e.g., in cryptography), we want an adversary to not be able to perform a certain task. However, a "bad news" result does not automatically become useful in such a scenario. For this to happen, its hardness features have to be quantitatively evaluated and shown to manifest extensively.The book undertakes a quantitative analysis of some of the major results in complexity that regard either classes of problems or individual concrete problems. The size of some important classes are studied using resource-bounded topological and measure-theoretical tools. In the case of individual problems, the book studies relevant quantitative attributes such as approximation properties or the number of hard inputs at each length.One chapter is dedicated to abstract complexity theory, an older field which, however, deserves attention because it lays out the foundations of complexity. The other chapters, on the other hand, focus on recent and important developments in complexity. The book presents in a fairly detailed manner concepts that have been at the centre of the main research lines in complexity in the last decade or so, such as: average-complexity, quantum computation, hardness amplification, resource-bounded measure, the relation between one-way functions and pseudo-random generators, the relation between hard predicates and pseudo-random generators, extractors, derandomization of bounded-error probabilistic algorithms, probabilistically checkable proofs, non-approximability of optimization problems, and others.The book should appeal to graduate computer science students, and to researchers who have an interest in computer science theory and need a good understanding of computational complexity, e.g., researchers in algorithms, AI, logic, and other disciplines.

  • Resolving Conflicts with Mathematica

    Algorithms for Two-Person Games
    • 1st Edition
    • Morton John Canty
    • English
    The revised and updated edition of this popular German textbook is unique in its emphasis on algorithmic methods and in its original use of Mathematica as a tool to obtain solutions to game-theoretical models.Resolving Conflicts with Mathematica begins with the basic theory of extensive and normal form games, as well as introducing the fundamental concept of Nash equilibria. The restriction to two-person games helps to make the material more digestible for the beginner. In later chapters the subtleties of degenerate games are discussed thoroughly. Many aspects of equilibrium selection theory are treated, including algorithms for determining evolutionary stable equilibria in biology. Finally, the book looks at the wide-scale application of game theory to practical conflict situations.Resolving Conflicts with Mathematica includes a set of Mathematica programs which implement all of the algorithms described in the text. Exercises are closely integrated with the book's material and Mathematica 'notebooks' are supplied with each of the chapters.

  • Art and Complexity

    • 1st Edition
    • J. Casti + 1 more
    • English
    This title is the result of a one-week workshop sponsored by the Swedish research agency, FRN, on the interface between complexity and art. Among others, it includes discussions on whether "good" art is "complex" art, how artists see the term "complex", and what poets try to convey in word about complex behavior in nature.

  • Mathematical Logic

    • 1st Edition
    • Volume 4
    • R.O. Gandy + 1 more
    • English
    Mathematical Logic is a collection of the works of one of the leading figures in 20th-century science. This collection of A.M. Turing's works is intended to include all his mature scientific writing, including a substantial quantity of unpublished material. His work in pure mathematics and mathematical logic extended considerably further; the work of his last years, on morphogenesis in plants, is also of the greatest originality and of permanent importance. This book is divided into three parts. The first part focuses on computability and ordinal logics and covers Turing's work between 1937 and 1938. The second part covers type theory; it provides a general introduction to Turing's work on type theory and covers his published and unpublished works between 1941 and 1948. Finally, the third part focuses on enigmas, mysteries, and loose ends. This concluding section of the book discusses Turing's Treatise on the Enigma, with excerpts from the Enigma Paper. It also delves into Turing's papers on programming and on minimum cost sequential analysis, featuring an excerpt from the unpublished manuscript. This book will be of interest to mathematicians, logicians, and computer scientists.

  • Handbook of Computability Theory

    • 1st Edition
    • Volume 140
    • E.R. Griffor
    • English
    The chapters of this volume all have their own level of presentation. The topics have been chosen based on the active research interest associated with them. Since the interest in some topics is older than that in others, some presentations contain fundamental definitions and basic results while others relate very little of the elementary theory behind them and aim directly toward an exposition of advanced results. Presentations of the latter sort are in some cases restricted to a short survey of recent results (due to the complexity of the methods and proofs themselves). Hence the variation in level of presentation from chapter to chapter only reflects the conceptual situation itself. One example of this is the collective efforts to develop an acceptable theory of computation on the real numbers. The last two decades has seen at least two new definitions of effective operations on the real numbers.

  • Compression Algorithms for Real Programmers

    • 1st Edition
    • Peter Wayner
    • English
    In life, time is money, and on the Internet, the size of data is money. Small programs and small files take less disk space and cost less to send over the Internet. Compression Algorithms for Real Programmers describes the basic algorithms and approaches for compressing information so you can create the smallest files possible. These new algorithms are making it possible for people to take impossibly large audio and video files and compress them enough that they can flow over the Internet.

  • Recursive Model Theory

    • 1st Edition
    • Volume 1
    • English

  • Recursive Algebra, Analysis and Combinatorics

    • 1st Edition
    • Volume 2
    • English

  • Tree Automata and Languages

    • 1st Edition
    • Volume 10
    • M. Nivat + 1 more
    • English
    The theory of tree languages, founded in the late Sixties and still active in the Seventies, was much less active during the Eighties. Now there is a simultaneous revival in several countries, with a number of significant results proved in the past five years. A large proportion of them appear in the present volume.The editors of this volume suggested that the authors should write comprehensive half-survey papers. This collection is therefore useful for everyone interested in the theory of tree languages as it covers most of the recent questions which are not treated in the very few rather old standard books on the subject. Trees appear naturally in many chapters of computer science and each new property is likely to result in improvement of some computational solution of a real problem in handling logical formulae, data structures, programming languages on systems, algorithms etc. The point of view adopted here is to put emphasis on the properties themselves and their rigorous mathematical exposition rather than on the many possible applications.This volume is a useful source of concepts and methods which may be applied successfully in many situations: its philosophy is very close to the whole philosophy of the ESPRIT Basic Research Actions and to that of the European Association for Theoretical Computer Science.

  • Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity

    • 1st Edition
    • Volume 51
    • J. Nešetril + 1 more
    • English
    This volume in the Annals of Discrete Mathematics brings together contributions by renowned researchers in combinatorics, graphs and complexity. The conference on which this book is based was the fourth in a series which began in 1963, which was the first time specialists from East and West were able to come together. The 1990 meeting attracted 170 mathematicians and computer scientists from around the world, so this book represents an international, detailed view of recent research.

  • Mechanical Intelligence

    • 1st Edition
    • Volume 1
    • D.C. Ince
    • English
    The collected works of Turing, including a substantial amount of unpublished material, will comprise four volumes: Mechanical Intelligence, Pure Mathematics, Morphogenesis and Mathematical Logic. Alan Mathison Turing (1912-1954) was a brilliant man who made major contributions in several areas of science. Today his name is mentioned frequently in philosophical discussions about the nature of Artificial Intelligence. Actually, he was a pioneer researcher in computer architecture and software engineering; his work in pure mathematics and mathematical logic extended considerably further and his last work, on morphogenesis in plants, is also acknowledged as being of the greatest originality and of permanent importance. He was one of the leading figures in Twentieth-century science, a fact which would have been known to the general public sooner but for the British Official Secrets Act, which prevented discussion of his wartime work. What is maybe surprising about these papers is that although they were written decades ago, they address major issues which concern researchers today.

  • Self-Modifying Systems in Biology and Cognitive Science

    A New Framework for Dynamics, Information and Complexity
    • 1st Edition
    • Volume 6
    • G. Kampis
    • English
    The theme of this book is the self-generation of information by the self-modification of systems. The author explains why biological and cognitive processes exhibit identity changes in the mathematical and logical sense. This concept is the basis of a new organizational principle which utilizes shifts of the internal semantic relations in systems. There are mathematical discussions of various classes of systems (Turing machines, input-output systems, synergetic systems, non-linear dynamics etc), which are contrasted with the author's new principle. The most important implications of this include a new conception on the nature of information and which also provides a new and coherent conceptual view of a wide class of natural systems. This book merits the attention of all philosophers and scientists concerned with the way we create reality in our mathematical representations of the world and the connection those representations have with the way things really are.

  • Planar Graphs

    Theory and Algorithms
    • 1st Edition
    • Volume 32
    • T. Nishizeki + 1 more
    • English
    Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two chapters provide the foundations of graph theoretic notions and algorithmic techniques. The remaining chapters discuss the topics of planarity testing, embedding, drawing, vertex- or edge-coloring, maximum independence set, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- or multicommodity flows. Suitable for a course on algorithms, graph theory, or planar graphs, the volume will also be useful for computer scientists and graph theorists at the research level. An extensive reference section is included.