3009 search results - page 259 / 602 » The Expressive Rate of Constraints |
169
click to vote
EXPCS
2007
15 years 10 months ago
2007
Combinatorial optimization problems expressed as Boolean constraint satisfaction problems (BCSPs) arise in several contexts, ranging from the classical unate set-packing problems ...
148
click to vote
AIPS
2008
15 years 9 months ago
2008
In this paper, we report on a new solver for large instances of the Disjunctive Temporal Problem (DTP). Our solver is based primarily on the idea of employing "compact" ...
183
click to vote
AAAI
2004
15 years 8 months ago
2004
We present an efficient approach to adding soft constraints, in the form of preferences, to Disjunctive Temporal Problems (DTPs) and their subclass Temporal Constraint Satisfactio...
178
click to vote
AIPS
2003
15 years 8 months ago
2003
Scheduling algorithms for real-time systems can be characterized in various ways, one of the most important ones of which is the underlying task model. Many concepts of real-time ...
162
click to vote
DMDW
2001
15 years 8 months ago
2001
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...