Sciweavers

370 search results - page 18 / 74
» Independent Sets with Domination Constraints
Sort
View
ICPPW
2006
IEEE
14 years 1 months ago
Multidimensional Dataflow-based Parallelization for Multimedia Instruction Set Extensions
In retargeting loop-based code for multimedia instruction set extensions, a critical issue is that vector data types of mixed precision within a loop body complicate the paralleli...
Lewis B. Baumstark Jr., Linda M. Wills
CP
2006
Springer
13 years 11 months ago
Static and Dynamic Structural Symmetry Breaking
We reconsider the idea of structural symmetry breaking (SSB) for constraint satisfaction problems (CSPs). We show that the dynamic dominance checks used in symmetry breaking by dom...
Pierre Flener, Justin Pearson, Meinolf Sellmann, P...
IJCAI
2003
13 years 8 months ago
Amalgams of Constraint Satisfaction Problems
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...
Andrei A. Bulatov, Evgeny S. Skvortsov
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
14 years 7 months ago
Constraint-Based XML Query Rewriting For Data Integration
We study the problem of answering queries through a target schema, given a set of mappings between one or more source schemas and this target schema, and given that the data is at...
Cong Yu, Lucian Popa
ECAI
2006
Springer
13 years 11 months ago
Multi-Objective Propagation in Constraint Programming
Bounding constraints are used to bound the tolerance of solutions under certain undesirable features. Standard solvers propagate them one by one. Often times, it is easy to satisfy...
Emma Rollon, Javier Larrosa