127 search results - page 14 / 26 » Composing Complete and Partial Knowledge |
RTAS
2003
IEEE
14 years 1 months ago
2003
IEEE
A reward-based task typically consists of a mandatory part that must be accomplished before the given deadline, and an optional part that is associated with rewards for partial co...
CDC
2009
IEEE
13 years 11 months ago
2009
IEEE
In this paper, we analyze the verification of K-step opacity in discrete event systems that are modeled as (possibly non-deterministic) finite automata with partial observation on ...
UAI
1998
13 years 9 months ago
1998
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...
IR
2000
13 years 7 months ago
2000
In classic InformationRetrieval systems a relevant document will not be retrieved in response to a query if the document and query representations do not share at least one term. T...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
In this paper, we propose a novel unsupervised approach to query segmentation, an important task in Web search. We use a generative query model to recover a query's underlyin...