Автор: David J. C. MacKay Название: Information Theory, Inference and Learning Algorithms ISBN: 0521642981 ISBN-13(EAN): 9780521642989 Издательство: Cambridge Academ Рейтинг: Цена: 9029.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This exciting and entertaining textbook is ideal for courses in information, communication and coding. It is an unparalleled entry point to these subjects for professionals working in areas as diverse as computational biology, data mining, financial engineering and machine learning.
This book is a brief and focused introduction to the reverse mathematics and computability theory of combinatorial principles, an area of research which has seen a particular surge of activity in the last few years. It provides an overview of some fundamental ideas and techniques, and enough context to make it possible for students with at least a basic knowledge of computability theory and proof theory to appreciate the exciting advances currently happening in the area, and perhaps make contributions of their own. It adopts a case-study approach, using the study of versions of Ramsey's Theorem (for colorings of tuples of natural numbers) and related principles as illustrations of various aspects of computability theoretic and reverse mathematical analysis. This book contains many exercises and open questions.
Автор: Vladimir N. Sachkov , Translated by V. Kolchin Название: Combinatorial Methods in Discrete Mathematics ISBN: 0521455138 ISBN-13(EAN): 9780521455138 Издательство: Cambridge Academ Рейтинг: Цена: 18216.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: A 1996 account of some complex problems of discrete mathematics in a simple and unified form. A distinctive aspect of the book is the large number of asymptotic formulae derived. This is an important book, describing many ideas not previously available in English; the author has taken the chance to update the text and references where appropriate.
Описание: Constitutes the refereed proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2009, held in Pittsburgh, PA, USA, in May 2009.
Описание: Combinatorial optimisation is a ubiquitous discipline whose usefulness spans vast applications domains. This title presents advances in the area of metaheuristic combinatorial optimisation, with a focus on evolutionary computation methods. It addresses local search methods and hybrid approaches.
Автор: Paolo Ferragina; Gad M. Landau Название: Combinatorial Pattern Matching ISBN: 3540690662 ISBN-13(EAN): 9783540690665 Издательство: Springer Рейтинг: Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the refereed proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM 2008, held in Pisa, Italy, in June 2008. This book features 25 revised full papers which addresses various areas related to combinatorial pattern matching and its applications, such as coding and data compression, and computational biology.
Автор: Laurent Bartholdi; Tullio Ceccherini-Silberstein; Название: Infinite Groups: Geometric, Combinatorial and Dynamical Aspects ISBN: 3764374462 ISBN-13(EAN): 9783764374464 Издательство: Springer Рейтинг: Цена: 16769.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Covers advances in the theory of infinite groups. This work covers topics including amenable groups, Kaehler groups, automorphism groups of rooted trees, rigidity, C*-algebras, random walks on groups, pro-p groups, Burnside groups, parafree groups, and Fuchsian groups.
Автор: Schrijver Alexander Название: Combinatorial Optimization / Polyhedra and Efficiency ISBN: 3540443894 ISBN-13(EAN): 9783540443896 Издательство: Springer Рейтинг: Цена: 17049.00 р. Наличие на складе: Поставка под заказ.
Описание: This book offers an in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization.These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science. In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4000 references to further research are given, and historical surveys on the basic subjects are presented.
Автор: Edelsbrunner Herbert Название: Algorithms in Combinatorial Geometry ISBN: 3642648738 ISBN-13(EAN): 9783642648731 Издательство: Springer Цена: 18161.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
