Algorithms and Models for the Web-Graph, William Aiello; Andrei Broder; Jeannette Janssen;

Автор: Ching Wai-Ki, Ng Michael K.
Название: Markov Chains: Models, Algorithms and Applications
ISBN: 0387293353 ISBN-13(EAN): 9780387293356
Издательство: Springer
Рейтинг:
Цена: 88470.00 T
Наличие на складе: Поставка под заказ.
Описание: Markov chains are a particularly powerful and widely used tool for analyzing a variety of stochastic (probabilistic) systems over time. This title outlines developments of Markov chain models for modeling queueing sequences, Internet, re-manufacturing systems, reverse logistics, inventory systems, bio-informatics, and many other practical systems.

Автор: Nancy A. Lynch
Название: Distributed Algorithms,
ISBN: 1558603484 ISBN-13(EAN): 9781558603486
Издательство: Elsevier Science
Рейтинг:
Цена: 136990.00 T
Наличие на складе: Поставка под заказ.
Описание: 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.

Автор: Anthony Bonato; Fan R.K. Chung
Название: Algorithms and Models for the Web-Graph
ISBN: 3540770038 ISBN-13(EAN): 9783540770039
Издательство: Springer
Рейтинг:
Цена: 60550.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the refereed proceedings of the 5th International Workshop on Algorithms and Models for the Web-Graph, WAW 2007, held in San Diego, CA, USA, in December 2007 - colocated with WINE 2007, the Third International Workshop on Internet and Network Economics. This book presents 13 revised full papers and 5 revised short papers.

Автор: Korte, Bernhard, Vygen, Jens
Название: Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed.
ISBN: 3642244874 ISBN-13(EAN): 9783642244872
Издательство: Springer
Рейтинг:
Цена: 60510.00 T
Наличие на складе: Невозможна поставка.
Описание: This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.