Описание: This collection of peer-reviewed workshop papers provides comprehensive coverage of cutting-edge research into topological approaches to data analysis and visualization. They provide an essential snapshot of state-of-the-art research, helping researchers to keep abreast of the latest developments and providing a basis for future work.
Описание: The contributions in this volume cover a broad range of topics including maximum cliques, graph coloring, data mining, brain networks, Steiner forest, logistic and supply chain networks. Network algorithms and their applications to market graphs, manufacturing problems, internet networks and social networks are highlighted.
Описание: This book constitutes the refereed proceedings of the 25th International Conference on Analytical and Stochastic Modelling Techniques and Applications, ASMTA 2019, held in Moscow, Russia, in October 2019.
Автор: Yang Название: Optimization Techniques and Applications with Examples ISBN: 1119490545 ISBN-13(EAN): 9781119490548 Издательство: Wiley Рейтинг: Цена: 16466.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
A guide to modern optimization applications and techniques in newly emerging areas spanning optimization, data science, machine intelligence, engineering, and computer sciences
Optimization Techniques and Applications with Examples introduces the fundamentals of all the commonly used techniques in optimization that encompass the broadness and diversity of the methods (traditional and new) and algorithms. The author--a noted expert in the field--covers a wide range of topics including mathematical foundations, optimization formulation, optimality conditions, algorithmic complexity, linear programming, convex optimization, and integer programming. In addition, the book discusses artificial neural network, clustering and classifications, constraint-handling, queueing theory, support vector machine and multi-objective optimization, evolutionary computation, nature-inspired algorithms and many other topics.
Designed as a practical resource, all topics are explained in detail with step-by-step examples to show how each method works. The book's exercises test the acquired knowledge that can be potentially applied to real problem solving. By taking an informal approach to the subject, the author helps readers to rapidly acquire the basic knowledge in optimization, operational research, and applied data mining. This important resource:
Offers an accessible and state-of-the-art introduction to the main optimization techniques
Contains both traditional optimization techniques and the most current algorithms and swarm intelligence-based techniques
Presents a balance of theory, algorithms, and implementation
Includes more than 100 worked examples with step-by-step explanations
Written for upper undergraduates and graduates in a standard course on optimization, operations research and data mining, Optimization Techniques and Applications with Examples is a highly accessible guide to understanding the fundamentals of all the commonly used techniques in optimization.
Автор: David P. Williamson Название: Network Flow Algorithms ISBN: 1107185890 ISBN-13(EAN): 9781107185890 Издательство: Cambridge Academ Рейтинг: Цена: 13781.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.
Описание: This book constitutes the refereed proceedings of the 11th International Conference on Optimization and Applications, OPTIMA 2020, held in Moscow, Russia, in September-October 2020.*The 21 full and 2 short papers presented were carefully reviewed and selected from 60 submissions.
Автор: 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.
Автор: Matveev, Andrey O., Название: Pattern recognition on oriented matroids / ISBN: 3110530716 ISBN-13(EAN): 9783110530711 Издательство: Walter de Gruyter Рейтинг: Цена: 18586.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
Pattern Recognition on Oriented Matroids covers a range of innovative problems in combinatorics, poset and graph theories, optimization, and number theory that constitute a far-reaching extension of the arsenal of committee methods in pattern recognition. The groundwork for the modern committee theory was laid in the mid-1960s, when it was shown that the familiar notion of solution to a feasible system of linear inequalities has ingenious analogues which can serve as collective solutions to infeasible systems. A hierarchy of dialects in the language of mathematics, for instance, open cones in the context of linear inequality systems, regions of hyperplane arrangements, and maximal covectors (or topes) of oriented matroids, provides an excellent opportunity to take a fresh look at the infeasible system of homogeneous strict linear inequalities - the standard working model for the contradictory two-class pattern recognition problem in its geometric setting. The universal language of oriented matroid theory considerably simplifies a structural and enumerative analysis of applied aspects of the infeasibility phenomenon.
The present book is devoted to several selected topics in the emerging theory of pattern recognition on oriented matroids: the questions of existence and applicability of matroidal generalizations of committee decision rules and related graph-theoretic constructions to oriented matroids with very weak restrictions on their structural properties; a study (in which, in particular, interesting subsequences of the Farey sequence appear naturally) of the hierarchy of the corresponding tope committees; a description of the three-tope committees that are the most attractive approximation to the notion of solution to an infeasible system of linear constraints; an application of convexity in oriented matroids as well as blocker constructions in combinatorial optimization and in poset theory to enumerative problems on tope committees; an attempt to clarify how elementary changes (one-element reorientations) in an oriented matroid affect the family of its tope committees; a discrete Fourier analysis of the important family of critical tope committees through rank and distance relations in the tope poset and the tope graph; the characterization of a key combinatorial role played by the symmetric cycles in hypercube graphs.
Contents Oriented Matroids, the Pattern Recognition Problem, and Tope Committees Boolean Intervals Dehn-Sommerville Type Relations Farey Subsequences Blocking Sets of Set Families, and Absolute Blocking Constructions in Posets Committees of Set Families, and Relative Blocking Constructions in Posets Layers of Tope Committees Three-Tope Committees Halfspaces, Convex Sets, and Tope Committees Tope Committees and Reorientations of Oriented Matroids Topes and Critical Committees Critical Committees and Distance Signals Symmetric Cycles in the Hypercube Graphs
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
