Автор: 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.
Автор: Bhubaneswar Mishra Название: Algorithmic Algebra ISBN: 0387940901 ISBN-13(EAN): 9780387940908 Издательство: Springer Рейтинг: Цена: 62380.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Based on a graduate computer science course entitled "Symbolic Computational Algebra" taught by the author at New York University, this book covers four main topics - Grobner bases, characteristic sets, resultants and semialgebraic sets. It is intended for graduate students with training in theoretical computer science.
Автор: 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.
Автор: Terzidis Название: Algorithmic Architecture ISBN: 0750667257 ISBN-13(EAN): 9780750667258 Издательство: Taylor&Francis Рейтинг: Цена: 57150.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Why does the word design owe its origin to Latin and not Greek roots? Where do the limits of the human mind lie? This volume challenges the reader to tackle these complex questions and more. It presents many, various and often seemingly disparate points of view that lead to the establishment of one common theme; algorithmic architecture.
The Square Root Phenomenon in Planar Graphs.- An Algorithm for Determining Whether a Pair of Polygons Is Reversible.- Disjoint Small Cycles in Graphs and Bipartite Graphs.- An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree.- Algorithms for Testing Length Four Permutations.- Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds.- Faster Exact Computation of rSPR Distance.- Arbitrated Quantum Signature Schemes: Attacks and Security.- Randomized Algorithms for Removable Online Knapsack Problems.- An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs.- FWLS: A Local Search for Graph Coloring.- A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids.- Monomial Testing and Applications.- The Optimal Rescue Path Set Problem in Undirected Graphs.- Expected Computations on Color Spanning Sets.- Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs.- Spanning Distribution Trees of Graphs.- A Cutting Plane Heuristic Algorithm for the Time Dependent Chinese Postman Problem.- Zero-Visibility Cops and Robber Game on a Graph.- On (k, l)-Graph Sandwich Problems.- Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints.- Two-Round Discrete Voronoi Game along a Line.- Inverse Maximum Flow Problems under the Combining Norms.- The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs.- A Cost-Efficient Scheduling Algorithm for Traffic Grooming.- Strategies of Groups Evacuation from a Convex Region in the Plane.- Kernelization and Lower Bounds of the Signed Domination Problem.- On Edge-Independent Sets.- On the Complexity of Approximate Sum of Sorted List.- Large Hypertree Width for Sparse Random Hypergraphs.- On Perfect Absorbants in De Bruijn Digraphs.- Multi-Multiway Cut Problem on Graphs of Bounded Branch Width.- Bi-criteria Scheduling on Multiple Machines Subject to Machine Availability Constraints.- Zero-Sum Flow Numbers of Hexagonal Grids.- Pattern-Guided k-Anonymity.
Автор: 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
Автор: Gebhard B?ckle; Wolfram Decker; Gunter Malle Название: Algorithmic and Experimental Methods in Algebra, Geometry, and Number Theory ISBN: 3319705652 ISBN-13(EAN): 9783319705651 Издательство: Springer Рейтинг: Цена: 139750.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This book presents state-of-the-art research and survey articles that highlight work done within the Priority Program SPP 1489 "Algorithmic and Experimental Methods in Algebra, Geometry and Number Theory", which was established and generously supported by the German Research Foundation (DFG) from 2010 to 2016.
Автор: L.A. Bokut`; G.P.. Kukin Название: Algorithmic and Combinatorial Algebra ISBN: 0792323130 ISBN-13(EAN): 9780792323136 Издательство: Springer Рейтинг: Цена: 102480.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This volume presents an authoritative overview of developments in algorithmic and combinatorial algebra which have been achieved during the past 40 years, with an emphasis on the results obtained by the Novosibirsk school of A.I. Mal`tchev and A.I. Shirshov and followers.
Автор: B.Heinrich Matzat; Gert-Martin Greuel; Gerhard His Название: Algorithmic Algebra and Number Theory ISBN: 3540646701 ISBN-13(EAN): 9783540646709 Издательство: Springer Рейтинг: Цена: 102480.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This text gives an overview on algorithmic methods and results obtained during the period 1991-1997 mainly in algebraic geometry, and group and representation theory.
Автор: J.L. Bueso; Jos? G?mez-Torrecillas; A. Verschoren Название: Algorithmic Methods in Non-Commutative Algebra ISBN: 9048163285 ISBN-13(EAN): 9789048163281 Издательство: Springer Рейтинг: Цена: 93160.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: The already broad range of applications of ring theory has been enhanced in the eighties by the increasing interest in algebraic structures of considerable complexity, the so-called class of quantum groups. One of the fundamental properties of quantum groups is that they are modelled by associative coordinate rings possessing a canonical basis, which allows for the use of algorithmic structures based on Groebner bases to study them. This book develops these methods in a self-contained way, concentrating on an in-depth study of the notion of a vast class of non-commutative rings (encompassing most quantum groups), the so-called Poincar -Birkhoff-Witt rings. We include algorithms which treat essential aspects like ideals and (bi)modules, the calculation of homological dimension and of the Gelfand-Kirillov dimension, the Hilbert-Samuel polynomial, primality tests for prime ideals, etc.
Автор: L.A. Bokut`; G.P.. Kukin Название: Algorithmic and Combinatorial Algebra ISBN: 9401048843 ISBN-13(EAN): 9789401048842 Издательство: Springer Рейтинг: Цена: 93160.00 T Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Murty Katta Gopalakrishna Название: Computational And Algorithmic Linear Algebra And N-Dimensional Geometry ISBN: 9814366625 ISBN-13(EAN): 9789814366625 Издательство: World Scientific Publishing Рейтинг: Цена: 111930.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Deals with Linear Algebra and n-Dimensional Geometry. This title is suitable for sophomore level undergraduates in mathematics, engineering, business, and the sciences.
Казахстан, 010000 г. Астана, проспект Туран 43/5, НП2 (офис 2) ТОО "Логобук" Тел:+7 707 857-29-98 ,+7(7172) 65-23-70 www.logobook.kz
