Algorithmic Language and Program Development, H. Partsch; F.L. Bauer; P. Pepper; H. W?ssner
Автор: Theodore J. Saclarides, Jonathan A. Myers, Keith Название: Common Surgical Diseases An Algorithmic Approach to Problem Solving ISBN: 1493915649 ISBN-13(EAN): 9781493915644 Издательство: Springer Рейтинг: Цена: 18294.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
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.
Автор: H. Partsch; F.L. Bauer; P. Pepper; H. W?ssner Название: Algorithmic Language and Program Development ISBN: 3540111484 ISBN-13(EAN): 9783540111481 Издательство: Springer Рейтинг: Цена: 7317.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Chan Ernie Название: Algorithmic Trading ISBN: 1118460146 ISBN-13(EAN): 9781118460146 Издательство: Wiley Рейтинг: Цена: 9504.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Автор: Terzidis Название: Algorithmic Architecture ISBN: 0750667257 ISBN-13(EAN): 9780750667258 Издательство: Taylor&Francis Рейтинг: Цена: 9033.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Автор: A. van Wijngaarden; B.J. Mailloux; J.E.L. Peck; C. Название: Revised Report on the Algorithmic Language Algol 68 ISBN: 3540075925 ISBN-13(EAN): 9783540075929 Издательство: Springer Рейтинг: Цена: 12196.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: A. Ershov; C.H.A. Koster Название: Methods of Algorithmic Language Implementation ISBN: 3540080651 ISBN-13(EAN): 9783540080657 Издательство: Springer Рейтинг: Цена: 8537.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Adriaan van van Wijngaarden; Barry J. Mailloux Название: Report on the Algorithmic Language ALGOL 68 ISBN: 3662386461 ISBN-13(EAN): 9783662386460 Издательство: Springer Рейтинг: Цена: 10976.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Adriaan van van Wijngaarden Название: Report of Algorithmic Language ALGOL 68 ISBN: 366238647X ISBN-13(EAN): 9783662386477 Издательство: Springer Рейтинг: Цена: 10122.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Such design tools hold the promise of raising the level of abstraction at which an integrated circuit is designed, thus releasing the current designers from many of the details of logic and circuit level design.
Автор: Javier Aramayona; Volker Diekert; Christopher J. L Название: Algorithmic and Geometric Topics Around Free Groups and Automorphisms ISBN: 3319609394 ISBN-13(EAN): 9783319609393 Издательство: Springer Рейтинг: Цена: 3048.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
This volume presents the lecture notes from the authors' three summer courses offered during the program "Automorphisms of Free Groups: Geometry, Topology, and Dynamics," held at the Centre de Recerca Matem tica (CRM) in Bellaterra, Spain.
The first two chapters present the basic tools needed, from formal language theory (regular and context-free languages, automata, rewriting systems, transducers, etc) and emphasize their connections to group theory, mostly relating to free and virtually-free groups. The material covered is sufficient to present full proofs of many of the existing interesting characterizations of virtually-free groups. In turn, the last chapter comprehensively describes Bonahon's construction of Thurston's compactification of Teichm ller space in terms of geodesic currents on surfaces. It also includes several intriguing extensions of the notion of geodesic current to various other, more general settings.
Автор: H. Levent Akin; Nancy M. Amato; Volkan Isler; A. F Название: Algorithmic Foundations of Robotics XI ISBN: 3319165941 ISBN-13(EAN): 9783319165943 Издательство: Springer Рейтинг: Цена: 19377.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This carefully edited volume is the outcome of the eleventh edition of the Workshop on Algorithmic Foundations of Robotics (WAFR), which is the premier venue showcasing cutting edge research in algorithmic robotics.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
