Books in Analysis of algorithms and problem complexity

11-20 of 37 results in All results

Advances in Domain Adaptation Theory

• 1st Edition
• August 14, 2019
• Ievgen Redko + 4 more
• English
• Hardback 978-1-78548-236-6

  9 7 8 - 1 - 7 8 5 4 8 - 2 3 6 - 6
• eBook 978-0-08-102347-1

  9 7 8 - 0 - 0 8 - 1 0 2 3 4 7 - 1

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.

Adaptive Mobile Computing

• 1st Edition
• August 14, 2017
• Mauro Migliardi + 2 more
• English
• Paperback 978-0-12-804603-6

  9 7 8 - 0 - 1 2 - 8 0 4 6 0 3 - 6
• eBook 978-0-12-804610-4

  9 7 8 - 0 - 1 2 - 8 0 4 6 1 0 - 4

Adaptive Mobile Computing: Advances in Processing Mobile Data Sets explores the latest advancements in producing, processing and securing mobile data sets. The book provides the elements needed to deepen understanding of this trend which, over the last decade, has seen exponential growth in the number and capabilities of mobile devices. The pervasiveness, sensing capabilities and computational power of mobile devices have turned them into a fundamental instrument in everyday life for a large part of the human population. This fact makes mobile devices an incredibly rich source of data about the dynamics of human behavior, a pervasive wireless sensors network with substantial computational power and an extremely appealing target for a new generation of threats.

Development of Online Hybrid Testing

• 1st Edition
• September 14, 2015
• Peng Pan + 2 more
• English
• eBook 978-0-12-803392-0

  9 7 8 - 0 - 1 2 - 8 0 3 3 9 2 - 0

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.

Parallel Processing for Artificial Intelligence 2

• 1st Edition
• Volume 15
• June 28, 2014
• V. Kumar + 2 more
• English
• eBook 978-1-4832-9575-6

  9 7 8 - 1 - 4 8 3 2 - 9 5 7 5 - 6

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!

Parallel Algorithms for Numerical Linear Algebra

• 1st Edition
• Volume 1
• June 28, 2014
• H. van der Vorst + 1 more
• English
• eBook 978-1-4832-9573-2

  9 7 8 - 1 - 4 8 3 2 - 9 5 7 3 - 2

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.

Flow Networks

• 1st Edition
• January 16, 2013
• Michael T. Todinov
• English
• eBook 978-0-12-398406-7

  9 7 8 - 0 - 1 2 - 3 9 8 4 0 6 - 7

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
• August 27, 2012
• Marek Smoszna
• English
• eBook 978-0-12-401707-8

  9 7 8 - 0 - 1 2 - 4 0 1 7 0 7 - 8

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
• September 4, 2007
• Ioannis Argyros
• English
• eBook 978-0-08-056070-0

  9 7 8 - 0 - 0 8 - 0 5 6 0 7 0 - 0

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.

Network Routing

• 1st Edition
• March 29, 2007
• English
• Hardback 978-0-12-088588-6

  9 7 8 - 0 - 1 2 - 0 8 8 5 8 8 - 6
• eBook 978-0-08-047497-7

  9 7 8 - 0 - 0 8 - 0 4 7 4 9 7 - 7

Network routing can be broadly categorized into Internet routing, PSTN routing, and telecommunication transport network routing. This book systematically considers these routing paradigms, as well as their interoperability. The authors discuss how algorithms, protocols, analysis, and operational deployment impact these approaches. A unique feature of the book is consideration of both macro-state and micro-state in routing; that is, how routing is accomplished at the level of networks and how routers or switches are designed to enable efficient routing.In reading this book, one will learn about 1) the evolution of network routing, 2) the role of IP and E.164 addressing in routing, 3) the impact on router and switching architectures and their design, 4) deployment of network routing protocols, 5) the role of traffic engineering in routing, and 6) lessons learned from implementation and operational experience. This book explores the strengths and weaknesses that should be considered during deployment of future routing schemes as well as actual implementation of these schemes. It allows the reader to understand how different routing strategies work and are employed and the connection between them. This is accomplished in part by the authors' use of numerous real-world examples to bring the material alive.

Stochastic Local Search

• 1st Edition
• September 16, 2004
• Holger H. Hoos + 1 more
• English
• Hardback 978-1-55860-872-6

  9 7 8 - 1 - 5 5 8 6 0 - 8 7 2 - 6
• eBook 978-0-08-049824-9

  9 7 8 - 0 - 0 8 - 0 4 9 8 2 4 - 9

Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for solving computationally difficult problems in many areas of computer science and operations research, including propositional satisfiability, constraint satisfaction, routing, and scheduling. SLS algorithms have also become increasingly popular for solving challenging combinatorial problems in many application areas, such as e-commerce and bioinformatics.Hoos and Stützle offer the first systematic and unified treatment of SLS algorithms. In this groundbreaking new book, they examine the general concepts and specific instances of SLS algorithms and carefully consider their development, analysis and application. The discussion focuses on the most successful SLS methods and explores their underlying principles, properties, and features. This book gives hands-on experience with some of the most widely used search techniques, and provides readers with the necessary understanding and skills to use this powerful tool.