Sciweavers

960 search results - page 79 / 192
» Optimal Monte Carlo Algorithms
Sort
View
ICML
2000
IEEE
14 years 9 months ago
Eligibility Traces for Off-Policy Policy Evaluation
Eligibility traces have been shown to speed reinforcement learning, to make it more robust to hidden states, and to provide a link between Monte Carlo and temporal-difference meth...
Doina Precup, Richard S. Sutton, Satinder P. Singh
FS
2006
123views more  FS 2006»
13 years 9 months ago
American Parisian options
Using the solution of the one-sided exit problem, a procedure to price Parisian barrier options in a jump-diffusion model with two-sided exponential jumps is developed. By extendin...
Marc Chesney, Laurent Gauthier
ICCV
2011
IEEE
12 years 9 months ago
Perturb-and-MAP Random Fields: Using Discrete Optimization\\to Learn and Sample from Energy Models
We propose a novel way to induce a random field from an energy function on discrete labels. It amounts to locally injecting noise to the energy potentials, followed by finding t...
George Papandreou, Alan L. Yuille
MOBICOM
2004
ACM
14 years 2 months ago
Localization for mobile sensor networks
Many sensor network applications require location awareness, but it is often too expensive to include a GPS receiver in a sensor network node. Hence, localization schemes for sens...
Lingxuan Hu, David Evans
ISMIR
2005
Springer
154views Music» more  ISMIR 2005»
14 years 2 months ago
Exploiting the Tradeoff Between Precision and Cpu-Time to Speed Up Nearest Neighbor Search
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
Pierre Roy, Jean-Julien Aucouturier, Franço...