406 search results - page 27 / 82 » Kernelization and Complexity Results for Connectivity Augmen... |
124
click to vote
FUN
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
108
click to vote
ISAAC
2007
Springer
15 years 5 months ago
2007
Springer
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
ICLP
1997
Springer
15 years 3 months ago
1997
Springer
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
104
click to vote
TC
2010
14 years 10 months ago
2010
—In this paper, we investigate data parallelism in exact inference with respect to arbitrary junction trees. Exact inference is a key problem in exploring probabilistic graphical...
SOSP
2009
ACM
15 years 8 months ago
2009
ACM
Bugs in kernel extensions remain one of the main causes of poor operating system reliability despite proposed techniques that isolate extensions in separate protection domains to ...