Поиск книг                    Поиск по списку ISBN Расширенный поиск    
  Зарубежные издательства Российские издательства  
   Авторы    Каталог книг    Издательства    Новинки    Учебная литература    Специальные предложения  Бестселлеры
 
 
Книги    
Logobook
Книги зарубежных издательств на иностранных языках
Logobook
Книги российских издательств
Logobook
Представительство в Казахстане
 
Вход в систему   
 
Регистрация  Забыли?
 
Информация   
Контакты/Адрес/Проезд
Корзина
Ваши заказы
Доставка и Оплата
Заказ по телефону/email
Помощь
Есть вопрос?
О компании
LgBook.ru
FkBook.ru
 
Online Каталоги   
Cambridge University Press
Каталог учебной литературы
по английскому языку >>>

Oxford University Press
Каталог учебной литературы
по английскому языку >>>



Каталог учебной литературы
по английскому языку >>>

Pearson ELT

Читайте отзывы покупателей и оценивайте качество магазина logobook.ru на Яндекс.Маркете

Randomized algorithms, Motwani, Rajeev Raghavan, Prabhakar

Randomized algorithms

Автор: Motwani, Rajeev Raghavan, Prabhakar
Название:  Randomized algorithms   (Рандомизированные алгоритмы)
Издательство: Cambridge Academ
Классификация:
Прикладная математика

ISBN: 0521474655
ISBN-13(EAN): 9780521474658
ISBN: 0-521-47465-5
ISBN-13(EAN): 978-0-521-47465-8
Обложка/Формат: Hardcover
Страницы: 492
Вес: 1.027 кг.
Дата издания: 25.08.1995
Серия: Cambridge international series on parallel computation
Язык: ENG
Иллюстрации: Illustrations
Размер: 26.19 x 18.47 x 3.00 cm
Читательская аудитория: Professional & vocational
Поставляется из: Англии
Описание: Presents basic tools from probability theory used in algorithmic applications, with concrete examples.

 Варианты приобретения 
  Кол-во Наличие на складе Цена р. Купить / Отложить
1 Отсутствует. Возможна поставка под заказ.
При оформлении заказа до: 17 фев 2017
Ориентировочная дата поставки: 13 мар 2017
При условии наличия книги у поставщика.
5258.00
 о цене
Добавить в корзину
Add to Wish list

Отзывы покупателей.
Добавить отзыв.
An Introduction to the Analysis of Algorithms

Автор: Sedgewick Robert
Название: An Introduction to the Analysis of Algorithms
ISBN: 032190575X ISBN-13(EAN): 9780321905758
Издательство: Pearson Education
Цена: 6283 р.
Наличие на складе: Поставка под заказ.
Купить

Stochastic Simulation: Algorithms and Analysis

Автор: Asmussen
Название: Stochastic Simulation: Algorithms and Analysis
ISBN: 038730679X ISBN-13(EAN): 9780387306797
Издательство: Springer
Цена: 3847 р.
Наличие на складе: Нет в наличии.
Описание: Sampling-based computational methods have become a fundamental part of the numerical toolset of practitioners and researchers across an enormous number of different applied domains and academic disciplines. This book provides a broad treatment of such sampling-based methods , as well as accompanying mathematical analysis of the convergence properties of the methods discussed . The reach of the ideas is illustrated by discussing a wide range of applications and the models that have found wide usage. The first  half of the book focusses on general methods, whereas the second half discusses model-specific algorithms. Given the wide range of  examples, exercises and applications students, practitioners and researchers in  probability, statistics, operations research, economics, finance, engineering  as well as biology and chemistry and physics will find the book of value.  Soren Asmussen is Professor of Applied Probability at Aarhus University, Denmark and Peter Glynn is Thomas Ford Professor of  Engineering at Stanford University. 
Купить

Nature-Inspired Algorithms for Optimisation

Автор: Raymond Chiong
Название: Nature-Inspired Algorithms for Optimisation
ISBN: 3642101305 ISBN-13(EAN): 9783642101304
Издательство: Springer
Цена: 19943 р.
Наличие на складе: Нет в наличии.
Описание: Nature-inspired algorithms have become popular because many real-world optimization problems have become increasingly large, complex and dynamic. This book covers the latest algorithms and important studies for tackling various kinds of optimization problems.
Купить

Stochastic Algorithms: Foundations and Applications

Автор: Juraj Hromkovi?; Richard Kr?lovi?; Marc Nunkesser;
Название: Stochastic Algorithms: Foundations and Applications
ISBN: 3540748709 ISBN-13(EAN): 9783540748700
Издательство: Springer
Цена: 5004 р.
Наличие на складе: Нет в наличии.
Описание: Constitutes the proceedings of the 4th International Symposium on Stochastic Algorithms: Foundations and Applications, SAGA 2007, held in Zurich, Switzerland, in September 2007. This book covers theoretical as well as applied aspects of stochastic computations with a focus on investigating the power of randomization in algorithmics.
Купить

Algorithms and Complexity

Автор: Tiziana Calamoneri; Irene Finocchi; Guiseppe F. It
Название: Algorithms and Complexity
ISBN: 354034375X ISBN-13(EAN): 9783540343752
Издательство: Springer
Цена: 6698 р.
Наличие на складе: Нет в наличии.
Описание: Covers refereed proceedings of the 6th Italian Conference on Algorithms and Computation, CIAC 2006. This title includes 33 revised full papers together with 3 invited papers which address such topics as sequential, parallel and distributed algorithms, data structures, approximation algorithms, randomized algorithms, and, on-line algorithms.
Купить

Fuzzy Models and Algorithms for Pattern Recognition and Image Processing

Автор: James C. Bezdek; James Keller; Raghu Krisnapuram;
Название: Fuzzy Models and Algorithms for Pattern Recognition and Image Processing
ISBN: 0792385217 ISBN-13(EAN): 9780792385219
Издательство: Springer
Цена: 34573 р.
Наличие на складе: Нет в наличии.
Описание: This study introduces the use of fuzzy models in pattern recognition and selected topics in image processing and computer vision. The main topics are clustering and classifier design, with extensive material on feature analysis relational clustering, image processing and computer vision.
Купить

Stochastic Algorithms: Foundations and Applications

Автор: Oleg B. Lupanov; Oktay M. Kasim-Zade; Alexander V.
Название: Stochastic Algorithms: Foundations and Applications
ISBN: 3540294988 ISBN-13(EAN): 9783540294986
Издательство: Springer
Цена: 5004 р.
Наличие на складе: Нет в наличии.
Описание: Constitutes the refereed proceedings of the Third International Symposium on Stochastic Algorithms: Foundations and Applications, SAGA 2005, held in Moscow, Russia in October 2005. This title includes papers that cover both theoretical as well as applied aspects of stochastic computations with a special focus on the algorithmic ideas.
Купить

Randomized Algorithms for Analysis and Control of Uncertain Systems

Автор: Tempo
Название: Randomized Algorithms for Analysis and Control of Uncertain Systems
ISBN: 1852335246 ISBN-13(EAN): 9781852335243
Издательство: Springer
Цена: 8467 р.
Наличие на складе: Нет в наличии.
Описание: Moving on from earlier stochastic and robust control paradigms, this book introduces the fundamentals of probabilistic methods in the analysis and design of uncertain systems. The use of randomized algorithms, guarantees a reduction in the computational complexity of classical robust control algorithms and in the conservativeness of methods like H-infinity control. Features include: self-contained treatment explaining randomized algorithms from their genesis in the principle of probability theory to their use for robust analysis and controller synthesis; comprehensive treatment of sample generation, including consideration of the difficulties involved in obtaining independent and identically distributed samples; applications in congestion control of high-speed communications networks and the stability of quantized sampled-data systems.

This monograph will be of interest to theorists concerned with robust and optimal control techniques and to all control engineers dealing with system uncertainties.

Купить

Fixed-Point Algorithms for Inverse Problems in Science and Engineering

Автор: Bauschke
Название: Fixed-Point Algorithms for Inverse Problems in Science and Engineering
ISBN: 1441995684 ISBN-13(EAN): 9781441995681
Издательство: Springer
Цена: 11549 р.
Наличие на складе: Нет в наличии.
Описание: Fixed-Point Algorithms for Inverse Problems in Science and Engineering presents some of the most recent work from top-notch researchers studying projection and other first-order fixed-point algorithms in several areas of mathematics and the applied sciences. The material presented provides a survey of the state-of-the-art theory and practice in fixed-point algorithms, identifying emerging problems driven by applications, and discussing new approaches for solving these problems. This book incorporates diverse perspectives from broad-ranging areas of research including, variational analysis, numerical linear algebra, biotechnology, materials science, computational solid-state physics, and chemistry. Topics presented include: Theory of Fixed-point algorithms: convex analysis, convex optimization, subdifferential calculus, nonsmooth analysis, proximal point methods, projection methods, resolvent and related fixed-point theoretic methods, and monotone operator theory. Numerical analysis of fixed-point algorithms: choice of step lengths, of weights, of blocks for block-iterative and parallel methods, and of relaxation parameters; regularization of ill-posed problems; numerical comparison of various methods. Areas of Applications: engineering (image and signal reconstruction and decompression problems), computer tomography and radiation treatment planning (convex feasibility problems), astronomy (adaptive optics), crystallography (molecular structure reconstruction), computational chemistry (molecular structure simulation) and other areas. Because of the variety of applications presented, this book can easily serve as a basis for new and innovated research and collaboration.
Купить

Parallel Genetic Algorithms

Автор: Luque
Название: Parallel Genetic Algorithms
ISBN: 3642220835 ISBN-13(EAN): 9783642220838
Издательство: Springer
Цена: 10009 р.
Наличие на складе: Нет в наличии.
Описание: This book is the result of several years of research trying to better characterize parallel genetic algorithms (pGAs) as a powerful tool for optimization, search, and learning. Readers can learn how to solve complex tasks by reducing their high computational times. Dealing with two scientific fields (parallelism and GAs) is always difficult, and the book seeks at gracefully introducing from basic concepts to advanced topics. The presentation is structured in three parts. The first one is targeted to the algorithms themselves, discussing their components, the physical parallelism, and best practices in using and evaluating them. A second part deals with the theory for pGAs, with an eye on theory-to-practice issues. A final third part offers a very wide study of pGAs as practical problem solvers, addressing domains such as natural language processing, circuits design, scheduling, and genomics.  This volume will be helpful both for researchers and practitioners. The first part shows pGAs to either beginners and mature researchers looking for a unified view of the two fields: GAs and parallelism. The second part partially solves (and also opens) new investigation lines in theory of pGAs. The third part can be accessed independently for readers interested in applications. The result is an excellent source of information on the state of the art and future developments in parallel GAs.  
Купить

Structural Geology Algorithms

Автор: Allmendinger
Название: Structural Geology Algorithms
ISBN: 1107401380 ISBN-13(EAN): 9781107401389
Издательство: Cambridge Academ
Цена: 3154 р.
Наличие на складе: Поставка под заказ.
Купить

Jukna, Boolean Function Complexity (Algorithms and Combinatorics 27)

Название: Jukna, Boolean Function Complexity (Algorithms and Combinatorics 27)
ISBN: 3642245072 ISBN-13(EAN): 9783642245077
Издательство: Springer
Цена: 5002 р.
Наличие на складе: Нет в наличии.
Описание: Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive  description of basic lower bound arguments, covering many of the gems of this “complexity Waterloo” that have been discovered over the past several decades, right up to results from the last year or two. Many open problems, marked as Research Problems, are mentioned along the way. The problems are mainly of combinatorial flavor but their solutions could have great consequences in circuit complexity and computer science. The book will be of interest to graduate students and researchers in the fields of computer science and discrete mathematics.
Купить


 
ООО "Логосфера " Тел:(495) 748-51-16 Факс: (495) 689-73-83 доб.116 www.logobook.ru
Visa, Master Card, Diners, AMEX, JCB, Web Money, Yandex Money Сбербанк онлайн | | | | | | | | | | - - - - - - - - - - - - - - - - - - - -