Sciweavers

1300 search results - page 37 / 260
» Constraint satisfaction problems and global cardinality cons...
Sort
View
DMDW
2001
91views Management» more  DMDW 2001»
14 years 11 months ago
On Estimating the Cardinality of Aggregate Views
Accurately estimating the cardinality of aggregate views is crucial for logical and physical design of data warehouses. While the warehouse is under development and data are not a...
Paolo Ciaccia, Matteo Golfarelli, Stefano Rizzi
CP
2009
Springer
15 years 1 months ago
Constraint-Based Local Search for the Automatic Generation of Architectural Tests
Abstract. This paper considers the automatic generation of architectural tests (ATGP), a fundamental problem in processor validation. ATGPs are complex conditional constraint satis...
Pascal Van Hentenryck, Carleton Coffrin, Boris Gut...
CAEPIA
2003
Springer
15 years 2 months ago
Distributed Non-binary Constraints
Nowadays many real problems can be modeled as Constraint Satisfaction Problems (CSPs). In many situations, it is desirable to be able to state both hard constraints and soft constr...
Miguel A. Salido, Federico Barber
AAAI
2004
14 years 11 months ago
The Complexity of Global Constraints
We study the computational complexity of reasoning with global constraints. We show that reasoning with such constraints is intractable in general. We then demonstrate how the sam...
Christian Bessière, Emmanuel Hebrard, Brahi...
EJC
2008
14 years 9 months ago
Majority constraints have bounded pathwidth duality
We study certain constraint satisfaction problems which are the problems of deciding whether there exists a homomorphism from a given relational structure to a fixed structure with...
Víctor Dalmau, Andrei A. Krokhin