Treewidth
Treewidth

Author: Ton Kloks

Publisher: Springer Science & Business Media

Published: 1994-08-26

Total Pages: 226

ISBN-13: 9783540583561

DOWNLOAD EBOOK

The study of planetary or solar magnetic fields explains natural magnetism as a phenomenon of magnetohydrodynamics. The kinematic dynamo theory, especially the fast dynamo treated in this volume, is somewhat simpler but still it presents formidable analytical problems related to chaotic dynamics, for example. This remarkable book presents the status of the theory, including techniques of numerical simulations and modelling, along with a summary of results to date. The first three chapters introduce the problem and present examples of fast dynamo action in flows and maps. The remaining nine chapters deal with various analytical approaches and model systems. The book addresses astronomers and geophysicists, researchers and students alike.

Treewidth, Kernels, and Algorithms
Treewidth, Kernels, and Algorithms

Author: Fedor V. Fomin

Publisher: Springer Nature

Published: 2020-04-20

Total Pages: 350

ISBN-13: 303042071X

DOWNLOAD EBOOK

This Festschrift was published in honor of Hans L. Bodlaender on the occasion of his 60th birthday. The 14 full and 5 short contributions included in this volume show the many transformative discoveries made by H.L. Bodlaender in the areas of graph algorithms, parameterized complexity, kernelization and combinatorial games. The papers are written by his former Ph.D. students and colleagues as well as by his former Ph.D. advisor, Jan van Leeuwen. Chapter “Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds” is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

Advanced Tools and Methods for Treewidth-Based Problem Solving
Advanced Tools and Methods for Treewidth-Based Problem Solving

Author: M. Hecher

Publisher: IOS Press

Published: 2022-11-15

Total Pages: 252

ISBN-13: 1643683454

DOWNLOAD EBOOK

This book, Advanced Tools and Methods for Treewidth-Based Problem Solving, contains selected results from the author’s PhD studies, which were carried out from 2015 to 2021. For his PhD thesis, Markus Hecher received the EurAI Dissertation Award 2021 and the GI Dissertation Award 2021, amongst others. The aim of the book is to present a new toolkit for using the structural parameter of treewidth to solve problems in knowledge representation and reasoning (KR) and artificial intelligence (AI), thereby establishing both theoretical upper and lower bounds, as well as methods to deal with treewidth efficiently in practice. The key foundations outlined in the book provide runtime lower bounds – under reasonable assumptions in computational complexity – for evaluating quantified Boolean formulas and logic programs which match the known upper bounds already published in 2004 and 2009. The general nature of the developed tools and techniques means that a wide applicability beyond the selected problems and formalisms tackled in the book is anticipated, and it is hoped that the book will serve as a starting point for future theoretical and practical investigations, which will no doubt establish further results and gain deeper insights.

Modeling and Reasoning with Bayesian Networks
Modeling and Reasoning with Bayesian Networks

Author: Adnan Darwiche

Publisher: Cambridge University Press

Published: 2009-04-06

Total Pages: 549

ISBN-13: 1139478907

DOWNLOAD EBOOK

This book is a thorough introduction to the formal foundations and practical applications of Bayesian networks. It provides an extensive discussion of techniques for building Bayesian networks that model real-world situations, including techniques for synthesizing models from design, learning models from data, and debugging models using sensitivity analysis. It also treats exact and approximate inference algorithms at both theoretical and practical levels. The treatment of exact algorithms covers the main inference paradigms based on elimination and conditioning and includes advanced methods for compiling Bayesian networks, time-space tradeoffs, and exploiting local structure of massively connected networks. The treatment of approximate algorithms covers the main inference paradigms based on sampling and optimization and includes influential algorithms such as importance sampling, MCMC, and belief propagation. The author assumes very little background on the covered subjects, supplying in-depth discussions for theoretically inclined readers and enough practical details to provide an algorithmic cookbook for the system developer.

Encyclopedia of Algorithms
Encyclopedia of Algorithms

Author: Ming-Yang Kao

Publisher: Springer Science & Business Media

Published: 2008-08-06

Total Pages: 1200

ISBN-13: 0387307702

DOWNLOAD EBOOK

One of Springer’s renowned Major Reference Works, this awesome achievement provides a comprehensive set of solutions to important algorithmic problems for students and researchers interested in quickly locating useful information. This first edition of the reference focuses on high-impact solutions from the most recent decade, while later editions will widen the scope of the work. All entries have been written by experts, while links to Internet sites that outline their research work are provided. The entries have all been peer-reviewed. This defining reference is published both in print and on line.

Orders, Algorithms and Applications
Orders, Algorithms and Applications

Author: Vincent Bouchitte

Publisher: Springer Science & Business Media

Published: 1994-06-23

Total Pages: 220

ISBN-13: 9783540582748

DOWNLOAD EBOOK

This volume is the proceedings of the first International Workshop on Orders, Algorithms, and Applications, held at Lyon, France in July 1994. Ordered sets and the more specifically algorithmic aspects of order theory are of increasing importance, for example in graph theory. They enjoy a recognized place in computer science as well as in mathematics, due to various new developments in the last few years. The nine technical papers accepted for this volume and the four invited papers presented offer a representative perspective on theoretical and applicational aspects of orders and related algorithms.

Graph-Theoretic Concepts in Computer Science
Graph-Theoretic Concepts in Computer Science

Author: Andreas Brandstädt

Publisher: Springer

Published: 2013-11-12

Total Pages: 446

ISBN-13: 3642450431

DOWNLOAD EBOOK

This book constitutes the thoroughly refereed proceedings of the 39th International Workshop on Graph Theoretic Concepts in Computer Science, WG 2013, held in Lübeck, Germany, in June 2013. The 34 revised full papers presented were carefully reviewed and selected from 61 submissions. The book also includes two abstracts. The papers cover a wide range of topics in graph theory related to computer science, such as structural graph theory with algorithmic or complexity applications; design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms; computational complexity of graph and network problems; computational geometry; graph grammars, graph rewriting systems and graph modeling; graph drawing and layouts; random graphs and models of the web and scale-free networks; and support of these concepts by suitable implementations and applications.

Mathematical Foundations of Computer Science 2002
Mathematical Foundations of Computer Science 2002

Author: Krzystof Diks

Publisher: Springer

Published: 2007-10-23

Total Pages: 663

ISBN-13: 3540456872

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002, held in Warsaw, Poland in August 2002. The 48 revised full papers presented together with 5 invited papers were carefully reviewed and selected from 108 submissions. All relevant aspects of theoretical computer science are addressed, ranging from discrete mathematics, combinatorial optimization, graph theory, algorithms, and complexity to programming theory, formal methods, and mathematical logic.

Fundamentals of Software Engineering
Fundamentals of Software Engineering

Author: Mehdi Dastani

Publisher: Springer

Published: 2015-09-24

Total Pages: 326

ISBN-13: 3319246445

DOWNLOAD EBOOK

This book constitutes the thoroughly refereed post-conference proceedings of the 6th IPM International Conference on Fundamentals of Software Engineering, FSEN 2015, held in Tehran, Iran, in April 2015. The 21 full papers presented in this volume were carefully reviewed and selected from 64 submissions. The topics of interest in FSEN span over all aspects of formal methods, especially those related to advancing the application of formal methods in software industry and promoting their integration with practical engineering techniques.

Theory and Applications of Models of Computation
Theory and Applications of Models of Computation

Author: Jianer Chen

Publisher: Springer Science & Business Media

Published: 2009-04-28

Total Pages: 494

ISBN-13: 364202016X

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 6th International Conference on Theory and Applications of Models of Computation, TAMC 2009, held in Changsha, China in May 2009. The 39 full papers presented together with 7 invited papers as well as 3 plenary talks were selected from 86 submissions. The papers address the three main themes of the conference which were Computability, Complexity, and Algorithms. The conference aimed to bring together researchers with interests in theoretical computer science, algorithmic mathematics, and applications to the physical sciences.