66 search results - page 10 / 14 » Using Caching to Solve Larger Probabilistic Planning Problem... |
115
click to vote
TROB
2010
14 years 10 months ago
2010
—Robotic systems need to be able to plan control actions that are robust to the inherent uncertainty in the real world. This uncertainty arises due to uncertain state estimation,...
120
click to vote
JAIR
2006
14 years 11 months ago
2006
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic...
160
click to vote
RECOMB
2001
Springer
15 years 12 months ago
2001
Springer
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
109
click to vote
KDD
2009
ACM
16 years 4 days ago
2009
ACM
Behavioral targeting (BT) leverages historical user behavior to select the ads most relevant to users to display. The state-of-the-art of BT derives a linear Poisson regression mo...
ICTAI
1999
IEEE
15 years 3 months ago
1999
IEEE
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...