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

Efficient Approximation and Online Algorithms / Recent Progress on Classical Combinatorial Optimization Problems and New Applications, Bampis Evripidis, Jansen Klaus, Kenyon Claire



Варианты приобретения
Цена: 11136р.
Кол-во:
Наличие: Поставка под заказ.  Есть в наличии на складе поставщика.
Склад Англия: 529 шт.  Склад Америка: 124 шт.  
При оформлении заказа до: 23 май 2022
Ориентировочная дата поставки: Июнь

Заказ пока невозможен
в Мои желания

Автор: Bampis Evripidis, Jansen Klaus, Kenyon Claire
Название:  Efficient Approximation and Online Algorithms / Recent Progress on Classical Combinatorial Optimization Problems and New Applications
ISBN: 9783540322122
Издательство: Springer
Классификация:
ISBN-10: 3540322124
Обложка/Формат: Book & Online
Страницы: 349
Вес: 0.507 кг.
Дата издания: 2006
Серия: Lecture Notes in Computer Science
Язык: English
Размер: 23.39 x 15.60 x 1.91
Ссылка на Издательство: Link
Поставляется из: Германии
Дополнительное описание: Формат: 235x155
Круг читателей: Researchers and professionals
Ключевые слова: algorithmics
on-line algorithms
approximation
combinatorial optimization
classification
complexity theory
computational complexity
computational discrete mathematics
computational geometry
computational graph theory
data mining
local searching
distributed algorithms
graph algorithms
graph drawing
network algorithms
parallel algorithms
scheduling
Язык: eng





Combinatorial Optimization / Polyhedra and Efficiency

Автор: Schrijver Alexander
Название: Combinatorial Optimization / Polyhedra and Efficiency
ISBN: 3540443894 ISBN-13(EAN): 9783540443896
Издательство: Springer
Рейтинг:
Цена: 18116 р.
Наличие на складе: Нет в наличии.

Описание: This book offers an in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization.These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science. In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4000 references to further research are given, and historical surveys on the basic subjects are presented.

Algorithms in Combinatorial Geometry

Автор: Edelsbrunner Herbert
Название: Algorithms in Combinatorial Geometry
ISBN: 3642648738 ISBN-13(EAN): 9783642648731
Издательство: Springer
Цена: 19298 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / First International Conference, CPAIOR 2004, Nice, France, April 20-22, 2004, Proceedings

Автор: RГ©gin Jean-Charles, Rueher Michel
Название: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / First International Conference, CPAIOR 2004, Nice, France, April 20-22, 2004, Proceedings
ISBN: 354021836X ISBN-13(EAN): 9783540218364
Издательство: Springer
Рейтинг:
Цена: 12918 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the First International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2004, held in Nice, France in April 2004.The 23 revised full papers and 7 revised short papers presented together with an invited talk were carefully reviewed and selected from 56 submissions. Methodological and foundational issues from AI, OR, and algorithmics are presented as well as applications to the solution of combinatorial optimization problems in various fields via constraint programming.

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / Second International Conference, CPAIOR 2005, Prague, Czech Republic, May 31 -- June 1, 2005

Автор: BartГЎk Roman, Milano Michela
Название: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / Second International Conference, CPAIOR 2005, Prague, Czech Republic, May 31 -- June 1, 2005
ISBN: 3540261524 ISBN-13(EAN): 9783540261520
Издательство: Springer
Рейтинг:
Цена: 14106 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Constitutes the proceedings of the Second International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2005, held in Prague, Czech Republic, in May/June 2005. This title presents methodological and foundational issues from AI , OR, and algorithmics.

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / Third International Conference, CPAIOR 2006, Cork, Ireland, May 31 - June 2, 2006, Proceedings

Автор: Beck J. Christopher, Smith Barbara
Название: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / Third International Conference, CPAIOR 2006, Cork, Ireland, May 31 - June 2, 2006, Proceedings
ISBN: 3540343067 ISBN-13(EAN): 9783540343066
Издательство: Springer
Рейтинг:
Цена: 10394 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the Third International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2006, held in Cork, Ireland in May/June 2006.The 20 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 67 submissions. The papers address methodological and foundational issues from AI, OR, and algorithmics and present applications to the solution of combinatorial optimization problems in various fields via constraint programming.

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings

Автор: Van Hentenryck Pascal, Wolsey Laurence
Название: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings
ISBN: 354072396X ISBN-13(EAN): 9783540723967
Издательство: Springer
Рейтинг:
Цена: 12918 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 4th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2007, held in Brussels, Belgium in May 2007.The 27 revised full papers presented were carefully reviewed and selected from 80 submissions. Methodological and foundational issues from AI, OR, and algorithmics are presented as well as applications to the solution of combinatorial optimization problems in various fields via constraint programming.

Approximation Theory and Optimization

Автор: Buhmann
Название: Approximation Theory and Optimization
ISBN: 0521118441 ISBN-13(EAN): 9780521118446
Издательство: Cambridge Academ
Рейтинг:
Цена: 6868 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Authorities in numerical analysis and optimisation combine to write an important volume in the area.

Integer Programming and Combinatorial Optimization / 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings

Автор: JГјnger Michael, Kaibel Volker
Название: Integer Programming and Combinatorial Optimization / 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings
ISBN: 3540261990 ISBN-13(EAN): 9783540261995
Издательство: Springer
Рейтинг:
Цена: 15591 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Contains 34 papers, reviewed and selected from 119 submissions. This book addresses topics like mixed-integer programming, graph theory, graph algorithms, approximation, linear programming, approximability, packing, scheduling, computational geometry, randomization, network algorithms, sequencing, TSP, and the travelling salesman problem.

Stochastic Approximation and Recursive Algorithms and Applications

Автор: Kushner Harold J., Yin G. George
Название: Stochastic Approximation and Recursive Algorithms and Applications
ISBN: 0387008942 ISBN-13(EAN): 9780387008943
Издательство: Springer
Рейтинг:
Цена: 22274 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The book presents a thorough development of the modern theory of stochastic approximation or recursive stochastic algorithms for both constrained and unconstrained problems. There is a complete development of both probability one and weak convergence methods for very general noise processes. The proofs of convergence use the ODE method, the most powerful to date, with which the asymptotic behavior is characterized by the limit behavior of a mean ODE. The assumptions and proof methods are designed to cover the needs of recent applications. The development proceeds from simple to complex problems, allowing the underlying ideas to be more easily understood. Rate of convergence, iterate averaging, high-dimensional problems, stability-ODE methods, two time scale, asynchronous and decentralized algorithms, general correlated and state-dependent noise, perturbed test function methods, and large devitations methods, are covered. Many motivational examples from learning theory, ergodic cost problems for discrete event systems, wireless communications, adaptive control, signal processing, and elsewhere, illustrate the application of the theory. This second edition is a thorough revision, although the main features and the structure remain unchanged. It contains many additional applications and results, and more detailed discussion. Harold J. Kushner is a University Professor and Professor of Applied Mathematics at Brown University. He has written numerous books and articles on virtually all aspects of stochastic systems theory, and has received various awards including the IEEE Control Systems Field Award.

Efficient Algorithms for Listing Combinatorial Structures

Автор: Goldberg
Название: Efficient Algorithms for Listing Combinatorial Structures
ISBN: 0521117887 ISBN-13(EAN): 9780521117883
Издательство: Cambridge Academ
Рейтинг:
Цена: 5421 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures. The research described here gives some answers to the following questions: which families of combinatorial structures have fast computer algorithms for listing their members? What general methods are useful for listing combinatorial structures? How can these be applied to those families which are of interest to theoretical computer scientists and combinatorialists? Amongst those families considered are unlabelled graphs, first order one properties, Hamiltonian graphs, graphs with cliques of specified order, and k-colourable graphs. Some related work is also included, which compares the listing problem with the difficulty of solving the existence problem, the construction problem, the random sampling problem, and the counting problem. In particular, the difficulty of evaluating P??lya's cycle polynomial is demonstrated.

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
Рейтинг:
Цена: 11136 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

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

Combinatorial Optimization and Application / First International Conference, COCOA 2007, Xi`an, China, August 14-16, 2007, Proceedings

Автор: Dress Andreas, Xu Yinfeng, Zhu Binhai
Название: Combinatorial Optimization and Application / First International Conference, COCOA 2007, Xi`an, China, August 14-16, 2007, Proceedings
ISBN: 3540735550 ISBN-13(EAN): 9783540735557
Издательство: Springer
Цена: 12918 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the First International Conference on Combinatorial Optimization and Applications, COCOA 2007, held in Xi'an, China in August 2007.The 29 revised full papers presented together with 8 invited papers and 2 invited presentations were carefully reviewed and selected from 114 submissions. The papers feature original research in the areas of combinatorial optimization - both theoretical issues and and applications motivated by real-world problems thus showing convincingly the usefulness and efficiency of the algorithms discussed in a practical setting.


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