Sciweavers

252 search results - page 31 / 51
» Optimal Sequential Exploration: A Binary Learning Model
Sort
View
NIPS
1998
13 years 9 months ago
Lazy Learning Meets the Recursive Least Squares Algorithm
Lazy learning is a memory-based technique that, once a query is received, extracts a prediction interpolating locally the neighboring examples of the query which are considered re...
Mauro Birattari, Gianluca Bontempi, Hugues Bersini
JMLR
2010
125views more  JMLR 2010»
13 years 2 months ago
Variational methods for Reinforcement Learning
We consider reinforcement learning as solving a Markov decision process with unknown transition distribution. Based on interaction with the environment, an estimate of the transit...
Thomas Furmston, David Barber
BIOCOMP
2006
13 years 9 months ago
Acceleration of Covariance Models for Non-coding RNA Search
Stochastic context-free grammar (SCFG) based models for non-coding RNA (ncRNA) gene searches are much more powerful than regular grammar based models due to the ability to model in...
Scott F. Smith 0002
AAAI
1998
13 years 9 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies
PLDI
2011
ACM
12 years 10 months ago
A case for an SC-preserving compiler
The most intuitive memory consistency model for shared-memory multi-threaded programming is sequential consistency (SC). However, current concurrent programming languages support ...
Daniel Marino, Abhayendra Singh, Todd D. Millstein...