Network Flow Algorithms, David P. Williamson

Автор: Cormen, Thomas H., E
Название: Introduction to algorithms 3 ed.
ISBN: 0262033844 ISBN-13(EAN): 9780262033848
Издательство: MIT Press
Рейтинг:
Цена: 27588.00 р.
Наличие на складе: Нет в наличии.

Описание: A new edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-base flow.

Автор: Barab?si
Название: Network Science
ISBN: 1107076269 ISBN-13(EAN): 9781107076266
Издательство: Cambridge Academ
Рейтинг:
Цена: 7762.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Illustrated throughout in full colour, this pioneering textbook, spanning a wide range of disciplines from physics to the social sciences, is the only book needed for an introduction to network science. In modular format, with clear delineation between undergraduate and graduate material, its unique design is supported by extensive online resources.

Автор: Binxing Fang, Jia-Yan Yao
Название: [Set Online Social Network Analysis, Vol 1-3]
ISBN: 311062656X ISBN-13(EAN): 9783110626568
Издательство: Walter de Gruyter
Цена: 38865.00 р.
Наличие на складе: Нет в наличии.

Автор: Sethi, Muhammad Athar Javed
Название: Bio-Inspired Fault-Tolerant Algorithms for Network-on-Chip
ISBN: 0367425904 ISBN-13(EAN): 9780367425906
Издательство: Taylor&Francis
Рейтинг:
Цена: 19906.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book exclusively presents in-depth information regarding bio-inspired algorithms solving real world problems focussing on fault-tolerant algorithms inspired by the biological brain and implemented on NoC. It further documents the bio-inspired algorithms in general and more specifically, in the design of NoC.

Автор: von zur Gathen
Название: Modern Computer Algebra
ISBN: 1107039037 ISBN-13(EAN): 9781107039032
Издательство: Cambridge Academ
Рейтинг:
Цена: 17582.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Designed to accompany one- or two-semester courses for advanced undergraduate or graduate students, this textbook is widely regarded as the `bible of computer algebra`. Its comprehensiveness and reliability also makes it an essential reference for professionals. This updated edition includes an overview of recent improvements in areas like primality testing.

Автор: Schapire Robert E., Freund Yoav
Название: Boosting: Foundations and Algorithms
ISBN: 0262526034 ISBN-13(EAN): 9780262526036
Издательство: MIT Press
Рейтинг:
Цена: 6772.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание:

An accessible introduction and essential reference for an approach to machine learning that creates highly accurate prediction rules by combining many weak and inaccurate ones.

Boosting is an approach to machine learning based on the idea of creating a highly accurate predictor by combining many weak and inaccurate "rules of thumb." A remarkably rich theory has evolved around boosting, with connections to a range of topics, including statistics, game theory, convex optimization, and information geometry. Boosting algorithms have also enjoyed practical success in such fields as biology, vision, and speech processing. At various times in its history, boosting has been perceived as mysterious, controversial, even paradoxical.

This book, written by the inventors of the method, brings together, organizes, simplifies, and substantially extends two decades of research on boosting, presenting both theory and applications in a way that is accessible to readers from diverse backgrounds while also providing an authoritative reference for advanced researchers. With its introductory treatment of all material and its inclusion of exercises in every chapter, the book is appropriate for course use as well.

The book begins with a general introduction to machine learning algorithms and their analysis; then explores the core theory of boosting, especially its ability to generalize; examines some of the myriad other theoretical viewpoints that help to explain and understand boosting; provides practical extensions of boosting for more complex learning problems; and finally presents a number of advanced theoretical topics. Numerous applications and practical illustrations are offered throughout.

Автор: Hitoshi Iba, Nasimul Noman
Название: Evolutionary Computation in Gene Regulatory Network Research
ISBN: 1118911512 ISBN-13(EAN): 9781118911518
Издательство: Wiley
Рейтинг:
Цена: 19317.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Introducing a handbook for gene regulatory network research using evolutionary computation, with applications for computer scientists, computational and system biologists This book is a step-by-step guideline for research in gene regulatory networks (GRN) using evolutionary computation (EC).

Автор: Mikhail V. Batsyn; Valery A. Kalyagin; Panos M. Pa
Название: Models, Algorithms and Technologies for Network Analysis
ISBN: 3319343521 ISBN-13(EAN): 9783319343525
Издательство: Springer
Рейтинг:
Цена: 13974.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This volume compiles the major results of conference participants from the "Third International Conference in Network Analysis" held at the Higher School of Economics, Nizhny Novgorod in May 2013, with the aim to initiate further joint research among different groups.

Автор: Boris I. Goldengorin; Valery A. Kalyagin; Panos M.
Название: Models, Algorithms, and Technologies for Network Analysis
ISBN: 1493953877 ISBN-13(EAN): 9781493953875
Издательство: Springer
Рейтинг:
Цена: 15372.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Models, Algorithms, and Technologies for Network Analysis (V.A. Kalyagin, B. Goldengorin, P.M. Pardalos).- Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem (M. Batsyn, B. Goldengorin, A. Kocheturov, P.M. Pardalos).- Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times (M. Batsyn, B. Goldengorin, P. Sukhov, P.M. Pardalos).- Comparative Analysis of Two Similarity Measures for the Market Graph Construction (G. A. Bautin, V.A. Kalyagin, A.P. Koldanov).- Heuristic Algorithm for the Cell Formation Problem (I. Bychkov, M. Batsyn, P. Sukhov, P.M. Pardalos).- Efficiency Analysis of Branch Network (P.A. Koldanov).- EEG Coherence in Right- and Left-Handers in Passive Visual Perception of Lines with Different Slope Angles (L.M. Viktorovich).- Speeding Up MCS Algorithm for the Maximum Clique Problem with ILS Heuristic and Other Enhancements (E. Maslov, M. Batsyn, P.M. Pardalos).- Summary and Semi-Average Similarity Criteria for Individual Clusters (B. Mirkin).- Kernel Principal Component Analysis: Applications, Implementation, and Comparison (D. Olsson, P. Georgiev, V. Boginski, A. Sorokin, P.M. Pardalos).- Distance-Based Clique Relaxations in Networks: s-Clique and s-Club (S. Shahinpour, S. Butenko).- GRASP with Path-Relinking for Facility Layout (R.M.A. Silva, M.G.C. Resende, P.M. Pardalos, G.R. Mateus, G. De Tomi).- Comparative Analysis of the BRIC Countries Stock Markets Using Network Approach (A. Vizgunov, A. Glotov, P.M. Pardalos).- Sensor Cover and Double Partition (L. Wu, W. Wu, L. Lu, Y. Zhu, D.-Z. Du).

Автор: Boris I. Goldengorin; Valery A. Kalyagin; Panos M.
Название: Models, Algorithms, and Technologies for Network Analysis
ISBN: 1461485878 ISBN-13(EAN): 9781461485872
Издательство: Springer
Рейтинг:
Цена: 13974.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание:

This volume contains two types of papers--a selection of contributions from the "Second International Conference in Network Analysis" held in Nizhny Novgorod on May 7-9, 2012, and papers submitted to an "open call for papers" reflecting the activities of LATNA at the Higher School for Economics.

This volume contains many new results in modeling and powerful algorithmic solutions applied to problems in

- vehicle routing
- single machine scheduling
- modern financial markets
- cell formation in group technology
- brain activities of left- and right-handers
- speeding up algorithms for the maximum clique problem
- analysis and applications of different measures in clustering

The broad range of applications that can be described and analyzed by means of a network brings together researchers, practitioners, and other scientific communities from numerous fields such as Operations Research, Computer Science, Transportation, Energy, Social Sciences, and more. The contributions not only come from different fields, but also cover a broad range of topics relevant to the theory and practice of network analysis. Researchers, students, and engineers from various disciplines will benefit from the state-of-the-art in models, algorithms, technologies, and techniques presented.

Автор: Agarwal, Dr Basant, Baka, Benjamin
Название: Hands-On Data Structures and Algorithms with Python 2 ed
ISBN: 1788995570 ISBN-13(EAN): 9781788995573
Издательство: Неизвестно
Рейтинг:
Цена: 8091.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Data structures help us to organize and align the data in a very efficient way. This book will surely help you to learn important and essential data structures through Python implementation for better understanding of the concepts.

Автор: David P. Williamson
Название: Network Flow Algorithms
ISBN: 1316636836 ISBN-13(EAN): 9781316636831
Издательство: Cambridge Academ
Рейтинг:
Цена: 6019.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This comprehensive text and reference for graduate students and professionals in theoretical computer science, operations research, and discrete math offers an up-to-date, unified view of efficient combinatorial algorithms for a wide variety of network flow problems, including recent work on computing electrical flows and their applications.