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: 364261809X ISBN-13(EAN): 9783642618093 Издательство: Springer Рейтинг: Цена: 7317.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The title of this book contains the words ALGORITHMIC LANGUAGE, in the singular. This is meant to convey the idea that it deals not so much with the diversity of program- ming languages, but rather with their commonalities. The task of formal program develop- It allows classifying ment proved to be the ideal frame for demonstrating this unity. concepts and distinguishing fundamental notions from notational features; and it leads immediately to a systematic disposition. This approach is supported by didactic, practical, and theoretical considerations. The clarity of the structure of a programming language de- signed according to the principles of program transformation is remarkable. Of course there are various notations for such a language. The notation used in this book is mainly oriented towards ALGOL 68, but is also strongly influenced by PASCAL - it could equally well have been the other way round. In the appendices there are occa- sional references to the styles used in ALGOL, PASCAL, LISP, and elsewhere.
Автор: 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.
Автор: 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.
Автор: 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 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: A. Ershov; C.H.A. Koster Название: Methods of Algorithmic Language Implementation ISBN: 3540080651 ISBN-13(EAN): 9783540080657 Издательство: Springer Рейтинг: Цена: 8537.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: 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 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Patrice Perny; Marc Pirlot; Alexis Tsouki?s Название: Algorithmic Decision Theory ISBN: 3642415741 ISBN-13(EAN): 9783642415746 Издательство: Springer Рейтинг: Цена: 6097.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
Two Agents Competing for a Shared Machine.- Identification of a 2-Additive Bi-Capacity by Using Mathematical Programming.- How to Put through Your Agenda in Collective Binary Decisions.- Exact Approaches for Parameter Elicitation in Lexicographic Ordering.- Possible Winners in Approval Voting.- Computational Aspects of Manipulation and Control in Judgment Aggregation.- Property-Based Preferences in Abstract Argumentation.- Learning Multicriteria Utility Functions with Random Utility Models.- An Evolutionary Algorithm for the Biobjective Capacitated m-RingStar Problem.- Planning System for Emergency Services.- What Is a Decision Problem? Preliminary Statements.- Risk Information Extraction and Aggregation: Experimenting on Medline Abstracts.- How to Decrease the Degree of Envy in Allocations of Indivisible Goods.- Descriptive Profiles for Sets of Alternatives in Multiple Criteria Decision Aid.- Estimating Violation Risk for Fisheries Regulations.- Computing Convex Coverage Sets for Multi-objective Coordination Graphs.- Learning a Majority Rule Model from Large Sets of Assignment Examples.- Budgeted Personalized Incentive Approaches for Smoothing Congestion in Resource Networks.- Optimization Approaches for Solving Chance Constrained Stochastic Orienteering Problems.- Thompson Sampling for Bayesian Bandits with Resets.- Robust Optimization of Recommendation Sets with the Maximin Utility Criterion.- Possible Winner Problems on Partial Tournaments: A Parameterized Study.
Автор: Berthold V?cking Название: Algorithmic Game Theory ISBN: 3642413919 ISBN-13(EAN): 9783642413919 Издательство: Springer Рейтинг: Цена: 5611.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The Complexity of Fully Proportional Representation for Single-Crossing Electorates.- New Results on Equilibria in Strategic Candidacy.- Plurality Voting with Truth-Biased Agents.- Reliability Weighted Voting Games.- The Power of Mediation in an Extended El Farol Game.- Friend of My Friend: Network Formation with Two-Hop Benefit.- Load Rebalancing Games in Dynamic Systems with Migration Costs.- Stochastic Congestion Games with Risk-Averse Players.- Congestion Games with Player-Specific Costs Revisited.- Using Reputation Instead of Tolls in Repeated Selfish Routing with Incomplete Information.- Anti-coordination Games and Stable Graph Colorings.- Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree.- Cooperative Equilibria in Iterated Social Dilemmas.- Symmetries of Quasi-Values.- Dividing Connected Chores Fairly.- On Popular Random Assignments.- Scheduling a Cascade with Opposing Influences.- Designing Budget-Balanced Best-Response Mechanisms for Network Coordination Games.- Inefficiency of Games with Social Context.- Copula-Based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines.- Imperfect Best-Response Mechanisms.- Pricing Ad Slots with Consecutive Multi-unit Demand.
Автор: Klaus P. Jantke; Takeshi Shinohara; Thomas Zeugman Название: Algorithmic Learning Theory ISBN: 3540604545 ISBN-13(EAN): 9783540604549 Издательство: Springer Рейтинг: Цена: 8537.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: These conference proceedings cover current areas related to algorithmic learning theory, in particular the theory of machine learning, design and analysis of learning algorithms, computational logic aspects, inductive inference, learning via queries, and pattern recognition.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
