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

Network algorithmics, Varghese, George (jonathan B. Postel Professor Of Networking, University Of California, Los Angeles, California, Usa) Xu, Jun (professor In The School


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

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

Автор: Varghese, George (jonathan B. Postel Professor Of Networking, University Of California, Los Angeles, California, Usa) Xu, Jun (professor In The School
Название:  Network algorithmics
ISBN: 9780128099278
Издательство: Elsevier Science
Классификация:
ISBN-10: 0128099275
Обложка/Формат: Paperback
Страницы: 594
Вес: 0.45 кг.
Дата издания: 01.03.2022
Язык: English
Издание: 2 ed
Размер: 192 x 235 x 34
Подзаголовок: An interdisciplinary approach to designing fast networked devices
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Европейский союз
Описание: `Through her courageous resistance, she has, for a moment, drawn global attention to the ongoing struggle of Saudi women. The striking image of a young woman, wielding nothing but a cellphone, facing down the force of an oppressive government is an apt metaphor for this fraught moment in Saudi Arabia`s history.`THE WASHINGTON POST


Frontiers in Algorithmics

Автор: Chen
Название: Frontiers in Algorithmics
ISBN: 3319784544 ISBN-13(EAN): 9783319784540
Издательство: Springer
Рейтинг:
Цена: 6986.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 12th International Workshop on Frontiers in Algorithmics, FAW 2018, held in Guangzhou, China, in May 2018.The 23 full papers presented in this volume were carefully reviewed and selected from 38 submissions.

Frontiers in Algorithmics: 14th International Workshop, Faw 2020, Haikou, China, October 19-21, 2020, Proceedings

Автор: Li Minming
Название: Frontiers in Algorithmics: 14th International Workshop, Faw 2020, Haikou, China, October 19-21, 2020, Proceedings
ISBN: 3030599000 ISBN-13(EAN): 9783030599003
Издательство: Springer
Рейтинг:
Цена: 6986.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: A collection of mathematical games, activities and curiosities to surprise and amuse children aged 7+, whilst providing learners with a grasp of fundamental concepts and techniques. This book can be used by anyone wanting to improve their maths, as well as those with dyscalculia or maths anxiety or other SLDs, and will show learners how much fun numbers can be.

Algorithmic Game Theory

Автор: Edited by Noam Nisan
Название: Algorithmic Game Theory
ISBN: 0521872820 ISBN-13(EAN): 9780521872829
Издательство: Cambridge Academ
Рейтинг:
Цена: 9821.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: More than 40 of the top researchers in this field have written chapters that go from the foundations to the state of the art. Basic chapters on algorithmic methods for equilibria, mechanism design and combinatorial auctions are followed by chapters on incentives and pricing, cost sharing, information markets and cryptography and security.

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management

Автор: Michael Fellows; Xuehou Tan; Binhai Zhu
Название: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management
ISBN: 3642387551 ISBN-13(EAN): 9783642387555
Издательство: Springer
Рейтинг:
Цена: 6986.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание:

The Square Root Phenomenon in Planar Graphs.- An Algorithm for Determining Whether a Pair of Polygons Is Reversible.- Disjoint Small Cycles in Graphs and Bipartite Graphs.- An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree.- Algorithms for Testing Length Four Permutations.- Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds.- Faster Exact Computation of rSPR Distance.- Arbitrated Quantum Signature Schemes: Attacks and Security.- Randomized Algorithms for Removable Online Knapsack Problems.- An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs.- FWLS: A Local Search for Graph Coloring.- A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids.- Monomial Testing and Applications.- The Optimal Rescue Path Set Problem in Undirected Graphs.- Expected Computations on Color Spanning Sets.- Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs.- Spanning Distribution Trees of Graphs.- A Cutting Plane Heuristic Algorithm for the Time Dependent Chinese Postman Problem.- Zero-Visibility Cops and Robber Game on a Graph.- On (k, l)-Graph Sandwich Problems.- Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints.- Two-Round Discrete Voronoi Game along a Line.- Inverse Maximum Flow Problems under the Combining Norms.- The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs.- A Cost-Efficient Scheduling Algorithm for Traffic Grooming.- Strategies of Groups Evacuation from a Convex Region in the Plane.- Kernelization and Lower Bounds of the Signed Domination Problem.- On Edge-Independent Sets.- On the Complexity of Approximate Sum of Sorted List.- Large Hypertree Width for Sparse Random Hypergraphs.- On Perfect Absorbants in De Bruijn Digraphs.- Multi-Multiway Cut Problem on Graphs of Bounded Branch Width.- Bi-criteria Scheduling on Multiple Machines Subject to Machine Availability Constraints.- Zero-Sum Flow Numbers of Hexagonal Grids.- Pattern-Guided k-Anonymity.

Algorithmic regulation

Название: Algorithmic regulation
ISBN: 0198838492 ISBN-13(EAN): 9780198838494
Издательство: Oxford Academ
Рейтинг:
Цена: 15682.00 р.
Наличие на складе: Поставка под заказ.

Описание: This book provides a range of critical essays examining the use of algorithms to regulate various aspects of contemporary life, and the need to regulate these algorithmic systems, drawing from a broad range of disciplinary expertise.

The Science of Algorithmic Trading and Portfolio Management,

Автор: Robert Kissell
Название: The Science of Algorithmic Trading and Portfolio Management,
ISBN: 0124016898 ISBN-13(EAN): 9780124016897
Издательство: Elsevier Science
Рейтинг:
Цена: 8588.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Discusses algorithmic trading across the various asset classes, provides key insights into ways to develop, test, and build trading algorithms. This title helps readers learn how to evaluate market impact models and assess performance across algorithms, traders, and brokers, and acquire the knowledge to implement electronic trading systems.

Frontiers in Algorithmics

Автор: Mingyu Xiao; Frances Rosamond
Название: Frontiers in Algorithmics
ISBN: 3319596047 ISBN-13(EAN): 9783319596044
Издательство: Springer
Рейтинг:
Цена: 7685.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the proceedings of the 11th International Workshop on Frontiers in Algorithmics, FAW 2017, held in Chengdu, China, in June 2017. The 24 papers presented in this volume were carefully reviewed and selected from 61 submissions. They deal with all aspects of theoretical computer science and algorithms.

Algorithmics

Автор: David Harel; Yishai Feldman
Название: Algorithmics
ISBN: 3642441351 ISBN-13(EAN): 9783642441356
Издательство: Springer
Рейтинг:
Цена: 9083.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Computer science is the science of the future, and already underlies every facet of business and technology, and much of our everyday lives.

Frontiers in Algorithmics

Автор: Jianxin Wang; Chee Yap
Название: Frontiers in Algorithmics
ISBN: 3319196464 ISBN-13(EAN): 9783319196466
Издательство: Springer
Рейтинг:
Цена: 7826.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the proceedings of the 9th International Workshop on Frontiers in Algorithmics, FAW 2015, held in Guilin, China, in July 2015. They deal with graph algorithms, approximation algorithms, combinatorial optimization, parameterized algorithms, and online algorithms.

Frontiers in Algorithmics

Автор: Jianer Chen; John E. Hopcroft; Jianxin Wang
Название: Frontiers in Algorithmics
ISBN: 3319080156 ISBN-13(EAN): 9783319080154
Издательство: Springer
Рейтинг:
Цена: 7826.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 8th International Frontiers of Algorithmics Workshop, FAW 2014, held in Zhangjiajie, China, in June 2014. They provide a focused forum on current trends of research on algorithms, discrete structures, operations research, combinatorial optimization and their applications.

Frontiers in Algorithmics

Автор: Daming Zhu; Sergey Bereg
Название: Frontiers in Algorithmics
ISBN: 3319398164 ISBN-13(EAN): 9783319398167
Издательство: Springer
Рейтинг:
Цена: 7826.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: They deal with algorithm, complexity, problem, reduction, NP-complete, graph, approximation, linear programming, local search, integer programming, semidefinite programming, parameterized algorithm, fixed parameter, tractability, randomness, computational geometry.

Experimental Algorithmics

Автор: Rudolf Fleischer; Bernhard Moret; Erik Meineche Sc
Название: Experimental Algorithmics
ISBN: 3540003460 ISBN-13(EAN): 9783540003465
Издательство: Springer
Рейтинг:
Цена: 9781.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.


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