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

Stochastic Approximation and Recursive Algorithms and Applications, Kushner Harold J., Yin G. George



Варианты приобретения
Цена: 17324р.
Кол-во:
 о цене
Наличие: Отсутствует. Возможна поставка под заказ.

При оформлении заказа до: 19 июл 2022
Ориентировочная дата поставки: Август
При условии наличия книги у поставщика.

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

Автор: Kushner Harold J., Yin G. George
Название:  Stochastic Approximation and Recursive Algorithms and Applications
ISBN: 9780387008943
Издательство: Springer
Классификация:
ISBN-10: 0387008942
Обложка/Формат: Hardback
Страницы: 496
Вес: 0.906 кг.
Дата издания: 15.08.2003
Серия: Stochastic Modelling and Applied Probability
Язык: English
Издание: 2nd ed. 2003
Иллюстрации: 31 black & white illustrations, 9 black & white tables, 31 black & white line drawings
Размер: 234 x 164 x 33
Читательская аудитория: Postgraduate, research & scholarly
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии
Дополнительное описание: Формат: 235x155
Илюстрации: 31
Круг читателей: Researchers, graduate students
Ключевые слова:
Язык: eng
Издание: 2nd ed.





      Старое издание

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

Автор: Chandra Chekuri; Klaus Jansen; Jos? D.P. Rolim; Lu
Название: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3540282394 ISBN-13(EAN): 9783540282396
Издательство: Springer
Рейтинг:
Цена: 11549 р.
Наличие на складе: Поставка под заказ.

Описание: Contains 41 reviewed papers, selected by the two program committees from a total of 101 submissions. Among the issues addressed are design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, and more.

Approximation and Online Algorithms / Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers

Автор: Persiano Giuseppe, Solis-Oba Roberto
Название: Approximation and Online Algorithms / Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers
ISBN: 354024574X ISBN-13(EAN): 9783540245742
Издательство: Springer
Рейтинг:
Цена: 8661 р.
Наличие на складе: Поставка под заказ.

Описание: This book constitutes the thoroughly refereed post proceedings of the Second International Workshop on Approximation and Online Algorithms, WAOA 2004, held in Bergen, Norway in September 2004.The 21 revised full papers presented together with 2 invited papers were carefully selected during two rounds of reviewing and improvement from 47 submissions. WAOA is devoted to the design and analysis of algorithms for online and computationally hard problems. Among the topics addressed are applications to game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric computations, inapproximability results, mechanism design, network design, routing, packing and covering, paradigms, randomization techniques, and scheduling problems.

Approximation and Online Algorithms / 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers

Автор: Erlebach Thomas, Kaklamanis Christos
Название: Approximation and Online Algorithms / 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers
ISBN: 3540695133 ISBN-13(EAN): 9783540695134
Издательство: Springer
Рейтинг:
Цена: 8661 р.
Наличие на складе: Поставка под заказ.

Описание: This book constitutes the thoroughly refereed post proceedings of the 4th International Workshop on Approximation and Online Algorithms, WAOA 2006, held in Zurich, Switzerland in September 2006 as part of the ALGO 2006 conference event.The 26 revised full papers presented were carefully reviewed and selected from 62 submissions. Topics addressed by the workshop are algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms, randomization techniques, real-world applications, and scheduling problems.

Stochastic approximation

Автор: Borkar, Vivek S.
Название: Stochastic approximation
ISBN: 0521515920 ISBN-13(EAN): 9780521515924
Издательство: Cambridge Academ
Рейтинг:
Цена: 7120 р.
Наличие на складе: Поставка под заказ.

Описание: This simple, compact toolkit for designing and analyzing stochastic approximation algorithms requires only basic literacy in probability and differential equations. Yet these algorithms have powerful applications in control and communications engineering, artificial intelligence and economic modelling. The dynamical systems viewpoint treats an algorithm as a noisy discretization of a limiting differential equation and argues that, under reasonable hypotheses, it tracks the asymptotic behaviour of the differential equation with probability one. The differential equation, which can usually be obtained by inspection, is easier to analyze. Novel topics include finite-time behaviour, multiple timescales and asynchronous implementation. There is a useful taxonomy of applications, with concrete examples from engineering and economics. Notably it covers variants of stochastic gradient-based optimization schemes, fixed-point solvers, which are commonplace in learning algorithms for approximate dynamic programming, and some models of collective behaviour. Three appendices give background on differential equations and probability.

Approximation Algorithms and Semidefinite Programming

Автор: G?rtner, Matousek
Название: Approximation Algorithms and Semidefinite Programming
ISBN: 3642220142 ISBN-13(EAN): 9783642220142
Издательство: Springer
Рейтинг:
Цена: 8084 р.
Наличие на складе: Поставка под заказ.

Описание: Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimization, approximation algorithms, computational complexity, graph theory, geometry, real algebraic geometry and quantum computing. This book is an introduction to selected aspects of semidefinite programming and its use in approximation algorithms. It covers the basics but also a significant amount of recent and more advanced material.  There are many computational problems, such as MAXCUT, for which one cannot reasonably expect to obtain an exact solution efficiently, and in such case, one has to settle for approximate solutions. For MAXCUT and its relatives, exciting recent results suggest that semidefinite programming is probably the ultimate tool. Indeed, assuming the Unique Games Conjecture, a plausible but as yet unproven hypothesis, it was shown that for these problems, known algorithms based on semidefinite programming deliver the best possible approximation ratios among all polynomial-time algorithms. This book follows the “semidefinite side” of these developments, presenting some of the main ideas behind approximation algorithms based on semidefinite programming. It develops the basic theory of semidefinite programming, presents one of the known efficient algorithms in detail, and describes the principles of some others. It also includes applications, focusing on approximation algorithms.

Efficient Approximation and Online Algorithms / Recent Progress on Classical Combinatorial Optimization Problems and New Applications

Автор: Bampis Evripidis, Jansen Klaus, Kenyon Claire
Название: Efficient Approximation and Online Algorithms / Recent Progress on Classical Combinatorial Optimization Problems and New Applications
ISBN: 3540322124 ISBN-13(EAN): 9783540322122
Издательство: Springer
Цена: 8661 р.
Наличие на складе: Поставка под заказ.

Описание: This book provides a good opportunity for computer science practitioners and researchers to get in sync with the current state-of-the-art and future trends in the field of combinatorial optimization and online algorithms. Recent advances in this area are presented focusing on the design of efficient approximation and on-line algorithms. One central idea in the book is to use a linear program relaxation of the problem, randomization and rounding techniques.This state-of-the-art survey contains 11 carefully selected papers that cover some classical problems of scheduling, of packing, and of graph theory, but also new optimization problems arising in various applications like networks, data mining or classification.

Approximation Theory and Approximation Practice

Автор: Trefethen
Название: Approximation Theory and Approximation Practice
ISBN: 1611972396 ISBN-13(EAN): 9781611972399
Издательство: Eurospan
Рейтинг:
Цена: 8053 р.
Наличие на складе: Невозможна поставка.

Описание: In a book that will appeal to beginners and experts alike, Oxford University’s Nick Trefethen presents approximation theory using a fresh approach for this established field.Approximation Theory and Approximation Practice is a textbook on classical polynomial and rational approximation theory for the twenty-first century. It uses MATLAB? to teach the field’s most important ideas and results and differs fundamentally from other works on approximation theory in a number of ways: its emphasis is on topics close to numerical algorithms; concepts are illustrated with Chebfun; and each chapter is a PUBLISHable Matlab M-file, available online.In addition, the book centers on theorems and methods for analytic functions, which appear so often in applications, rather than on functions at the edge of discontinuity with their seductive theoretical challenges. Original sources are cited rather than textbooks, and each item in the bibliography is accompanied by an editorial comment.Each chapter has a collection of exercises, which span a wide range from mathematical theory to Chebfun-based numerical experimentation.

Recursive Partitioning and Applications

Автор: Zhang
Название: Recursive Partitioning and Applications
ISBN: 0387986715 ISBN-13(EAN): 9780387986715
Издательство: Springer
Цена: 10389 р.
Наличие на складе: Поставка под заказ.

Описание: Describes the recursive partitioning methodology and demonstrates its effectiveness as a response to the challenge of analyzing and interpreting multiple complex pathways to many illnesses, diseases, and ultimately death. This book presents and applies the standard regression methods in the examples for comparison purposes.

Recursive Partitioning and Applications

Автор: Zhang
Название: Recursive Partitioning and Applications
ISBN: 1441968237 ISBN-13(EAN): 9781441968234
Издательство: Springer
Рейтинг:
Цена: 15014 р.
Наличие на складе: Поставка под заказ.

Описание: The routes to many important outcomes including diseases and ultimately death as well as financial credit consist of multiple complex pathways containing interrelated events and conditions. This book focuses on recursive partitioning strategies as a response to the challenge of pathway characterization.

Super-Recursive Algorithms

Автор: Burgin Mark
Название: Super-Recursive Algorithms
ISBN: 0387955690 ISBN-13(EAN): 9780387955698
Издательство: Springer
Рейтинг:
Цена: 19056 р.
Наличие на складе: Поставка под заказ.

Описание: New discoveries about algorithms are leading scientists beyond the Church-Turing Thesis, which governs the "algorithmic universe" and asserts the conventionality of recursive algorithms. A new paradigm for computation, the super-recursive algorithm, offers promising prospects for algorithms of much greater computing power and efficiency.Super-Recursive Algorithms provides an accessible, focused examination of the theory of super-recursive algorithms and its ramifications for the computer industry, networks, artificial intelligence, embedded systems, and the Internet. The book demonstrates how these algorithms are more appropriate as mathematical models for modern computers, and how these algorithms present a better framework for computing methods in such areas as numerical analysis, array searching, and controlling and monitoring systems. In addition, a new practically-oriented perspective on the theory of algorithms, computation, and automata, as a whole, is developed. Problems of efficiency, software development, parallel and distributed processing, pervasive and emerging computation, computer architecture, machine learning, brain modeling, knowledge discovery, and intelligent systems are addressed.Topics and Features:* Encompasses and systematizes all main classes of super-recursive algorithms and the theory behind them* Examines the theory's basis as a foundation for advancements in computing, information science, and related technologies* Encompasses and systematizes all main types of mathematical models of algorithms* Highlights how super-recursive algorithms pave the way for more advanced design, utilization, and maintenance of computers* Examines and restructures the existing variety of mathematical models of complexity of algorithms and computation, introducing new models* Possesses a comprehensive bibliography and indexThis clear exposition, motivated by numerous examples and illustrations, serves to develop a new paradigm for complex, high-performance computing based on both partial recursive functions and more inclusive recursive algorithms. Researchers and advanced students interested in theory of computation and algorithms will find the book an essential resource for an important new class of algorithms.

Mathematical Analysis, Approximation Theory and Their Applications

Автор: Rassias
Название: Mathematical Analysis, Approximation Theory and Their Applications
ISBN: 3319312790 ISBN-13(EAN): 9783319312798
Издательство: Springer
Рейтинг:
Цена: 19056 р.
Наличие на складе: Поставка под заказ.

Описание: Designed for graduate students, researchers, and engineers in mathematics, optimization, and economics, this self-contained volume presents theory, methods, and applications in mathematical analysis and approximation theory. Specific topics include: approximation of functions by linear positive operators with applications to computer aided geometric design, numerical analysis, optimization theory, and solutions of differential equations. Recent and significant developments in approximation theory, special functions and q-calculus along with their applications to mathematics, engineering, and social sciences are discussed and analyzed. Each chapter enriches the understanding of current research problems and theories in pure and applied research.

Approximation and Online Algorithms

Автор: Evripidis Bampis; Klaus Jansen
Название: Approximation and Online Algorithms
ISBN: 3642124496 ISBN-13(EAN): 9783642124495
Издательство: Springer
Рейтинг:
Цена: 8084 р.
Наличие на складе: Поставка под заказ.

Описание: Constitutes the refereed post workshop proceedings of the 7th International Workshop on Approximation and Online Algorithms, WAOA 2009, held in Copenhagen, Denmark, in September 2009 as part of the ALGO 2009 conference event.


ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
   В Контакте     В Контакте Мед  Мобильная версия