Algorithms - ESA `97, Rainer Burkard; Gerhard Woeginger
Автор: 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.
Автор: Friedhelm Meyer auf der Heide Название: Algorithms - ESA 2001 ISBN: 3540424938 ISBN-13(EAN): 9783540424932 Издательство: Springer Рейтинг: Цена: 12577.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Gianfranco Bilardi; Giuseppe F. Italiano; Andrea P Название: Algorithms - ESA `98 ISBN: 3540648488 ISBN-13(EAN): 9783540648482 Издательство: Springer Рейтинг: Цена: 12577.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: A collection of 40 papers taken from the Sixth Annual European Symposium on Algorithms. They are divided into sections on data structures, strings and biology, numerical algorithms, geometry, randomized and online algorithms, parallel and distributed algorithms, graph algorithms, and 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
Автор: 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.
Автор: Schapire Robert E., Freund Yoav Название: Boosting: Foundations and Algorithms ISBN: 0262526034 ISBN-13(EAN): 9780262526036 Издательство: MIT Press Рейтинг: Цена: 6772.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
An accessible introduction and essential reference for an approach to machine learning that creates highly accurate prediction rules by combining many weak and inaccurate ones.
Boosting is an approach to machine learning based on the idea of creating a highly accurate predictor by combining many weak and inaccurate "rules of thumb." A remarkably rich theory has evolved around boosting, with connections to a range of topics, including statistics, game theory, convex optimization, and information geometry. Boosting algorithms have also enjoyed practical success in such fields as biology, vision, and speech processing. At various times in its history, boosting has been perceived as mysterious, controversial, even paradoxical.
This book, written by the inventors of the method, brings together, organizes, simplifies, and substantially extends two decades of research on boosting, presenting both theory and applications in a way that is accessible to readers from diverse backgrounds while also providing an authoritative reference for advanced researchers. With its introductory treatment of all material and its inclusion of exercises in every chapter, the book is appropriate for course use as well.
The book begins with a general introduction to machine learning algorithms and their analysis; then explores the core theory of boosting, especially its ability to generalize; examines some of the myriad other theoretical viewpoints that help to explain and understand boosting; provides practical extensions of boosting for more complex learning problems; and finally presents a number of advanced theoretical topics. Numerous applications and practical illustrations are offered throughout.
Автор: Sumit Ganguly; Ramesh Krishnamurti Название: Algorithms and Discrete Applied Mathematics ISBN: 3319149733 ISBN-13(EAN): 9783319149738 Издательство: Springer Рейтинг: Цена: 7826.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book collects the refereed proceedings of the First International Conference onon Algorithms and Discrete Applied Mathematics, CALDAM 2015, held in Kanpur, India, in February 2015.
Автор: Abel Gomes; Irina Voiculescu; Joaquim Jorge; Brian Название: Implicit Curves and Surfaces: Mathematics, Data Structures and Algorithms ISBN: 1447158776 ISBN-13(EAN): 9781447158776 Издательство: Springer Рейтинг: Цена: 9776.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: In presenting the mathematics, computational methods and data structures, as well as the algorithms needed to render implicit curves and surfaces, the authors show how implicit objects can easily describe smooth, intricate, and shapes that articulate.
Автор: 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.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
