380 search results - page 26 / 76 » Mapping Problems with Finite-Domain Variables into Problems ... |
CP
2005
Springer
14 years 1 months ago
2005
Springer
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
ACTA
2006
13 years 7 months ago
2006
Abstract Selectivity estimation of a boolean query based on frequent itemsets can be solved by describing the problem by a linear program. However, the number of variables in the e...
ICDE
2010
IEEE
13 years 11 months ago
2010
IEEE
Modern science is collecting massive amounts of data from sensors, instruments, and through computer simulation. It is widely believed that analysis of this data will hold the key ...
EAAI
2008
13 years 7 months ago
2008
: In real life scenarios there is often the need for modelling conditional plans where external events determgine the actual execution sequence. Conditional Temporal Problems (CTPs...
VISAPP
2010
13 years 5 months ago
2010
phies are also mentioned and a common mathematical abstraction for all these inverses problems will be presented. By focusing on a simple linear forward model, first a synthetic an...