1937 search results - page 98 / 388 » Conditioning Probabilistic Databases |
79
Voted
AAAI
2010
14 years 11 months ago
2010
Plan recognition is the problem of inferring the goals and plans of an agent after observing its behavior. Recently, it has been shown that this problem can be solved efficiently,...
IJAR
2008
14 years 10 months ago
2008
While quantitative probabilistic networks (QPNs) allow the expert to state influences between nodes in the network as influence signs, rather than conditional probabilities, infer...
JAIR
2007
14 years 10 months ago
2007
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
SASO
2009
IEEE
15 years 5 months ago
2009
IEEE
—The complexity of distributed computing systems and their increasing interaction with the physical world impose challenging requirements in terms of adaptation, robustness, and ...
ICDM
2009
IEEE
15 years 5 months ago
2009
IEEE
—Segmentation, the task of splitting a long sequence of discrete symbols into chunks, can provide important information about the nature of the sequence that is understandable to...