Download or read book Imprecise and Approximate Computation written by Swaminathan Natarajan and published by Springer. This book was released on 2007-08-26 with total page 193 pages. Available in PDF, EPUB and Kindle. Book excerpt: Real-time systems are now used in a wide variety of applications. Conventionally, they were configured at design to perform a given set of tasks and could not readily adapt to dynamic situations. The concept of imprecise and approximate computation has emerged as a promising approach to providing scheduling flexibility and enhanced dependability in dynamic real-time systems. The concept can be utilized in a wide variety of applications, including signal processing, machine vision, databases, networking, etc. For those who wish to build dynamic real-time systems which must deal safely with resource unavailability while continuing to operate, leading to situations where computations may not be carried through to completion, the techniques of imprecise and approximate computation facilitate the generation of partial results that may enable the system to operate safely and avert catastrophe. Audience: Of special interest to researchers. May be used as a supplementary text in courses on real-time systems.
Download or read book Proceedings of IEEE Workshop on Imprecise and Approximate Computation December 1 1992 Phoenix Arizona written by and published by . This book was released on 1992* with total page 114 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Proceedings of IEEE Workshop on Imprecise and Approximate Computation Held in Phoenix Arizona on December 1 1992 written by TEXAS ENGINEERING EXPERIMENT STATION COLLEGE STATION. and published by . This book was released on 1992 with total page 20 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Approximation Algorithms for Combinatorial Optimization written by Klaus Jansen and published by Springer. This book was released on 2003-07-31 with total page 290 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2000, held in Saarbrcken, Germany in September 2000. The 22 revised full papers presented together with four invited contributions were carefully reviewed and selected from 68 submissions. The topics dealt with include design and analysis of approximation algorithms, inapproximibility results, on-line problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and various applications.
Download or read book Foundations of Real Time Computing Scheduling and Resource Management written by André M. van Tilborg and published by Springer Science & Business Media. This book was released on 1991-07-31 with total page 346 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume contains a selection of papers that focus on the state-of the-art in real-time scheduling and resource management. Preliminary versions of these papers were presented at a workshop on the foundations of real-time computing sponsored by the Office of Naval Research in October, 1990 in Washington, D.C. A companion volume by the title Foundations of Real-Time Computing: Fonnal Specifications and Methods complements this book by addressing many of the most advanced approaches currently being investigated in the arena of formal specification and verification of real-time systems. Together, these two texts provide a comprehensive snapshot of current insights into the process of designing and building real-time computing systems on a scientific basis. Many of the papers in this book take care to define the notion of real-time system precisely, because it is often easy to misunderstand what is meant by that term. Different communities of researchers variously use the term real-time to refer to either very fast computing, or immediate on-line data acquisition, or deadline-driven computing. This text is concerned with the very difficult problems of scheduling tasks and resource management in computer systems whose performance is inextricably fused with the achievement of deadlines. Such systems have been enabled for a rapidly increasing set of diverse end-uses by the unremitting advances in computing power per constant-dollar cost and per constant-unit-volume of space. End-use applications of deadline-driven real-time computers span a spectrum that includes transportation systems, robotics and manufacturing, aerospace and defense, industrial process control, and telecommunications.
Download or read book From Variability Tolerance to Approximate Computing in Parallel Integrated Architectures and Accelerators written by Abbas Rahimi and published by Springer. This book was released on 2017-04-23 with total page 204 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book focuses on computing devices and their design at various levels to combat variability. The authors provide a review of key concepts with particular emphasis on timing errors caused by various variability sources. They discuss methods to predict and prevent, detect and correct, and finally conditions under which such errors can be accepted; they also consider their implications on cost, performance and quality. Coverage includes a comparative evaluation of methods for deployment across various layers of the system from circuits, architecture, to application software. These can be combined in various ways to achieve specific goals related to observability and controllability of the variability effects, providing means to achieve cross layer or hybrid resilience.
Download or read book Approximate Computation of Expectations written by Charles Stein and published by IMS. This book was released on 1986 with total page 172 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Foundations of Dependable Computing written by Gary M. Koob and published by Springer Science & Business Media. This book was released on 2007-11-23 with total page 224 pages. Available in PDF, EPUB and Kindle. Book excerpt: Foundations of Dependable Computing: Paradigms for Dependable Applications, presents a variety of specific approaches to achieving dependability at the application level. Driven by the higher level fault models of Models and Frameworks for Dependable Systems, and built on the lower level abstractions implemented in a third companion book subtitled System Implementation, these approaches demonstrate how dependability may be tuned to the requirements of an application, the fault environment, and the characteristics of the target platform. Three classes of paradigms are considered: protocol-based paradigms for distributed applications, algorithm-based paradigms for parallel applications, and approaches to exploiting application semantics in embedded real-time control systems. The companion volume subtitled Models and Frameworks for Dependable Systems presents two comprehensive frameworks for reasoning about system dependability, thereby establishing a context for understanding the roles played by specific approaches presented in this book's two companion volumes. It then explores the range of models and analysis methods necessary to design, validate and analyze dependable systems. Another companion book (published by Kluwer) subtitled System Implementation, explores the system infrastructure needed to support the various paradigms of Paradigms for Dependable Applications. Approaches to implementing support mechanisms and to incorporating additional appropriate levels of fault detection and fault tolerance at the processor, network, and operating system level are presented. A primary concern at these levels is balancing cost and performance against coverage and overall dependability. As these chapters demonstrate, low overhead, practical solutions are attainable and not necessarily incompatible with performance considerations. The section on innovative compiler support, in particular, demonstrates how the benefits of application specificity may be obtained while reducing hardware cost and run-time overhead.
Download or read book Approximate Computing written by Weiqiang Liu and published by Springer Nature. This book was released on 2022-08-22 with total page 607 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book explores the technological developments at various levels of abstraction, of the new paradigm of approximate computing. The authors describe in a single-source the state-of-the-art, covering the entire spectrum of research activities in approximate computing, bridging device, circuit, architecture, and system levels. Content includes tutorials, reviews and surveys of current theoretical/experimental results, design methodologies and applications developed in approximate computing for a wide scope of readership and specialists. Serves as a single-source reference to state-of-the-art of approximate computing; Covers broad range of topics, from circuits to applications; Includes contributions by leading researchers, from academia and industry.
Download or read book Approximation and Online Algorithms written by Christos Kaklamanis and published by Springer Science & Business Media. This book was released on 2008-02-11 with total page 297 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the thoroughly refereed post workshop proceedings of the 5th International Workshop on Approximation and Online Algorithms, WAOA 2007, held in Eilat, Israel, in October 2007 as part of the ALGO 2007 conference event. The 22 revised full papers presented were carefully reviewed and selected from 56 submissions. The workshop covered areas such as algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real-world applications, and scheduling problems.
Download or read book Principles of Imprecise Information Processing written by Shiyou Lian and published by Springer. This book was released on 2016-07-02 with total page 649 pages. Available in PDF, EPUB and Kindle. Book excerpt: The book showcases cutting-edge concepts and methods, and presents the principle of imprecise-information processing. It also proposes a new theory and technology for imprecise-information processing that differs from fuzzy technology, thus providing a platform for related applications and laying the theoretical basis for further research. Imprecise-information processing – a type of processing based on flexible linguistic values and quantifiable rigid linguistic values – is an important component of intelligence science and technology. This book offers an easy-to-understand overview of the basic principles and methods of imprecise-information processing, allowing readers to develop related applications or pursue further research.
Download or read book Fuzzy Sets in Approximate Reasoning and Information Systems written by J.C. Bezdek and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 527 pages. Available in PDF, EPUB and Kindle. Book excerpt: Approximate reasoning is a key motivation in fuzzy sets and possibility theory. This volume provides a coherent view of this field, and its impact on database research and information retrieval. First, the semantic foundations of approximate reasoning are presented. Special emphasis is given to the representation of fuzzy rules and specialized types of approximate reasoning. Then syntactic aspects of approximate reasoning are surveyed and the algebraic underpinnings of fuzzy consequence relations are presented and explained. The second part of the book is devoted to inductive and neuro-fuzzy methods for learning fuzzy rules. It also contains new material on the application of possibility theory to data fusion. The last part of the book surveys the growing literature on fuzzy information systems. Each chapter contains extensive bibliographical material. Fuzzy Sets in Approximate Reasoning and Information Systems is a major source of information for research scholars and graduate students in computer science and artificial intelligence, interested in human information processing.
Download or read book Algorithms and Computation written by Otfried Cheong and published by Springer. This book was released on 2010-12-06 with total page 488 pages. Available in PDF, EPUB and Kindle. Book excerpt: Annotation This book constitutes the refereed proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC 2010, held in Jeju, South Korea in December 2010.The 77 revised full papers presented were carefully reviewed and selected from 182 submissions for inclusion in the book. This volume contains topics such as approximation algorithm; complexity; data structure and algorithm; combinatorial optimization; graph algorithm; computational geometry; graph coloring; fixed parameter tractability; optimization; online algorithm; and scheduling.
Download or read book Rough Neural Computing written by Sankar Kumar Pal and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 741 pages. Available in PDF, EPUB and Kindle. Book excerpt: Soft computing comprises various paradigms dedicated to approximately solving real-world problems, e.g. in decision making, classification or learning; among these paradigms are fuzzy sets, rough sets, neural networks, genetic algorithms, and others. It is well understood now in the soft computing community that hybrid approaches combining various paradigms are very promising approaches for solving complex problems. Exploiting the potential and strength of both neural networks and rough sets, this book is devoted to rough-neuro computing which is also related to the novel aspect of computing based on information granulation, in particular to computing with words. It provides foundational and methodological issues as well as applications in various fields.
Download or read book Advances in Signal Processing and Communication Engineering written by Pradip Kumar Jain and published by Springer Nature. This book was released on 2022-12-01 with total page 515 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book comprises select proceedings of the International Conference on Advances in Signal Processing and Communication Engineering (ICASPACE 2021). The book covers several theoretical and mathematical approaches addressing day-to-day challenges in signal, image, and speech processing and advanced communication systems. It primarily focuses on effective mathematical methods, algorithms, and models that enhance the performance of existing systems. The topics covered in the book are advances in signal processing (radar and biomedical), image processing, speech processing, technical and environmental challenges in 5G technology, and strategies for optimal utilization of resources to improve the efficacy of the communication systems in terms of bandwidth and radiating power, etc. The works published in the book will remarkably be helpful to prospective scholars, academicians, and students seeking knowledge in signal processing and communication engineering.
Download or read book Algorithms for Scheduling Imprecise Computations written by Jane W. S. Liu and published by . This book was released on 1990 with total page 48 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Computing and Combinatorics written by Yixin Cao and published by Springer. This book was released on 2017-07-25 with total page 708 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 23rd International Conference on Computing and Combinatorics, COCOON 2017, held in Hiong Kong, China, in August 2017. The 56 full papers papers presented in this book were carefully reviewed and selected from 119 submissions. The papers cover various topics, including algorithms and data structures, complexity theory and computability, algorithmic game theory, computational learning theory, cryptography, computationalbiology, computational geometry and number theory, graph theory, and parallel and distributed computing.
