STACS 94
STACS 94

Author: Patrice Enjalbert

Publisher: Springer Science & Business Media

Published: 1994-02-09

Total Pages: 802

ISBN-13: 9783540577850

DOWNLOAD EBOOK

This volume constitutes the proceedings of the 11th annual Symposium on Theoretical Aspects of Computer Science (STACS '94), held in Caen, France, February 24-26, 1994. Besides three prominent invited papers, the proceedings contains 60 accepted contributions chosen by the international program committee during a highly competitive reviewing process from a total of 234 submissions for 38 countries. The volume competently represents most areas of theoretical computer science with a certain emphasis on (parallel) algorithms and complexity.

STACS 95
STACS 95

Author: Ernst W. Mayr

Publisher: Springer Science & Business Media

Published: 1995-02-15

Total Pages: 698

ISBN-13: 9783540590422

DOWNLOAD EBOOK

This book presents the proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS 95), held in Munich, Germany in March 1995. Besides three invited talks, the book contains revised versions of 53 research papers selected from a total of 180 submissions. The contributions address all current aspects of theoretical computer science; they are organized in sections on complexity theory, automata theory, algorithms, logic, theory of parallel computing, communication theory, graph theory and databases, and computational geometry.

STACS 96
STACS 96

Author: Claude Puech

Publisher: Springer Science & Business Media

Published: 1996-02-14

Total Pages: 710

ISBN-13: 9783540609223

DOWNLOAD EBOOK

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 communication complexity.

Automata, Languages and Programming
Automata, Languages and Programming

Author: Jiri Wiedermann

Publisher: Springer

Published: 2003-07-31

Total Pages: 726

ISBN-13: 3540485236

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 26th International Colloquium on Automata, Languages and Programming, ICALP'99, held in Prague, Czech Republic, in July 1999. The 56 revised full papers presented were carefully reviewed and selected from a total of 126 submissions; also included are 11 inivited contributions. Among the topics addressed are approximation algorithms, algebra and circuits, concurrency, semantics and rewriting, process algebras, graphs, distributed computing, logic of programs, sorting and searching, automata, nonstandard computing, regular languages, combinatorial optimization, automata and logics, string algorithms, and applied logics.

Algorithmic Learning Theory
Algorithmic Learning Theory

Author: Nicolò Cesa-Bianchi

Publisher: Springer

Published: 2003-08-03

Total Pages: 425

ISBN-13: 3540361693

DOWNLOAD EBOOK

This volume contains the papers presented at the 13th Annual Conference on Algorithmic Learning Theory (ALT 2002), which was held in Lub ̈ eck (Germany) during November 24–26, 2002. The main objective of the conference was to p- vide an interdisciplinary forum discussing the theoretical foundations of machine learning as well as their relevance to practical applications. The conference was colocated with the Fifth International Conference on Discovery Science (DS 2002). The volume includes 26 technical contributions which were selected by the program committee from 49 submissions. It also contains the ALT 2002 invited talks presented by Susumu Hayashi (Kobe University, Japan) on “Mathematics Based on Learning”, by John Shawe-Taylor (Royal Holloway University of L- don, UK) on “On the Eigenspectrum of the Gram Matrix and Its Relationship to the Operator Eigenspectrum”, and by Ian H. Witten (University of Waikato, New Zealand) on “Learning Structure from Sequences, with Applications in a Digital Library” (joint invited talk with DS 2002). Furthermore, this volume - cludes abstracts of the invited talks for DS 2002 presented by Gerhard Widmer (Austrian Research Institute for Arti?cial Intelligence, Vienna) on “In Search of the Horowitz Factor: Interim Report on a Musical Discovery Project” and by Rudolf Kruse (University of Magdeburg, Germany) on “Data Mining with Graphical Models”. The complete versions of these papers are published in the DS 2002 proceedings (Lecture Notes in Arti?cial Intelligence, Vol. 2534). ALT has been awarding the E.

The Book Of Traces
The Book Of Traces

Author: Volker Diekert

Publisher: World Scientific

Published: 1995-03-07

Total Pages: 588

ISBN-13: 9814501263

DOWNLOAD EBOOK

The theory of traces employs techniques and tackles problems from quite diverse areas which include formal language theory, combinatorics, graph theory, algebra, logic, and the theory of concurrent systems. In all these areas the theory of traces has led to interesting problems and significant results. It has made an especially big impact in formal language theory and the theory of concurrent systems. In both these disciplines it is a well-recognized and dynamic research area. Within formal language theory it yields the theory of partially commutative monoids, and provides an important connection between languages and graphs. Within the theory of concurrent systems it provides an important formal framework for the analysis and synthesis of concurrent systems.This monograph covers all important research lines of the theory of traces; each chapter is devoted to one research line and is written by leading experts. The book is organized in such a way that each chapter can be read independently — and hence it is very suitable for advanced courses or seminars on formal language theory, the theory of concurrent systems, the theory of semigroups, and combinatorics. An extensive bibliography is included. At present, there is no other book of this type on trace theory.

Fundamentals of Computation Theory
Fundamentals of Computation Theory

Author: Horst Reichel

Publisher: Springer Science & Business Media

Published: 1995-08-16

Total Pages: 454

ISBN-13: 9783540602491

DOWNLOAD EBOOK

This book presents the proceedings of the 10th International Conference on Fundamentals of Computation Theory, FCT '95, held in Dresden, Germany in August 1995. The volume contains five invited lectures and 32 revised papers carefully selected for presentation at FCT '95. A broad spectrum of theoretical computer science is covered; among topics addressed are algorithms and data structures, automata and formal languages, categories and types, computability and complexity, computational logics, computational geometry, systems specification, learning theory, parallelism and concurrency, rewriting and high-level replacement systems, and semantics.

Decision Making Process
Decision Making Process

Author: Denis Bouyssou

Publisher: John Wiley & Sons

Published: 2013-05-10

Total Pages: 671

ISBN-13: 1118619528

DOWNLOAD EBOOK

This book provides an overview of the main methods and results in the formal study of the human decision-making process, as defined in a relatively wide sense. A key aim of the approach contained here is to try to break down barriers between various disciplines encompassed by this field, including psychology, economics and computer science. All these approaches have contributed to progress in this very important and much-studied topic in the past, but none have proved sufficient so far to define a complete understanding of the highly complex processes and outcomes. This book provides the reader with state-of-the-art coverage of the field, essentially forming a roadmap to the field of decision analysis. The first part of the book is devoted to basic concepts and techniques for representing and solving decision problems, ranging from operational research to artificial intelligence. Later chapters provide an extensive overview of the decision-making process under conditions of risk and uncertainty. Finally, there are chapters covering various approaches to multi-criteria decision-making. Each chapter is written by experts in the topic concerned, and contains an extensive bibliography for further reading and reference.

Domination in Graphs
Domination in Graphs

Author: TeresaW. Haynes

Publisher: Routledge

Published: 2017-11-22

Total Pages: 519

ISBN-13: 1351454641

DOWNLOAD EBOOK

""Presents the latest in graph domination by leading researchers from around the world-furnishing known results, open research problems, and proof techniques. Maintains standardized terminology and notation throughout for greater accessibility. Covers recent developments in domination in graphs and digraphs, dominating functions, combinatorial problems on chessboards, and more.

Algorithm Theory - SWAT 2000
Algorithm Theory - SWAT 2000

Author: Magnús M. Halldórsson

Publisher: Springer Science & Business Media

Published: 2000-06-21

Total Pages: 578

ISBN-13: 3540676902

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT 2000, held in Bergen, Norway, in July 2000. The 43 revised full papers presented together with 3 invited contributions were carefully reviewed and selected from a total of 105 submissions. The papers are organized in sections on data structures, dynamic partitions, graph algorithms, online algorithms, approximation algorithms, matchings, network design, computational geometry, strings and algorithm engineering, external memory algorithms, optimization, and distributed and fault-tolerant computing.