Algorithms - ESA `98, Gianfranco Bilardi; Giuseppe F. Italiano; Andrea P
Автор: Nancy A. Lynch Название: Distributed Algorithms, ISBN: 1558603484 ISBN-13(EAN): 9781558603486 Издательство: Elsevier Science Рейтинг: Цена: 20549.00 р. Наличие на складе: Поставка под заказ.
Описание: A guide to designing, implementing and analyzing distributed algorithms. It covers problems including resource allocation, communication, consensus among distributed processes, data consistency, deadlock detection, leader election and global snapshots.
Описание: Logic is a branch of philosophy, mathematics and computer science. It studies the required methods to determine whether a statement is true, such as reasoning and computation.Proofs and Algorithms: Introduction to Logic and Computability is an introduction to the fundamental concepts of contemporary logic - those of a proof, a computable function, a model and a set. It presents a series of results, both positive and negative, - Church's undecidability theorem, G?del’s incompleteness theorem, the theorem asserting the semi-decidability of provability - that have profoundly changed our vision of reasoning, computation, and finally truth itself.Designed for undergraduate students, this book presents all that philosophers, mathematicians and computer scientists should know about logic.
Автор: Guram Bezhanishvili Название: Leo Esakia on Duality in Modal and Intuitionistic Logics ISBN: 9402403388 ISBN-13(EAN): 9789402403381 Издательство: Springer Рейтинг: Цена: 20962.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
This volume is dedicated to Leo Esakia's contributions to the theory of modal and intuitionistic systems. Consisting of 10 chapters, written by leading experts, this volume discusses Esakia's original contributions and consequent developments that have helped to shape duality theory for modal and intuitionistic logics and to utilize it to obtain some major results in the area.
Beginning with a chapter which explores Esakia duality for S4-algebras, the volume goes on to explore Esakia duality for Heyting algebras and its generalizations to weak Heyting algebras and implicative semilattices. The book also dives into the Blok-Esakia theorem and provides an outline of the intuitionistic modal logic KM which is closely related to the G del-L b provability logic GL. One chapter scrutinizes Esakia's work interpreting modal diamond as the derivative of a topological space within the setting of point-free topology. The final chapter in the volume is dedicated to the derivational semantics of modal logic and other related issues.
Описание: An up-to-date analysis of the SAR wavefront reconstruction signal theory and its digital implementation. With the advent of fast computing and digital information processing techniques, synthetic aperture radar (SAR) technology has become both more powerful and more accurate.
Автор: Kurt Mehlhorn Название: Algorithms - ESA 2008 ISBN: 3540877436 ISBN-13(EAN): 9783540877431 Издательство: Springer Рейтинг: Цена: 19564.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the proceedings of the 16th Annual European Symposium on Algorithms, ESA 2008, held in Karlsruhe, Germany, in September 2008 in the context of the combined conference ALGO 2008. This title includes the papers that address various subjects in algorithmics reaching from design and analysis issues of algorithms.
Автор: Rainer Burkard; Gerhard Woeginger Название: Algorithms - ESA `97 ISBN: 3540633979 ISBN-13(EAN): 9783540633976 Издательство: Springer Рейтинг: Цена: 12577.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The proceedings of the fifth Annual International European Symposium on Algorithms, ESA `97. The papers address a range of theoretical and applicational aspects in algorithms theory and design, including approximation algorithms, graph and network algorithms, and combinatorial optimization.
Автор: Hans L. Bodlaender; Giuseppe F. Italiano Название: Algorithms – ESA 2013 ISBN: 3642404499 ISBN-13(EAN): 9783642404498 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 21st Annual European Symposium on Algorithms, ESA 2013, held in Sophia Antipolis, France, in September 2013 in the context of the combined conference ALGO 2013.
Автор: Guram Bezhanishvili Название: Leo Esakia on Duality in Modal and Intuitionistic Logics ISBN: 9401788596 ISBN-13(EAN): 9789401788595 Издательство: Springer Рейтинг: Цена: 20962.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Leo Esakia on Duality in Modal and Intuitionistic Logics
Автор: Khaled Elbassioni; Kazuhisa Makino Название: Algorithms and Computation ISBN: 3662489708 ISBN-13(EAN): 9783662489703 Издательство: Springer Рейтинг: Цена: 12298.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 26th InternationalSymposium on Algorithms and Computation, ISAAC 2015, held in Nagoya, Japan, inDecember 2015.The 65 revised full papers presented together with 3 invited talks were carefullyreviewed and selected from 180 submissions for inclusion in the book. graph algorithms and FPT;
Автор: Frank Dehne; J?rg-R?diger Sack; Ulrike Stege Название: Algorithms and Data Structures ISBN: 3319218395 ISBN-13(EAN): 9783319218397 Издательство: Springer Рейтинг: Цена: 11180.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The Algorithms and Data Structures Symposium - WADS (formerly Workshop on Algorithms And Data Structures), which alternates with the Scandinavian Workshop on Algorithm Theory, is intended as a forum for researchers in the area of design and analysis of algorithms and data structures.
Автор: Kratochv?l Jan; Mirka Miller; Dalibor Froncek Название: Combinatorial Algorithms ISBN: 3319193147 ISBN-13(EAN): 9783319193144 Издательство: Springer Рейтинг: Цена: 7826.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism.- Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem.- Quantifying Privacy: A Novel Entropy-Based Measure of Disclosure Risk.- On the Galois Lattice of Bipartite Distance Hereditary Graphs.- Fast Simple Computations Using Prefix Tables under Hamming and Edit Distance.- Border Correlations, Lattices and the Subgraph Component Polynomial.- Computing Minimum Length Representations of Sets of Words of Uniform Length.- Computing Primitively-Rooted Squares and Runs in Partial Words.- 3-coloring triangle-free planar graphs with a precolored 9-cycle.- Computing Heat Kernel Pagerank and a Local Clustering Algorithm.- Solving Matching Problems Efficiently in Bipartite Graphs.- A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras.- On decomposing the complete graph into the union of two disjoint cycles.- Reconfiguration of Vertex Covers in a Graph.- Space Efficient Data Structures for Nearest Larger Neighbor Playing several variants of Mastermind with constant-size memory is not harder than with unbounded memory.- On Maximum Common Subgraph Problems in Series-Parallel Graphs.- Profile-based optimal matchings in the Student/Project Allocation Problem.- The Min-Max Edge q-Coloring Problem.- Speeding up Graph Algorithms via Switching Classes.- Metric Dimension for Amalgamations of Graphs.- Deterministic Algorithms for the Independent Feedback Vertex Set Problem.- Lossless seeds for searching short patterns with high error rates.
Автор: Evripidis Bampis Название: Experimental Algorithms ISBN: 3319200852 ISBN-13(EAN): 9783319200859 Издательство: Springer Рейтинг: Цена: 7826.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 14th International Symposium on Experimental Algorithms, SEA 2015, held in Paris, France, in June/July 2015. The 30 revised full papers presented were carefully reviewed and selected from 76 submissions.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
