Sciweavers

197 search results - page 20 / 40
» Using Reinforcement Learning to Spider the Web Efficiently
Sort
View
ICML
1998
IEEE
15 years 10 months ago
Intra-Option Learning about Temporally Abstract Actions
tion Learning about Temporally Abstract Actions Richard S. Sutton Department of Computer Science University of Massachusetts Amherst, MA 01003-4610 rich@cs.umass.edu Doina Precup D...
Richard S. Sutton, Doina Precup, Satinder P. Singh
65
Voted
ICML
2009
IEEE
15 years 10 months ago
Monte-Carlo simulation balancing
In this paper we introduce the first algorithms for efficiently learning a simulation policy for Monte-Carlo search. Our main idea is to optimise the balance of a simulation polic...
David Silver, Gerald Tesauro
ATAL
2006
Springer
15 years 1 months ago
Efficient agent-based models for non-genomic evolution
Modeling dynamical systems composed of aggregations of primitive proteins is critical to the field of astrobiological science, which studies early evolutionary structures dealing ...
Nachi Gupta, Adrian K. Agogino, Kagan Tumer
62
Voted
ICALT
2005
IEEE
15 years 3 months ago
Discovery Service for User Models in a Multi-Application Context
In order to efficiently manage and use of the information on the Web it becomes crucial to provide personalization not only within single systems, but across various web applicati...
Vadim I. Chepegin, Lora Aroyo, Paul De Bra
COMCOM
2008
127views more  COMCOM 2008»
14 years 9 months ago
A dynamic routing protocol for keyword search in unstructured peer-to-peer networks
The idea of building query-oriented routing indices has changed the way of improving keyword search efficiency from the basis as it can learn the content distribution from the que...
Cong Shi, Dingyi Han, Yuanjie Liu, Shicong Meng, Y...