Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[کتاب][B] Handbook of constraint programming
F Rossi, P Van Beek, T Walsh - 2006 - books.google.com
Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …
that draws on a wide range of techniques from artificial intelligence, computer science …
Cp (graph): Introducing a graph computation domain in constraint programming
In an increasing number of domains such as bioinformatics, combinatorial graph problems
arise. We propose a novel way to solve these problems, mainly those that can be translated …
arise. We propose a novel way to solve these problems, mainly those that can be translated …
The tree Constraint
N Beldiceanu, P Flener, X Lorca - … on Integration of Artificial Intelligence (AI …, 2005 - Springer
This article presents an arc-consistency algorithm for the tree constraint, which enforces the
partitioning of a digraph G=(V,E) into a set of vertex-disjoint anti-arborescences. It provides a …
partitioning of a digraph G=(V,E) into a set of vertex-disjoint anti-arborescences. It provides a …
Using dominators for solving constrained path problems
Constrained path problems have to do with finding paths in graphs subject to constraints.
We present a constraint programming approach for solving the Ordered disjoint-paths …
We present a constraint programming approach for solving the Ordered disjoint-paths …
Exploitation de structures de graphe en programmation par contraintes
JG Fages - 2014 - theses.hal.science
De nombreuses applications informatiques nécessitent de résoudre des problèmes de
décision qui sont difficiles d'un point de vue mathématique. La programmation par …
décision qui sont difficiles d'un point de vue mathématique. La programmation par …
Constraint applications in networks
Publisher Summary This chapter discusses the use of constraint programming (CP) for
network applications. Network problems that arise in different domains are discussed. The …
network applications. Network problems that arise in different domains are discussed. The …
The “not-too-heavy spanning tree” constraint
G Dooms, I Katriel - International Conference on Integration of Artificial …, 2007 - Springer
We develop filtering algorithms for the Weight-Bounded Spanning Tree (WBST (G, T, I, W))
constraint, which is defined on undirected graph variables G and T, a scalar variable I and a …
constraint, which is defined on undirected graph variables G and T, a scalar variable I and a …
Combining tree partitioning, precedence, and incomparability constraints
The tree constraint partitions a directed graph into node-disjoint trees. In many practical
applications that involve such a partition, there exist side constraints specifying requirements …
applications that involve such a partition, there exist side constraints specifying requirements …
Improving the asymmetric TSP by considering graph structure
Recent works on cost based relaxations have improved Constraint Programming (CP)
models for the Traveling Salesman Problem (TSP). We provide a short survey over solving …
models for the Traveling Salesman Problem (TSP). We provide a short survey over solving …
[PDF][PDF] Solving constrained graph problems using reachability constraints based on transitive closure and dominators
• Peter Van Roy, my supervisor, who gave me the opportunity to work as a research
assistant at Université Catholique de Louvain (UCL) from July 2001 until April 2005 in the …
assistant at Université Catholique de Louvain (UCL) from July 2001 until April 2005 in the …