144 search results - page 10 / 29 » Time-Space Tradeoffs for Satisfiability |
GI
2010
Springer
13 years 5 months ago
2010
Springer
Abstract: Preference elicitation is often used in e-services to create product recommendations for their customers. We present an approach for applying preference elicitation techn...
AIPS
2003
13 years 9 months ago
2003
In business marketing, corporations and institutions are interested in executing a sequence of marketing actions to affect a group of customers. For example, a financial instituti...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
We continue the study of the trade-off between the length of PCPs and their query complexity, establishing the following main results (which refer to proofs of satisfiability of c...
RE
2005
Springer
14 years 1 months ago
2005
Springer
Existing requirements engineering approaches manage broadly scoped requirements and constraints in a fashion that is largely two-dimensional, where functional requirements serve a...
ENTCS
2008
13 years 7 months ago
2008
Most well-known algorithms for equational solving are based on quantifier elimination. This technique iteratively eliminates the innermost block of existential/universal quantifie...