Sciweavers

197 search results - page 7 / 40
» Using Reinforcement Learning to Spider the Web Efficiently
Sort
View
CEC
2010
IEEE
14 years 10 months ago
Generating a novel sort algorithm using Reinforcement Programming
Abstract-- Reinforcement Programming (RP) is a new approach to automatically generating algorithms, that uses reinforcement learning techniques. This paper describes the RP approac...
Spencer K. White, Tony R. Martinez, George L. Rudo...
87
Voted
ICML
2006
IEEE
15 years 10 months ago
An analytic solution to discrete Bayesian reinforcement learning
Reinforcement learning (RL) was originally proposed as a framework to allow agents to learn in an online fashion as they interact with their environment. Existing RL algorithms co...
Pascal Poupart, Nikos A. Vlassis, Jesse Hoey, Kevi...
ECAI
2008
Springer
14 years 11 months ago
Reinforcement Learning with Classifier Selection for Focused Crawling
Focused crawlers are programs that wander in the Web, using its graph structure, and gather pages that belong to a specific topic. The most critical task in Focused Crawling is the...
Ioannis Partalas, Georgios Paliouras, Ioannis P. V...
AR
2008
118views more  AR 2008»
14 years 9 months ago
Efficient Behavior Learning Based on State Value Estimation of Self and Others
The existing reinforcement learning methods have been seriously suffering from the curse of dimension problem especially when they are applied to multiagent dynamic environments. ...
Yasutake Takahashi, Kentarou Noma, Minoru Asada
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