تحسين النتائح
ترتيب حسب
من
الى
الصفحة 2
الصفحة 2
Computation Engineering : Applied Automata Theory and Logic
This book covers automata in depth, providing good intuitions along the way, and culminating with applications that are used every day in the field. In this respect, it is a departure from the conventional textbooks on complexity and computability, although these 'tradtional' aspects remain well represented.
Component-Based Software Development for Embedded Systems : An Overview of Current Research Trends
Embedded systems are ubiquitous. They appear in cell phones, microwave ovens, refrigerators, consumer electronics, cars, and jets. Some of these embedded s- tems are safety- or security-critical such as in medical equipment, nuclear plants, and X-by-wire control systems in naval, ground and aerospace transportation - hicles. With the continuing shift from hardware to software, embedded systems are increasingly dominated by embedded software. Embedded software is complex. Its engineering inherently involves a mul- disciplinary interplay with the physics of the embedding system or environment. Embedded software also comes in ever larger quantity and diversity. The next generation of premium automobiles will carry around one gigabyte of binary code. The proposed US DDX submarine is e?ectively a ?oating embedded so- ware system, comprising 30 billion lines of code written in over 100 programming languages. Embedded software is expensive. Cost estimates are quoted at around US$15– 30 per line (from commencement to shipping). In the defense realm, costs can range up to $100, while for highly critical applications, such as the Space Shuttle, the cost per line approximates $1,000. In view of the exponential increase in complexity, the projected costs of future embedded software are staggering.
Complexity Theory and Cryptology : An Introduction to Cryptocomplexity
Modern cryptology employs mathematically rigorous concepts and methods from complexity theory. Conversely, current research in complexity theory often is motivated by questions and problems arising in cryptology. This book takes account of this trend, and therefore its subject is what may be dubbed "cryptocomplexity,'' some sort of symbiosis of these two areas. This textbook is suitable for undergraduate and graduate students of computer science, mathematics, and engineering, and can be used for courses on complexity theory and cryptology, preferably by stressing their interrelation. Starting from scratch, it is an accessible introduction to cryptocomplexity and works its way to the frontiers of current research. It provides the necessary mathematical background, has numerous figures, exercises, and examples, and presents some central, up-to-date research topics and challenges. Due to its comprehensive bibliography and subject index, it is also a valuable source for researchers, teachers, and practitioners working in these fields.
Complexity Theory : Exploring the Limits of Efficient Algorithms
Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits of what is possible with the available resources. An understanding of these limits prevents the search for non-existing efficient algorithms. This textbook considers randomization as a key concept and emphasizes the interplay between theory and practice: New branches of complexity theory continue to arise in response to new algorithmic concepts, and its results - such as the theory of NP-completeness - have influenced the development of all areas of computer science. The topics selected have implications for concrete applications, and the significance of complexity theory for today's computer science is stressed throughout.
Complexity of Constraints : An Overview of Current Research Themes
This state-of-the-art survey contains the papers that were invited by the organizers after conclusion of an International Dagstuhl-Seminar on Complexity of Constraints, held in Dagstuhl Castle, Germany, in October 2006.
Competitive Programming in Python : 128 Algorithms to Develop your Coding Skills
Learn all the algorithmic techniques and programming skills you need from two experienced coaches, problem setters, and jurors for coding competitions. The authors highlight the versatility of each algorithm by considering a variety of problems and show how to implement algorithms in simple and efficient code. What to expect: * Master 128 algorithms in Python. * Discover the right way to tackle a problem and quickly implement a solution of low complexity.
Chaos and fractals : New frontiers of science
Covers the central ideas and concepts of chaos and fractals as well as many related topics including: the Mandelbrot set, Julia sets, cellular automata, L-systems, percolation and strange attractors.
Bioinformatics : Problem Solving Paradigms
This book highlights basic paradigms of problem analysis and algorithm design in the context of core bioinformatics problems. Mathematically demanding themes are put across to the reader by properly chosen representations with the aid of lots of illustrations.
Automatic speech recognition on mobile devices and over communication networks
This book brings together leading academic researchers and industrial practitioners to address the issues in this emerging realm and presents the reader with a comprehensive introduction to the subject of speech recognition in devices and networks.
Asymmetry : The foundation of information
As individual needs have arisen in the fields of physics, electrical engineering and computational science, each has created its own theories of information to serve as conceptual instruments for advancing developments. This book provides a coherent consolidation of information theories from these different fields.It provides a versatile tool for quantifying complexity and information capacity in any physical system.
Artificial intelligence in the design process : The impact on creativity and team collaboration
Discusses how to include artificial intelligence (AI) systems in the early stages of the design process. Today designers need new tools capable of supporting them in dealing with the increasing project's complexity and empowering their performances and capabilities. AI systems appear to be powerful means to enhance designers' creativity. This assumption was tested in a workshop where sixteen participants collaborated with three AI systems throughout the creative phases of research, sketching, and color selection. Results show that designers can access a broader level of variance and inspiration while reducing the risk of fossilization by triggering lateral thinking through AI-generated data. Therefore, AI could significantly impact the creative phases of the design process if applied consciously. Being AI systems intelligent agents, the book treats the Human-AI collaboration as a collaboration between human agents, proposing a set of guidelines helpful to achieving an efficient partnership with the machine.
Applications of Graph Transformations with Industrial Relevance ; 3rd International Symposium, AGTIVE 2007, Kassel, Germany, October 10-12, 2007, Revised Selected and Invited Papers
This book constitutes the thoroughly refereed post-conference proceedings of the Third International Symposium on Applications of Graph Transformations, AGTIVE 2007, held in Kassel, Germany, in October 2007.
Ant Colony Optimization and Swarm Intelligence ; 6th International Conference, ANTS 2008, Brussels, Belgium, September 22-24, 2008. Proceedings
This book constitutes the refereed proceedings of the 6th International Workshop on Ant Colony Optimization and Swarm Intelligence, ANTS 2008, held in Brussels, Belgium, in September 2008.
An Introduction to Kolmogorov Complexity and Its Applications
Written by two experts in the field, this book is ideal for advanced undergraduate students, graduate students, and researchers in all fields of science. It is self-contained: it contains the basic requirements from mathematics, probability theory, statistics, information theory, and computer science. Included are history, theory, new developments, a wide range of applications, numerous (new) problem sets, comments, source references, and hints to solutions of problems. This is the only comprehensive treatment of the central ideas of Kolmogorov complexity and their applications.
An introduction to description logics
Designed so that domain knowledge can be described and so that computers can reason about this knowledge. DLs have recently gained increased importance since they form the logical basis of widely used ontology languages, in particular the web ontology language OWL. Written by four renowned experts, this is the first textbook on description logics. It is suitable for self-study by graduates and as the basis for a university course. Starting from a basic DL, the book introduces the reader to their syntax, semantics, reasoning problems and model theory and discusses the computational complexity of these reasoning problems and algorithms to solve them.
Algorithms in Bioinformatics ; 8th International Workshop, WABI 2008, Karlsruhe, Germany, September 15-19, 2008. Proceedings
This book constitutes the refereed proceedings of the 8th International Workshop on Algorithms in Bioinformatics, WABI 2008, held in Karlsruhe, Germany, in September 2008 as part of the ALGO 2008 meeting.
Algorithms for Sensor and Ad Hoc Networks : Advanced Lectures
Thousands of mini computers (comparable to a stick of chewing gum in size), equipped with sensors, are deployed in some terrain or other. After activation the sensors form a self-organized network and provide data, for example about a forthcoming earthquake. The trend towards wireless communication increasingly affects electronic devices in almost every sphere of life. Conventional wireless networks rely on infrastructure such as base stations; mobile devices interact with these base stations in a client/server fashion. In contrast, current research is focusing on networks that are completely unstructured, but are nevertheless able to communicate (via several hops) with each other, despite the low coverage of their antennas. Such systems are called sensor or ad hoc networks, depending on the point of view and the application. Wireless ad hoc and sensor networks have gained an incredible research momentum. Computer scientists and engineers of all flavors are embracing the area. Sensor networks have been adopted by researchers in many fields: from hardware technology to operating systems, from antenna design to databases, from information theory to networking, from graph theory to computational geometry.
Algorithms and data structures : The Basic Toolbox
This book is a concise introduction addressed to students and professionals familiar with programming and basic mathematical language.
Algorithms – ESA 2007 ; 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings
This book presented submissions in the engineering and applications track. The papers address all current subjects in algorithmics reaching from design and analysis issues of algorithms over to real-world applicat.
Algorithms – ESA 2005 ; 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings
This volume contains the 75 contributed papers and the abstracts of the threeinvited lectures presented at the 13th Annual European Symposium on Algo-rithms (ESA 2005), held in Spain, 2005. respectively.Papers were solicited in all areas of algorithmic research, including but notlimited to algorithmic aspects of networks, approximation and on-line algo-rithms, computational biology, computational geometry, computational financeand algorithmic game theory, data structures, database and information re-trieval, external memory algorithms, graph algorithms, graph drawing, machinelearning, mobile computing, pattern matching and data compression, quantumcomputing, and randomized algorithms. The algorithms could be sequential,distributed, or parallel. Submissions were especially encouraged in the area ofmathematical programming and operations research, including combinatorialoptimization, integer programming, polyhedral combinatorics, and semidefiniteprogramming.Each extended abstract was submitted to one of the two tracks.
