Sciweavers

6042 search results - page 13 / 1209
» Repeated Observation Models
Sort
View
IJCAI
2001
14 years 11 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz
MOR
2006
79views more  MOR 2006»
14 years 9 months ago
The Value of Markov Chain Games with Lack of Information on One Side
We consider a two-player zero-sum game given by a Markov chain over a finite set of states K and a family of zero-sum matrix games (Gk)kK. The sequence of states follows the Marko...
Jérôme Renault
DAS
2010
Springer
14 years 7 months ago
Information extraction by finding repeated structure
Repetition of layout structure is prevalent in document images. In document design, such repetition conveys the underlying logical and functional structure of the data. For exampl...
Evgeniy Bart, Prateek Sarkar
AAAI
2010
14 years 11 months ago
Efficient Belief Propagation for Utility Maximization and Repeated Inference
Many problems require repeated inference on probabilistic graphical models, with different values for evidence variables or other changes. Examples of such problems include utilit...
Aniruddh Nath, Pedro Domingos
IJON
2002
79views more  IJON 2002»
14 years 9 months ago
Capacity of perirhinal cortex network for recognising frequently repeating stimuli
Much evidence indicates that discrimination of the familiarity of visual stimuli is dependent on the perirhinal cortex of the temporal lobe. A stimulus can become familiar to anim...
Rafal Bogacz, Malcolm W. Brown