Контакты/Проезд  Доставка и Оплата Помощь/Возврат
История
  +7(495) 980-12-10
  пн-пт: 10-18 сб,вс: 11-18
  shop@logobook.ru
   
    Поиск книг                    Поиск по списку ISBN Расширенный поиск    
Найти
  Зарубежные издательства Российские издательства  
Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Акции | Хиты | |
 

Algorithmic Differentiation of Pragma-Defined Parallel Regions, Michael F?rster


Варианты приобретения
Цена: 10448.00р.
Кол-во:
Наличие: Поставка под заказ.  Есть в наличии на складе поставщика.
Склад Америка: Есть  
При оформлении заказа до: 2025-07-28
Ориентировочная дата поставки: Август-начало Сентября
При условии наличия книги у поставщика.

Добавить в корзину
в Мои желания

Автор: Michael F?rster
Название:  Algorithmic Differentiation of Pragma-Defined Parallel Regions
ISBN: 9783658075965
Издательство: Springer
Классификация:



ISBN-10: 3658075961
Обложка/Формат: Paperback
Страницы: 405
Вес: 0.55 кг.
Дата издания: 23.10.2014
Язык: English
Размер: 210 x 148 x 24
Основная тема: Computer Science
Подзаголовок: Differentiating Computer Programs Containing OpenMP
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии
Описание: Numerical programs often use parallel programming techniques such as OpenMP to compute the program`s output values as efficient as possible. In addition, derivative values of these output values with respect to certain input values play a crucial role.


Information, Randomness & Incompleteness: Papers On Algorithmic Information Theory

Автор: Chaitin Gregory J
Название: Information, Randomness & Incompleteness: Papers On Algorithmic Information Theory
ISBN: 9971504790 ISBN-13(EAN): 9789971504793
Издательство: World Scientific Publishing
Рейтинг:
Цена: 19166.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 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.

Recent Advances in Algorithmic Differentiation

Автор: Shaun Forth; Paul Hovland; Eric Phipps; Jean Utke;
Название: Recent Advances in Algorithmic Differentiation
ISBN: 3642439918 ISBN-13(EAN): 9783642439919
Издательство: Springer
Рейтинг:
Цена: 23058.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The proceedings represent the state of knowledge in the area of algorithmic differentiation (AD). The 31 contributed papers presented at the AD2012 conference cover the application of AD to many areas in science and engineering as well as aspects of AD theory and its implementation in tools.

Algorithmic Game Theory

Автор: 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.

Algorithmic Aspects of Wireless Sensor Networks

Автор: 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
   В Контакте     В Контакте Мед  Мобильная версия