113 search results - page 13 / 23 » LTL Can Be More Succinct |
IACR
2011
13 years 9 months ago
2011
We put forward the notion of targeted malleability: given a homomorphic encryption scheme, in various scenarios we would like to restrict the homomorphic computations one can perf...
AIPS
2003
14 years 11 months ago
2003
There have been several proposals for expressing planning problems with different forms of uncertainty, including nondeterminism and partial observability. In this paper we invest...
LPNMR
2009
Springer
15 years 4 months ago
2009
Springer
Modular nonmonotonic logic programs (MLPs) under the answer-set semantics have been recently introduced as an ASP formalism in which modules can receive context-dependent input fro...
ICCSA
2005
Springer
15 years 3 months ago
2005
Springer
Vector quantization (VQ) is an elementary technique for image compression. However, searching for the nearest codeword in a codebook is time-consuming. The existing schemes focus o...
CATS
2008
14 years 11 months ago
2008
Lazy clause generation is a hybrid SAT and finite domain propagation solver that tries to combine the advantages of both: succinct modelling using finite domains and powerful nogo...