Описание: 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.
Автор: Barthelemy, Jean-Pierre. Название: Algorithmic Complexity and Telecommunication Problems ISBN: 1857284518 ISBN-13(EAN): 9781857284515 Издательство: Taylor&Francis Рейтинг: Цена: 11942.00 р. Наличие на складе: Поставка под заказ.
Описание: In this treatment of algorithmic complexity the authors explore an area fundamental to the study of the foundations of computer science. It is a topic which is at the interface of information theory, applied mathematics and computer language theory and which is rooted strongly in this book in the problems of computer communication.; Complexity theory classifies problems according to the difficulty of resolving them, while algorithms provide the computational method for solving those problems. Therefore, algorithmic complexity is concerned with establishing the best algorithm given the constraints of the computational environment and the degree of complexity.; The first three chapters present the context for a later in-depth look at applied areas of the subject, with an outline of classical complexity theory. This is followed by three chapters which explore the key area of information communication. Within this field, the book is particularly concerned with two contiguous areas which make contrasting demands on the application of algorithmic complexity. Cryptography demands the creation of extremely complex problems in order to achieve its goal of security, whereas in coding for communication the emphasis is on maximizing the compact nature of the message and providing the error correction necessary for the message to achieve optimum speed. The two must co-exist and the methods outlined in Algorithmic Complexity suggest a number of approaches to such problems based on extensive examples of the authors' experience.; This senior undergraduate book should be an essential read for those studying advanced topics in theoretical computer science and should provide an introduction to applied complexity for researchers and professionals alike.
Автор: Alexey Sorokin; Panos M. Pardalos Название: Dynamics of Information Systems: Algorithmic Approaches ISBN: 1489989404 ISBN-13(EAN): 9781489989406 Издательство: Springer Рейтинг: Цена: 16769.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Dynamics of Information Systems: Algorithmic Approaches presents recent developments and results found by participants of the Fourth International Conference on the Dynamics of Information Systems, which took place at the University of Florida, Gainesville FL, USA on February 20-22, 2012.
Автор: Alexey Sorokin; Panos M. Pardalos Название: Dynamics of Information Systems: Algorithmic Approaches ISBN: 1461475813 ISBN-13(EAN): 9781461475811 Издательство: Springer Рейтинг: Цена: 20962.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Dynamics of Information Systems: Algorithmic Approaches presents recent developments and results found by participants of the Fourth International Conference on the Dynamics of Information Systems, which took place at the University of Florida, Gainesville FL, USA on February 20-22, 2012.
Автор: 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.
Автор: Andrew Goldberg; Yunhong Zhou Название: Algorithmic Aspects in Information and Management ISBN: 3642021573 ISBN-13(EAN): 9783642021572 Издательство: Springer Рейтинг: Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the proceedings of the 5th International Conference on Algorithmic Aspects in Information Management, AAIM 2009, held in San Francisco, CA, USA, in June 2009. This book presents 25 papers together with the abstracts of two invited talks that were reviewed and selected for inclusion.
Автор: Shlomi Dolev Название: Algorithmic Aspects of Wireless Sensor Networks ISBN: 3642054331 ISBN-13(EAN): 9783642054334 Издательство: Springer Рейтинг: Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the reviewed proceedings of the 5th International Workshop on Algorithmic Aspects of Wireless Sensor Networks, ALGOSENSORS 2009, held in Rhodes, Greece, July 10-11, 2009. This workshops aimed at bringing together research contributions related to diverse algorithmic and complexity-theoretic aspects of wireless sensor networks.
Автор: Ricard Gavalda; Gabor Lugosi; Thomas Zeugmann; San Название: Algorithmic Learning Theory ISBN: 3642044131 ISBN-13(EAN): 9783642044137 Издательство: Springer Рейтинг: Цена: 12577.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The papers are divided into topical sections of papers on online learning, learning graphs, active learning and query learning, statistical learning, inductive inference, and semisupervised and unsupervised learning.
Автор: 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.
Автор: 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.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
