Combinatorial and Algorithmic Aspects of Networking, Pawel Pralat; Jeannette Janssen
Автор: Chan Ernie Название: Algorithmic Trading ISBN: 1118460146 ISBN-13(EAN): 9781118460146 Издательство: Wiley Рейтинг: Цена: 63360.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Focuses on quantitative trading. This book offers readers an insight into how and why each trading strategy was developed, how it was implemented, and even how it was coded. It is suitable for anyone looking to create their own systematic trading strategies.
Автор: Pach, Janos Название: Combinatorial geometry and its algorithmic applications : the alcala lectures ISBN: 0821846914 ISBN-13(EAN): 9780821846919 Издательство: Mare Nostrum (Eurospan) Рейтинг: Цена: 87650.00 T Наличие на складе: Нет в наличии. Описание: The Ricci flow uses methods from analysis to study the geometry and topology of manifolds. With the third part of their volume on techniques and applications of the theory, the authors give a presentation of Hamilton`s Ricci flow for graduate students and mathematicians interested in working in the subject, with an emphasis on the geometric and analytic aspects.
Автор: COLLINS R.D. Название: Algorithmic Diagnosis Symptoms 3E ISBN: 1451173431 ISBN-13(EAN): 9781451173437 Издательство: Lippincott Williams & Wilkins Рейтинг: Цена: 65210.00 T Наличие на складе: Невозможна поставка. Описание: Algorithmic Diagnosis of Symptoms and Signs: A Cost-Effective ApproachThird Edition Designed for quick reference, the revised Third Edition of this handy pocket manual contains diagnostic algorithms to help you interpret more than 230 symptoms and si
Автор: Laurent Bartholdi; Tullio Ceccherini-Silberstein; Название: Infinite Groups: Geometric, Combinatorial and Dynamical Aspects ISBN: 3764374462 ISBN-13(EAN): 9783764374464 Издательство: Springer Рейтинг: Цена: 111790.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: 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.
Автор: Gunnar Fl?ystad; Trygve Johnsen; Andreas Leopold K Название: Combinatorial Aspects of Commutative Algebra and Algebraic Geometry ISBN: 3642268285 ISBN-13(EAN): 9783642268281 Издательство: Springer Рейтинг: Цена: 153720.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: The Abel Symposium 2009 "Combinatorial aspects of Commutative Algebra and Algebraic Geometry", held at Voss, Norway, featured talks by leading researchers in the field. This is the proceedings of the Symposium, presenting contributions on syzygies, tropical geometry, Boij-Soederberg theory, Schubert calculus, and quiver varieties.
Автор: Goldengorin, Boris, Pardalos, Panos M. Название: Data Correcting Algorithms in Combinatorial Optimization ISBN: 1461452856 ISBN-13(EAN): 9781461452850 Издательство: Springer Цена: 46540.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Data Correcting Approaches in Combinatorial Optimization focuses on algorithmic applications of the well known polynomially solvable special cases of computationally intractable problems. The purpose of this text is to design practically efficient algorithms for solving wide classes of combinatorial optimization problems. Researches, students and engineers will benefit from new bounds and branching rules in development efficient branch-and-bound type computational algorithms. This book examines applications for solving the Traveling Salesman Problem and its variations, Maximum Weight Independent Set Problem, Different Classes of Allocation and Cluster Analysis as well as some classes of Scheduling Problems. Data Correcting Algorithms in Combinatorial Optimization introduces the data correcting approach to algorithms which provide an answer to the following questions: how to construct a bound to the original intractable problem and find which element of the corrected instance one should branch such that the total size of search tree will be minimized. The PC time needed for solving intractable problems will be adjusted with the requirements for solving real world problems.
Автор: Theodore J. Saclarides, Jonathan A. Myers, Keith Название: Common Surgical Diseases An Algorithmic Approach to Problem Solving ISBN: 1493915649 ISBN-13(EAN): 9781493915644 Издательство: Springer Рейтинг: Цена: 139750.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Written by leaders in the field, the third edition of Common Surgical Diseases: An Algorithmic Approach to Problem Solving, provides surgical residents and medical students with a current, concise and algorithmic approach to frequently encountered clinical challenges.
Автор: Edelsbrunner Herbert Название: Algorithms in Combinatorial Geometry ISBN: 3642648738 ISBN-13(EAN): 9783642648731 Издательство: Springer Цена: 121070.00 T Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Schrijver Alexander Название: Combinatorial Optimization / Polyhedra and Efficiency ISBN: 3540443894 ISBN-13(EAN): 9783540443896 Издательство: Springer Рейтинг: Цена: 113660.00 T Наличие на складе: Поставка под заказ. Описание: 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.
Автор: 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.
Казахстан, 010000 г. Астана, проспект Туран 43/5, НП2 (офис 2) ТОО "Логобук" Тел:+7 707 857-29-98 ,+7(7172) 65-23-70 www.logobook.kz
