Поиск по базам:


Lorca
Фото - Lorca F. Lorca Romancero gitano lorca

Lorca F. Lorca Roman...

Lorca F. Lorca Romancero gitano

Посмотреть карточку товара

Цена: 124 RUR

Подробнее

Похожие товары...

Фото - TRIXIE Когтеточка Trixie Lorca для кошек угловая 37х27х75 см с игрушкой бежевая lorca

TRIXIE Когтеточка Tr...

Когтеточка Lorca для кошек угловая 37х27х75 см с игрушкой бежевая

Посмотреть карточку товара

Цена: 4762.26 RUR

Подробнее

Похожие товары...

Фото - Federico Garcia Lorca Romancero gitano / Цыганский романсеро lorca

Federico Garcia Lorc...

Вниманию читателей предлагается оригинальный текст популярного сборник...

Посмотреть карточку товара

Цена: 154 RUR

Подробнее

Похожие товары...

Фото - Federico García Lorca Bodas De Sangre. Yerma lorca

Federico García Lorc...

Bodas de Sangre (1932) и Yerma (1934), две работы, которые отражают др...

Посмотреть карточку товара

Цена: 140 RUR

Подробнее

Похожие товары...

Фото - Абелла Кастро О. Испанский с Федерико Гарсиа Лоркой. Донья Росита, девица, или Язык цветов = Federiko Garcia Lorca. Dona Roosita la soltera o El Lenguaje de las flores lorca

Абелла Кастро О. Исп...

История девушки, обреченной всю жизнь ждать своего возлюбленного, напи...

Посмотреть карточку товара

Цена: 244 RUR

Подробнее

Похожие товары...

Фото - Bottega Veneta. Art of Collaboration lorca

Bottega Veneta. Art...

In 2002, Tomas Maier, Bottega Veneta s Creative Director, launched the...

Посмотреть карточку товара

Цена: 6841 RUR

Подробнее

Похожие товары...

Фото - Xavier Lorca Tree-based Graph Partitioning Constraint lorca

Xavier Lorca Tree-ba...

Combinatorial problems based on graph partitioning enable us to mathem...

Посмотреть карточку товара

Цена: 8184.31 RUR

Подробнее

Похожие товары...

Дополнительная информация:

Combinatorial problems based on graph partitioning enable us to mathematically represent and model many practical applications. Mission planning and the routing problems occurring in logistics perfectly illustrate two such examples. Nevertheless, these problems are not based on the same partitioning pattern: generally, patterns like cycles, paths, or trees are distinguished. Moreover, the practical applications are often not limited to theoretical problems like the Hamiltonian path problem, or K-node disjoint path problems. Indeed, they usually combine the graph partitioning problem with several restrictions related to the topology of nodes and arcs. The diversity of implied constraints in real-life applications is a practical limit to the resolution of such problems by approaches considering the partitioning problem independently from each additional restriction. This book focuses on constraint satisfaction problems related to tree partitioning problems enriched by several additional constraints that restrict the possible partitions topology. On the one hand, this title focuses on the structural properties of tree partitioning constraints. On the other hand, it is dedicated to the interactions between the tree partitioning problem and classical restrictions (such as precedence relations or incomparability relations between nodes) involved in practical applications. Precisely, Tree-based Graph Partitioning Constraint shows how to globally take into account several restrictions within one single tree partitioning constraint. Another interesting aspect of this book is related to the implementation of such a constraint. In the context of graph-based global constraints, the book illustrates how a fully dynamic management of data structures makes the runtime of filtering algorithms independent of the graph density.