Algorithmic Aspects in Information and Management, Ni
Автор: Daniel J. Velleman Название: How to Prove It : A Structured Approach ISBN: 1108439535 ISBN-13(EAN): 9781108439534 Издательство: Cambridge Academ Рейтинг: Цена: 5861.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Proofs play a central role in advanced mathematics and theoretical computer science, and this bestselling text`s third edition will help students transition from solving problems to proving theorems by teaching them the techniques needed to read and write proofs, with a new chapter on number theory and over 150 new exercises.
Автор: Christopher M. Bishop Название: Pattern Recognition and Machine Learning ISBN: 1493938436 ISBN-13(EAN): 9781493938438 Издательство: Springer Рейтинг: Цена: 10480.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Familiarity with multivariate calculus and basic linear algebra is required, and some experience in the use of probabilities would be helpful though not essential as the book includes a self-contained introduction to basic probability theory.
Автор: 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.
Автор: 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.
Автор: Peter Seibt Название: Algorithmic Information Theory ISBN: 3642069789 ISBN-13(EAN): 9783642069789 Издательство: Springer Рейтинг: Цена: 25853.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Algorithmic Information Theory treats the mathematics of many important areas in digital information processing. It has been written as a read-and-learn book on concrete mathematics, for teachers, students and practitioners in electronic engineering, computer science and mathematics.
Автор: Cristian S. Calude Название: Information and Randomness ISBN: 3642077935 ISBN-13(EAN): 9783642077937 Издательство: Springer Рейтинг: Цена: 11173.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The first edition of the monograph Information and Randomness: An Algorithmic Perspective by Crist ian Calude was published in 1994. In my Foreword I said: "The research in algorithmic information theory is already some 30 years old. However, only the recent years have witnessed a really vigorous growth in this area. . . . The present book by Calude fits very well in our series. Much original research is presented. . . making the approach richer in consequences than the classical one. Remarkably, however, the text is so self-contained and coherent that the book may also serve as a textbook. All proofs are given in the book and, thus, it is not necessary to consult other sources for classroom instruction. " The vigorous growth in the study of algorithmic information theory has continued during the past few years, which is clearly visible in the present second edition. Many new results, examples, exercises and open prob- lems have been added. The additions include two entirely new chapters: "Computably Enumerable Random Reals" and "Randomness and Incom- pleteness". The really comprehensive new bibliography makes the book very valuable for a researcher. The new results about the characterization of computably enumerable random reals, as well as the fascinating Omega Numbers, should contribute much to the value of the book as a textbook. The author has been directly involved in these results that have appeared in the prestigious journals Nature, New Scientist and Pour la Science.
Автор: Dobrushkin, Vladimir A. Название: Methods in algorithmic analysis ISBN: 1138118044 ISBN-13(EAN): 9781138118041 Издательство: Taylor&Francis Рейтинг: Цена: 12095.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
Explores the Impact of the Analysis of Algorithms on Many Areas within and beyond Computer Science A flexible, interactive teaching format enhanced by a large selection of examples and exercises
Developed from the author's own graduate-level course, Methods in Algorithmic Analysis presents numerous theories, techniques, and methods used for analyzing algorithms. It exposes students to mathematical techniques and methods that are practical and relevant to theoretical aspects of computer science.
After introducing basic mathematical and combinatorial methods, the text focuses on various aspects of probability, including finite sets, random variables, distributions, Bayes' theorem, and Chebyshev inequality. It explores the role of recurrences in computer science, numerical analysis, engineering, and discrete mathematics applications. The author then describes the powerful tool of generating functions, which is demonstrated in enumeration problems, such as probabilistic algorithms, compositions and partitions of integers, and shuffling. He also discusses the symbolic method, the principle of inclusion and exclusion, and its applications. The book goes on to show how strings can be manipulated and counted, how the finite state machine and Markov chains can help solve probabilistic and combinatorial problems, how to derive asymptotic results, and how convergence and singularities play leading roles in deducing asymptotic information from generating functions. The final chapter presents the definitions and properties of the mathematical infrastructure needed to accommodate generating functions.
Accompanied by more than 1,000 examples and exercises, this comprehensive, classroom-tested text develops students' understanding of the mathematical methodology behind the analysis of algorithms. It emphasizes the important relation between continuous (classical) mathematics and discrete mathematics, which is the basis of computer science.
Автор: Xiaotie Deng Название: Algorithmic Game Theory ISBN: 3319996592 ISBN-13(EAN): 9783319996592 Издательство: Springer Рейтинг: Цена: 8104.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 11th International Symposium on Algorithmic Game Theory, SAGT 2018, held in Beijing, China, in September 2018.The 19 full papers presented together with 6 short papers and 5 plenary talks were carefully reviewed and selected from 54 submissions. The papers cover various important aspects of algorithmic game theory including market equilibrium, auctions and applications, two sided markets, cake-cutting, cooperative games, voting games, multi-agent scheduling, price of stability, various mechanism design problems: online-dynamics and multi-stages as well as revenue maximization and resource allocation and applications.
This book is the first one that provides a solid bridge between algorithmic information theory and statistical mechanics. Algorithmic information theory (AIT) is a theory of program size and recently is also known as algorithmic randomness. AIT provides a framework for characterizing the notion of randomness for an individual object and for studying it closely and comprehensively. In this book, a statistical mechanical interpretation of AIT is introduced while explaining the basic notions and results of AIT to the reader who has an acquaintance with an elementary theory of computation.
A simplification of the setting of AIT is the noiseless source coding in information theory. First, in the book, a statistical mechanical interpretation of the noiseless source coding scheme is introduced. It can be seen that the notions in statistical mechanics such as entropy, temperature, and thermal equilibrium are translated into the context of noiseless source coding in a natural manner.
Then, the framework of AIT is introduced. On this basis, the introduction of a statistical mechanical interpretation of AIT is begun. Namely, the notion of thermodynamic quantities, such as free energy, energy, and entropy, is introduced into AIT. In the interpretation, the temperature is shown to be equal to the partial randomness of the values of all these thermodynamic quantities, where the notion of partial randomness is a stronger representation of the compression rate measured by means of program-size complexity. Additionally, it is demonstrated that this situation holds for the temperature itself as a thermodynamic quantity. That is, for each of all the thermodynamic quantities above, the computability of its value at temperature T gives a sufficient condition for T to be a fixed point on partial randomness.
In this groundbreaking book, the current status of the interpretation from both mathematical and physical points of view is reported. For example, a total statistical mechanical interpretation of AIT that actualizes a perfect correspondence to normal statistical mechanics can be developed by identifying a microcanonical ensemble in the framework of AIT. As a result, the statistical mechanical meaning of the thermodynamic quantities of AIT is clarified. In the book, the close relationship of the interpretation to Landauer's principle is pointed out.
Автор: Dimitris Fotakis; Evangelos Markakis Название: Algorithmic Game Theory ISBN: 3030304728 ISBN-13(EAN): 9783030304720 Издательство: Springer Рейтинг: Цена: 9222.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 12th International Symposium on Algorithmic Game Theory, SAGT 2019, held in Athens, Greece, in September/October 2019.The 25 full papers presented together with 3 invited talks and one abstract paper were carefully reviewed and selected from 55 submissions. The papers are organized in topical sections named: Algorithmic Mechanism Design; Auctions and Markets; Computational Aspects of Games; Network Games and Congestion Games; Social Choice; and Matchings and Fair Division.
Автор: Vasily Popovich; Jean-Claude Thill; Manfred Schren Название: Information Fusion and Intelligent Geographic Information Systems ISBN: 3030316076 ISBN-13(EAN): 9783030316075 Издательство: Springer Рейтинг: Цена: 13974.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book gathers the proceedings of the 9th International Symposium "Information Fusion and Intelligent Geographic Information Systems 2019" (IF&IGIS`2019), which was held in St. Petersburg, Russia from May 22 to 24, 2019.
Автор: 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.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
