Information, Randomness & Incompleteness: Papers On Algorithmic Information Theory, Chaitin Gregory J
Автор: 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.
Автор: 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.
Автор: Sandor P. Fekete Название: Algorithmic Aspects of Wireless Sensor Networks ISBN: 3540928618 ISBN-13(EAN): 9783540928614 Издательство: Springer Рейтинг: Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Covers the proceedings of the Fourth International Workshop on Algorithmic Aspects of Wireless Sensor Networks, ALGOSENSORS 2008, held in Reykjavik, Iceland, Wroclaw, Poland, July 12, 2008. This book contains topics that include optimization problems, noise and probability, and robots and tours.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
