Algorithmic Language and Program Development, H. Partsch; F.L. Bauer; P. Pepper; H. W?ssner
Автор: 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 Рейтинг: Цена: 12577.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Adriaan van van Wijngaarden Название: Report of Algorithmic Language ALGOL 68 ISBN: 366238647X ISBN-13(EAN): 9783662386477 Издательство: Springer Рейтинг: Цена: 11598.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: A. Ershov; C.H.A. Koster Название: Methods of Algorithmic Language Implementation ISBN: 3540080651 ISBN-13(EAN): 9783540080657 Издательство: Springer Рейтинг: Цена: 9781.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 Рейтинг: Цена: 13974.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Patrice Perny; Marc Pirlot; Alexis Tsouki?s Название: Algorithmic Decision Theory ISBN: 3642415741 ISBN-13(EAN): 9783642415746 Издательство: Springer Рейтинг: Цена: 6986.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 Рейтинг: Цена: 6429.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 Рейтинг: Цена: 9781.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.
Автор: Peter A. Fritzson Название: Automated and Algorithmic Debugging ISBN: 3540574174 ISBN-13(EAN): 9783540574170 Издательство: Springer Рейтинг: Цена: 11179.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Presents the latest research on methods for the automated debugging of software. Emphasis is placed on advances made in knowledge-based program debugging and in other approaches to automated debugging based on static and dynamic program slicing.
Автор: Ulrich Faigle; W. Kern; G. Still Название: Algorithmic Principles of Mathematical Programming ISBN: 9048161177 ISBN-13(EAN): 9789048161171 Издательство: Springer Рейтинг: Цена: 12157.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Algorithmic Principles of Mathematical Programming investigates the mathematical structures and principles underlying the design of efficient algorithms for optimization problems. Recent advances in algorithmic theory have shown that the traditionally separate areas of discrete optimization, linear programming, and nonlinear optimization are closely linked. This book offers a comprehensive introduction to the whole subject and leads the reader to the frontiers of current research. The prerequisites to use the book are very elementary. All the tools from numerical linear algebra and calculus are fully reviewed and developed. Rather than attempting to be encyclopedic, the book illustrates the important basic techniques with typical problems. The focus is on efficient algorithms with respect to practical usefulness. Algorithmic complexity theory is presented with the goal of helping the reader understand the concepts without having to become a theoretical specialist. Further theory is outlined and supplemented with pointers to the relevant literature. The book is equally suited for self-study for a motivated beginner and for a comprehensive course on the principles of mathematical programming within an applied mathematics or computer science curriculum at advanced undergraduate or graduate level. The presentation of the material is such that smaller modules on discrete optimization, linear programming, and nonlinear optimization can easily be extracted separately and used for shorter specialized courses on these subjects.
Описание: The papers gathered in this book were published over a period of more than twenty years in widely scattered journals. They led to the discovery of randomness in arithmetic which was presented in the recently published monograph on "Algorithmic Information Theory" by the author. There the strongest possible version of G del's incompleteness theorem, using an information-theoretic approach based on the size of computer programs, was discussed. The present book is intended as a companion volume to the monograph and it will serve as a stimulus for work on complexity, randomness and unpredictability, in physics and biology as well as in metamathematics.
Автор: Theodore J. Saclarides, Jonathan A. Myers, Keith Название: Common Surgical Diseases An Algorithmic Approach to Problem Solving ISBN: 1493915649 ISBN-13(EAN): 9781493915644 Издательство: Springer Рейтинг: Цена: 20962.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.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
