Автор: 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.
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.
Автор: Terzidis Название: Algorithmic Architecture ISBN: 0750667257 ISBN-13(EAN): 9780750667258 Издательство: Taylor&Francis Рейтинг: Цена: 8573.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.
Автор: Marios Mavronicolas; Maria Papadoupoulou Название: Algorithmic Game Theory ISBN: 3642046444 ISBN-13(EAN): 9783642046445 Издательство: Springer Рейтинг: Цена: 10480.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This volume contains the papers presented at the Second International Sym- sium on Algorithmic Game Theory (SAGT 2009), which was held on October 18-20, 2009, in Paphos, Cyprus. This event followed the ?rst, very successful SAGT symposium, which took place in Paderborn, Germany, last year. The purpose of SAGT is to bring together researchers from computer s- ence, economics and mathematics to present and discuss originalresearchat the intersection of algorithms and game theory. It has been intended to cover all important areas such as solution concepts, game classes, computation of equil- riaandmarketequilibria, algorithmicmechanismdesign, automatedmechanism design, convergenceandlearningingames, complexityclassesingametheory, - gorithmicaspectsof?xed-pointtheorems, mechanisms, incentivesandcoalitions, cost-sharing algorithms, computational problems in economics, ?nance, decision theory and pricing, computational social choice, auction algorithms, price of - archyand its relatives, representationsof games and their complexity, economic aspects of distributed computing and the internet, congestion, routing and n- work design and formation games and game-theoretic approaches to networking problems. Approximately55submissionstoSAGT2009 werereceived.Eachsubmission was reviewed by at least three Program Committee members. The Program Committee decided to accept 29 papers. Out of these, a small number will be invited to a Special Issue of the Theory of Computing Systems journal with selected papers from SAGT 2009. The program of SAGT 2009 featured three invited talks from three outstanding researchers in algorithmic game theory: Elias Koutsoupias, Dov Monderer and Mihalis Yannakakis. We are very grateful toElias, DovandMihalisforjoiningusinPaphosandfortheirexcellentlectures.
Автор: Vittorio Bil?; Michele Flammini Название: Algorithmic Game Theory ISBN: 3319666991 ISBN-13(EAN): 9783319666990 Издательство: Springer Рейтинг: Цена: 9083.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 10th International Symposium on Algorithmic Game Theory, SAGT 2017, held in L`Aquila, Italy, in September 2017. The 30 full papers presented were carefully reviewed and selected from 66 submissions.
Автор: Edited by Noam Nisan Название: Algorithmic Game Theory ISBN: 0521872820 ISBN-13(EAN): 9780521872829 Издательство: Cambridge Academ Рейтинг: Цена: 9821.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: More than 40 of the top researchers in this field have written chapters that go from the foundations to the state of the art. Basic chapters on algorithmic methods for equilibria, mechanism design and combinatorial auctions are followed by chapters on incentives and pricing, cost sharing, information markets and cryptography and security.
Автор: Gairing Название: Algorithmic Game Theory ISBN: 3662533537 ISBN-13(EAN): 9783662533536 Издательство: Springer Рейтинг: Цена: 8106.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 9th International Symposium on Algorithmic Game Theory, SAGT 2016, held in Liverpool, UK, in September 2016.
The 26 full papers presented together with 2 one-page abstracts were carefully reviewed and selected from 62 submissions.
The accepted submissions cover various important aspects
of algorithmic game theory such as computational aspects of games, congestion games and networks, matching and voting, auctions and markets, and mechanism design.
Автор: Roughgarden Название: Twenty Lectures on Algorithmic Game Theory ISBN: 1107172667 ISBN-13(EAN): 9781107172661 Издательство: Cambridge Academ Рейтинг: Цена: 12197.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book gives students a quick and accessible introduction to many of the most important concepts in the field of algorithmic game theory. It demonstrates these concepts through case studies in online advertising, wireless spectrum auctions, kidney exchange, and network management.
Автор: Burkhard Monien; Ulf-Peter Schroeder Название: Algorithmic Game Theory ISBN: 3540793089 ISBN-13(EAN): 9783540793083 Издательство: Springer Рейтинг: Цена: 10480.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: First International Symposium SAGT 2008 Paderborn Germany April 30 - May 2 2008 Proceedings.
Автор: Roughgarden Название: Twenty Lectures on Algorithmic Game Theory ISBN: 131662479X ISBN-13(EAN): 9781316624791 Издательство: Cambridge Academ Рейтинг: Цена: 5702.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book gives students a quick and accessible introduction to many of the most important concepts in the field of algorithmic game theory. It demonstrates these concepts through case studies in online advertising, wireless spectrum auctions, kidney exchange, and network management.
Автор: Martin Hoefer Название: Algorithmic Game Theory ISBN: 3662484323 ISBN-13(EAN): 9783662484326 Издательство: Springer Рейтинг: Цена: 6708.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 8th International Symposium on Algorithmic Game Theory, SAGT 2015, held in Saarbrucken, Germany, in September 2015. The 22 full papers presented together with one extended abstract and 6 brief announcements were carefully reviewed and selected from 63 submissions.
Автор: Ron Lavi Название: Algorithmic Game Theory ISBN: 3662448025 ISBN-13(EAN): 9783662448021 Издательство: Springer Рейтинг: Цена: 7826.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Matching theory.- Game dynamics.- Games of coordination.- Networks and social choice.- Markets and auctions.- Price of anarchy.- Computational aspects of games.- Mechanism design and auctions.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
