7930 search results - page 656 / 1586 » Greedy in Approximation Algorithms |
218
Voted
CORR
2006
Springer
15 years 7 months ago
2006
Springer
This paper addresses the issue of policy evaluation in Markov Decision Processes, using linear function approximation. It provides a unified view of algorithms such as TD(), LSTD()...
199
Voted
EWSN
2004
Springer
16 years 20 days ago
2004
Springer
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
217
Voted
JMLR
2008
15 years 7 months ago
2008
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
208
click to vote
JCC
2006
15 years 7 months ago
2006
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
207
Voted
ICCV
2005
IEEE
16 years 9 months ago
2005
IEEE
The goal of deconvolution is to recover an image x from its convolution with a known blurring function. This is equivalent to inverting the linear system y = Hx. In this paper we ...