4117 search results - page 256 / 824 » On the Satisfiability of Complex Constraints |
198
click to vote
ECAI
2004
Springer
15 years 10 months ago
2004
Springer
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
210
click to vote
EMSOFT
2008
Springer
15 years 8 months ago
2008
Springer
Runtime property checking (as implemented in tools like Purify or Valgrind) checks whether a program execution satisfies a property. Active property checking extends runtime check...
194
click to vote
COMAD
2008
15 years 8 months ago
2008
Although many algorithms have been proposed for evaluating XPath queries containing un-ordered axes (child, descendant, parent and ancestor) against streaming XML data, there are ...
182
click to vote
EOR
2010
15 years 6 months ago
2010
We consider a call center with two classes of impatient customers: premium and regular classes. Modeling our call center as a multiclass GI/GI/s + M queue, we focus on developing ...
167
click to vote
ML
2008
ACM
15 years 6 months ago
2008
ACM
Pattern discovery techniques, such as association rule discovery, explore large search spaces of potential patterns to find those that satisfy some user-specified constraints. Due...