13987 search results - page 543 / 2798 » The Two Guards Problem |
203
click to vote
EUROCRYPT
2004
Springer
15 years 11 months ago
2004
Springer
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...
211
click to vote
CONCUR
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. We consider the control problem for timed automata against specifications given as MTL formulas. The logic MTL is a linear-time timed temporal logic which extends LTL wit...
167
click to vote
STACS
2000
Springer
15 years 10 months ago
2000
Springer
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...
190
click to vote
AAAI
2008
15 years 9 months ago
2008
We introduce the problem of zero-data learning, where a model must generalize to classes or tasks for which no training data are available and only a description of the classes or...
226
click to vote
FLAIRS
2007
15 years 9 months ago
2007
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...