1974 search results - page 239 / 395 » On Unbiased Linear Approximations |
JMLR
2010
14 years 4 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
JMLR
2010
14 years 4 months ago
2010
Virtually all methods of learning dynamic systems from data start from the same basic assumption: the learning algorithm will be given a sequence of data generated from the dynami...
82
Voted
SIAMCO
2010
14 years 4 months ago
2010
Abstract. We establish results for the problem of tracking a time-dependent manifold arising in realtime optimization by casting this as a parametric generalized equation. We demon...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Abstract— In this paper, we derive a maximum-likelihood (ML) decoder of the decode-and-forward (DF) protocol utilizing an arbitrary complex-valued M-point constellation. Existing...
109
click to vote
MMAS
2011
Springer
14 years 29 days ago
2011
Springer
This paper introduces a new sweeping preconditioner for the iterative solution of the variable coefficient Helmholtz equation in two and three dimensions. The algorithms follow th...