937 search results - page 19 / 188 » On the Complexity of Partial Order Properties |
ICONIP
2009
14 years 7 months ago
2009
We study a subclass of POMDPs, called quasi-deterministic POMDPs (QDET-POMDPs), characterized by deterministic actions and stochastic observations. While this framework does not mo...
SRDS
1999
IEEE
15 years 2 months ago
1999
IEEE
Validating distributed systems is particularly difficult, since failures may occur due to a correlated occurrence of faults in different parts of the system. This paper describes ...
CORR
2012
Springer
13 years 5 months ago
2012
Springer
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
EJC
2008
14 years 10 months ago
2008
The motivation for this paper is three-fold. First, we study the connectivity properties of the homomorphism order of directed graphs, and more generally for relational structures...
LFCS
1992
Springer
15 years 2 months ago
1992
Springer
A generator program for a computable function (by definition) generates an infinite sequence of programs all but finitely many of which compute that function. Machine learning of ...