Kategoria BISAC: Computers >> Machine Theory

Incremental computation concerns the re-computation of output after a change in the input, whereas algorithms and programs usually derive their output directly from their input. This book investigates the concept of incremental computation and dynamic algorithms in general and provides a variety of new results, especially for computational problems from graph theory: the author presents e.g. efficient incremental algorithms for several shortest-path problems as well as incremental algorithms for the circuit value annotation problem and for various computations in reducible flow graphs.

This book constitutes the refereed proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science, MFCS '96, held in Crakow, Poland in September 1996.
The volume presents 35 revised full papers selected from a total of 95 submissions together with 8 invited papers and 2 abstracts of invited talks. The papers included cover issues from the whole area of theoretical computer science, with a certain emphasis on mathematical and logical foundations. The 10 invited presentations are of particular value.

This book constitutes the refereed proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics, TPHOLs '97, held in Murray Hill, NJ, USA, in August 1997.
The volume presents 19 carefully revised full papers selected from 32 submissions during a thorough reviewing process. The papers cover work related to all aspects of theorem proving in higher order logics, particularly based on secure mechanization of those logics; the theorem proving systems addressed include Coq, HOL, Isabelle, LEGO, and PVS.

The workshop on Computability and Complexity in Analysis, CCA 2000, was hosted by the Department of Computer Science of the University of Wales Swansea, September 17{19, 2000. It was the fourth workshop in a successful series of workshops: CCA 95 in Hagen, Germany, CCA 96 in Trier, Germany, and CCA 98 in Brno, Czech Republic. About 40 participants from the countries United Kingdom, Germany, Japan, Italy, Russia, France, Denmark, Greece, and Ireland contributed to the success of this meeting. Altogether, 28 talkswere p- sented in Swansea. These proceedings include 23 papers which represent a...

In many ways, our immune systems are as complex as our brains. They learn, predict, remember and adapt, protecting us from the maelstrom of pathogens that infect us daily. Computer Science frequently takes inspiration from the seemingly endless capabilities of natural systems. It should therefore be no s- prise that, like the ?eld of Arti?cial Neural Networks inspired from brains, we now have a vigorous ?eld of research known as Arti?cial Immune Systems (AIS), inspired by our own immune systems. Although still relatively new, the previous 10 years has seen the paradigm of AIS rapidly...

These are the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California, USA in August 2001. The 26 revised full papers presented were carefully reviewed and selected from a total of 54 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization, de-randomization, average-case analysis,...

This title constitutes the refereed proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science, MFCS 2001, held in Marianske Lazne, Czech Republic in August 2001. The 51 revised full papers presented together with 10 invited contributions were carefully reviewed and selected from a total of 118 submissions. All current aspects of theoretical computer science are addressed ranging from mathematical logic and programming theory to algorithms, discrete mathematics, and complexity theory. Besides classical issues, modern topics like quantum computing are...

This book constitutes the refereed proceedings of the 8th Annual European Symposium on Algorithms, ESA 2000, held in Saarbrucken, Germany in September 2000. The 39 revised full papers presented together with two invited papers were carefully reviewed and selected for inclusion in the book. Among the topics addressed are parallelism, distributed systems, approximation, combinatorial optimization, computational biology, computational geometry, external-memory algorithms, graph algorithms, network algorithms, online algorithms, data compression, symbolic computation, pattern matching, and...

This title is devoted to presenting some of the most important concepts and techniques for describing real-time systems and analyzing their behavior in order to enable the designer to achieve guarantees of temporal correctness.

Topics addressed include mathematical models of real-time systems and associated formal verification techniques such as model checking, probabilistic modeling and verification, programming and description languages, and validation approaches based on testing. With contributions from authors who are experts in their respective fields, this will provide the reader...

The information deluge currently assaulting us in the 21st century is having a profound impact on our lifestyles and how we work. We must constantly separate trustworthy and required information from the massive amount of data we encounter each day. Through mathematical theories, models, and experimental computations, Artificial Intelligence with Uncertainty explores the uncertainties of knowledge and intelligence that occur during the cognitive processes of human beings. The authors focus on the importance of natural language-the carrier of knowledge and intelligence-for artificial...

The Handbook of Natural Language Processing, Second Edition presents practical tools and techniques for implementing natural language processing in computer systems. Along with removing outdated material, this edition updates every chapter and expands the content to include emerging areas, such as sentiment analysis.

New to the Second Edition

• Greater prominence of statistical approaches
• New applications section
• Broader multilingual scope to include Asian and European languages, along with English
• An...

Fuzzy sets, near sets, and rough sets are useful and important stepping stones in a variety of approaches to image analysis. These three types of sets and their various hybridizations provide powerful frameworks for image analysis. Emphasizing the utility of fuzzy, near, and rough sets in image analysis, Rough Fuzzy Image Analysis: Foundations and Methodologies introduces the fundamentals and applications in the state of the art of rough fuzzy image analysis.

In the first chapter, the distinguished editors explain how fuzzy, near, and rough...

This book constitutes the refereed proceedings of the 13th Symposium on Theoretical Aspects of Computer Science, STACS 96, held in Grenoble, France in February 1996.
The 52 revised papers presented were selected from a total of 185 submissions; also included are three invited papers. The volume addresses all current aspects of theoretical computer science and is organized in sections on complexity theory, automata theory, parallel algorithms, learning, parallel and distributed systems, cryptography, logic and database theory, algorithms, semantics and program verification, and...

This book presents a collection of 33 strictly refereed full papers on combinatorics and computer science; these papers have been selected from the 54 papers accepted for presentation at the joint 8th Franco-Japanese and 4th Franco-Chinese Conference on Combinatorics in Computer Science, CCS '96, held in Brest, France in July 1995.
The papers included in the book have been contributed by authors from 10 countries; they are organized in sections entitled graph theory, combinatorial optimization, selected topics, and parallel and distributed computing.

This book constitutes the refereed proceedings of the 4th European Symposium on Algorithms, ESA '96, held in Barcelona, Spain, in September 1996.
The book presents 40 revised full papers selected from 124 submissions; also are included extended abstracts of two invited presentations. The papers included cover all research areas on algorithms and their analysis as it is carried out in the fields of computer science, discrete applied and algorithmic mathematics, operations research, and all other areas of algorithms-oriented research, design and analysis.

This book constitutes the refereed proceedings of the 4th International Symposium on Logical Foundations of Computer Science, LFCS'97, held in Yaroslavl, Russia, in July 1997.
The volume presents 42 revised refereed papers carefully selected by the program committee. All current issues of computer science logic are addressed. There is a certain emphasis on reporting the progress achieved by scientists from various parts of the former Soviet Union; but there are also many other strong papers from the international research community.

This book constitutes the strictly refereed post-workshop proceedings of the 10th International Workshop on Computer Science Logic, CSL'96, held as the 5th Annual Conference of the European Association of Computer Science Logic (EACSL), in Utrecht, The Netherlands, in September 1996.
The volume presents 26 revised full papers selected from a total of initially 75 papers submitted; also included are two refereed invited contributions. The volume addresses all current issues in the area of computer science logic research, and is thus a unique record of recent progress in the area.

Containing the edited proceedings of the 1993 Higher-Order Logic User's Group Workshop, held at the University of British Columbia, Vancouver, Canada in August 1993, this volume explores higher-order logic theory proving, its usage and applications.

This book and its sister volume, LNAI 3613 and 3614, constitute the proce- ings of the Second International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2005), jointly held with the First International Conference on Natural Computation (ICNC 2005, LNCS 3610, 3611, and 3612) from - gust 27-29, 2005 in Changsha, Hunan, China. FSKD 2005 successfully attracted 1249 submissions from 32 countries/regions (the joint ICNC-FSKD 2005 received 3136 submissions). After rigorous reviews, 333 high-quality papers, i. e., 206 long papers and 127 short papers, were included in the FSKD 2005...

Coloured Petri Nets (CPN) is a graphical language for modelling and validating concurrent and distributed systems, and other systems in which concurrency plays a major role. The development of such systems is particularly challenging because of inherent intricacies like possible nondeterminism and the immense number of possible execution sequences.

In this textbook Jensen and Kristensen introduce the constructs of the CPN modelling language and present the related analysis methods in detail. They also provide a comprehensive road map for the practical use of CPN by showcasing...