5169 search results - page 562 / 1034 » Locality approximation using time |
204
click to vote
IJCAI
2007
15 years 8 months ago
2007
Agents often have to construct plans that obey deadlines or, more generally, resource limits for real-valued resources whose consumption can only be characterized by probability d...
187
click to vote
APIN
2008
15 years 7 months ago
2008
This paper presents a data-driven approach for feature selection to address the common problem of dealing with high-dimensional data. This approach is able to handle the real-valu...
188
click to vote
CGF
2008
15 years 7 months ago
2008
The accurate generation of soft shadows is a particularly computationally intensive task. In order to reduce rendering time, most real-time and offline applications decorrelate th...
214
Voted
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We present a numerical approximation technique for the analysis of continuous-time Markov chains that describe networks of biochemical reactions and play an important role in the ...
204
click to vote
JMLR
2006
15 years 7 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...