77 search results - page 14 / 16 » Testing Basic Boolean Formulae |
CORR
1998
Springer
13 years 5 months ago
1998
Springer
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
WWW
2005
ACM
14 years 6 months ago
2005
ACM
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
JAIR
2010
13 years 4 months ago
2010
We present DCL-PC: a logic for reasoning about how the abilities of agents and coalitions of agents are altered by transferring control from one agent to another. The logical foun...