Combinatorial Pattern Matching, Alberto Apostolico; Jotun Hein

Название: Ontology Matching
ISBN: 3642387209 ISBN-13(EAN): 9783642387203
Издательство: Springer
Рейтинг:
Цена: 130430.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book explores ontology matching as a solution to the semantic heterogeneity problem faced by computer systems. Also covers emerging topics such as data interlinking, ontology partitioning and pruning, and user involvement in matching.

Автор: Zvi Galil; Esko Ukkonen
Название: Combinatorial Pattern Matching
ISBN: 3540600442 ISBN-13(EAN): 9783540600442
Издательство: Springer
Рейтинг:
Цена: 69870.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This volume contains the proceedings of the 6th International Symposium on Combinatorial Pattern Matching. The book addresses issues of searching and matching strings and more complicated patterns such as trees, regular expressions and extended expressions.

Автор: Martin Farach-Colton
Название: Combinatorial Pattern Matching
ISBN: 3540647392 ISBN-13(EAN): 9783540647393
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Taken from proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching, held in New Jersey, July 1998 (CPM `98), this text includes issues in combinatorial pattern matching, dealing with a variety of classical objects to be matched as well as with DNA coding.

Автор: Alexander S. Kulikov; Sergei O. Kuznetsov; Pavel P
Название: Combinatorial Pattern Matching
ISBN: 3319075659 ISBN-13(EAN): 9783319075655
Издательство: Springer
Рейтинг:
Цена: 68010.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 25th Annual Symposium on Combinatorial Pattern Matching, CPM 2014, held in Moscow, Russia, in June 2014. The goal is to derive combinatorial properties of such structures and to exploit these properties in order to achieve superior performance for the corresponding computational problems.

Автор: Raffaele Giancarlo; David Sankoff
Название: Combinatorial Pattern Matching
ISBN: 3540676333 ISBN-13(EAN): 9783540676331
Издательство: Springer
Рейтинг:
Цена: 81050.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The refereed proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching (CPM 2000). Papers cover theoretical and algorithmic issues of searching and matching strings and more complicated patterns, as well as advanced applications of CPM in areas such as computational biology.

Автор: Dan Hirschberg; Gene Meyers
Название: Combinatorial Pattern Matching
ISBN: 3540612580 ISBN-13(EAN): 9783540612582
Издательство: Springer
Рейтинг:
Цена: 74530.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Comprising 26 papers presented at the 7th Annual Symposium on Combinatorial Pattern Matching (CPM), this work examines the importance of CPM, an area of algorithmics, in information retrieval, pattern recognition, compiling, data compression, program analysis, and molecular biology.

Автор: Alberto Apostolico; Maxime Crochemore; Zvi Galil;
Название: Combinatorial Pattern Matching
ISBN: 3540560246 ISBN-13(EAN): 9783540560241
Издательство: Springer
Рейтинг:
Цена: 43780.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Combinatorial pattern matching is a field dealing with the searching and matching of strings and other, more complicated patterns such as trees, regular expressions and extended expressions. This volume contains a series of papers presented at a symposium on the subject.

Автор: J?r?me Euzenat; Pavel Shvaiko
Название: Ontology Matching
ISBN: 3662500426 ISBN-13(EAN): 9783662500422
Издательство: Springer
Рейтинг:
Цена: 93160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book explores ontology matching as a solution to the semantic heterogeneity problem faced by computer systems. Also covers emerging topics such as data interlinking, ontology partitioning and pruning, and user involvement in matching.

Автор: Korte, Bernhard, Vygen, Jens
Название: Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed.
ISBN: 3642244874 ISBN-13(EAN): 9783642244872
Издательство: Springer
Рейтинг:
Цена: 60510.00 T
Наличие на складе: Невозможна поставка.
Описание: This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.

Автор: Cerulli
Название: Combinatorial Optimization
ISBN: 3319455869 ISBN-13(EAN): 9783319455860
Издательство: Springer
Рейтинг:
Цена: 61490.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the thoroughly refereed post-conference proceedings of the 4th International Symposium on Combinatorial Optimization, ISCO 2016, held in Vietri sul Mare, Italy, in May 2016. They present original research on all aspects of combinatorial optimization, such as algorithms and complexity;

Автор: Francisco Chicano; Bin Hu; Pablo Garc?a-S?nchez
Название: Evolutionary Computation in Combinatorial Optimization
ISBN: 3319306979 ISBN-13(EAN): 9783319306971
Издательство: Springer
Рейтинг:
Цена: 46590.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: A Hybrid Constructive Mat-Heuristic Algorithm for The Heterogeneous Vehicle Routing Problem with Simultaneous Pick-up and Delivery.- A Property Preserving Method for Extending a Single-Objective Problem Instance to Multiple Objectives with Specific Correlations.- An Evolutionary Approach to the Full Optimization of the Traveling Thief Problem.- Construct, Merge, Solve & Adapt: Application to the Repetition-Free Longest Common Subsequence Problem.- Deconstructing the Big Valley Search Space Hypothesis.- Determining the Difficulty of Landscapes by PageRank Centrality in Local Optima Networks.- Efficient Hill Climber for Multi-Objective Pseudo-Boolean Optimization.- Evaluating Hyperheuristics and Local Search Operators for Periodic Routing Problems.- Evolutionary Algorithms for Finding Short Addition Chains: Going the Distance.- Experimental Evaluation of Two Approaches to Optimal Recombination for Permutation Problems.- Hyperplane Elimination for Quickly Enumerating Local Optima.- Limits to Learning in Reinforcement Learning Hyperheuristics.- Modifying Colourings between Time-Steps to Tackle Changes in Dynamic Random Graphs.- Particle Swarm Optimisation with Sequence-Like Indirect Representation for Web Service Composition.- Particle Swarm Optimization for Multi-Objective Web Service Location Allocation.- Sim-EDA: A Multipopulation Estimation of Distribution Algorithm Based on Problem Similarity.- Solving the Quadratic Assignment Problem with Cooperative Parallel Extremal Optimization.

Автор: Zsuzsanna Lipt?k; William F. Smyth
Название: Combinatorial Algorithms
ISBN: 3319295152 ISBN-13(EAN): 9783319295152
Издательство: Springer
Рейтинг:
Цена: 52170.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the thoroughly refereedpost-workshop proceedings for the 26 International Workshop on combinatorialAlgorithms, IWOCA 2015, held in Verona, Italy, in October 2015. The 29 revised full papers presented were carefullyreviewed and selected from a total of 90 submissions.