GIS Algorithms, Xiao Ningchuan

Автор: 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.

Автор: Asmussen
Название: Stochastic Simulation: Algorithms and Analysis
ISBN: 038730679X ISBN-13(EAN): 9780387306797
Издательство: Springer
Рейтинг:
Цена: 46540.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Sampling-based computational methods have become a fundamental part of the numerical toolset of practitioners and researchers across an enormous number of different applied domains and academic disciplines. This book provides a broad treatment of such sampling-based methods , as well as accompanying mathematical analysis of the convergence properties of the methods discussed . The reach of the ideas is illustrated by discussing a wide range of applications and the models that have found wide usage. The first  half of the book focusses on general methods, whereas the second half discusses model-specific algorithms. Given the wide range of  examples, exercises and applications students, practitioners and researchers in  probability, statistics, operations research, economics, finance, engineering  as well as biology and chemistry and physics will find the book of value.  Soren Asmussen is Professor of Applied Probability at Aarhus University, Denmark and Peter Glynn is Thomas Ford Professor of  Engineering at Stanford University. 

Автор: 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.

Автор: Ningchuan Xiao
Название: GIS Algorithms
ISBN: 1446274322 ISBN-13(EAN): 9781446274323
Издательство: Sage Publications
Рейтинг:
Цена: 162630.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The critical algorithms used in GIS are notoriously difficult to both teach and understand. This book address the problem by combining rigorous formal language with example case studies and student exercises.

Автор: Absil, P.-a. Mahony, Robert Sepulchre, Rodolphe
Название: Optimization algorithms on matrix manifolds
ISBN: 0691132984 ISBN-13(EAN): 9780691132983
Издательство: Wiley
Рейтинг:
Цена: 82370.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Many problems in the sciences and engineering can be rephrased as optimization problems on matrix search spaces endowed with a so-called manifold structure. This book shows how to exploit the special structure of such problems to develop efficient numerical algorithms. It is of interest to applied mathematicians, and computer scientists.