Sciweavers

2740 search results - page 37 / 548
» Approximating Component Selection
Sort
View
JAIR
2006
160views more  JAIR 2006»
14 years 9 months ago
Anytime Point-Based Approximations for Large POMDPs
The Partially Observable Markov Decision Process has long been recognized as a rich framework for real-world planning and control problems, especially in robotics. However exact s...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
NECO
1998
119views more  NECO 1998»
14 years 9 months ago
Density Estimation by Mixture Models with Smoothing Priors
In the statistical approach for self-organizing maps (SOMs), learning is regarded as an estimation algorithm for a Gaussian mixture model with a Gaussian smoothing prior on the ce...
Akio Utsugi
HPCA
2004
IEEE
15 years 10 months ago
Reducing Branch Misprediction Penalty via Selective Branch Recovery
Branch misprediction penalty consists of two components: the time wasted on mis-speculative execution until the mispredicted branch is resolved and the time to restart the pipelin...
Amit Gandhi, Haitham Akkary, Srikanth T. Srinivasa...
KR
2000
Springer
15 years 1 months ago
Anytime Diagnostic Reasoning using Approximate Boolean Constraint Propagation
In contrast with classical reasoning, where a solution is either correct or incorrect, approximate reasoning tries to compute solutions which are close to the ideal solution, with...
Alan Verberne, Frank van Harmelen, Annette ten Tei...
JMLR
2010
118views more  JMLR 2010»
14 years 4 months ago
On Over-fitting in Model Selection and Subsequent Selection Bias in Performance Evaluation
Model selection strategies for machine learning algorithms typically involve the numerical optimisation of an appropriate model selection criterion, often based on an estimator of...
Gavin C. Cawley, Nicola L. C. Talbot