Sciweavers

475 search results - page 14 / 95
» TSSP: A Reinforcement Algorithm to Find Related Papers
Sort
View
ATAL
2008
Springer
13 years 9 months ago
Switching dynamics of multi-agent learning
This paper presents the dynamics of multi-agent reinforcement learning in multiple state problems. We extend previous work that formally modelled the relation between reinforcemen...
Peter Vrancx, Karl Tuyls, Ronald L. Westra
FLAIRS
2007
13 years 9 months ago
Maintaining Arc-Consistency over Mutex Relations in Planning Graphs during Search
We deal with the search process of the GraphPlan algorithm in this paper. We concentrate on a problem of finding supports for a sub-goal which arises during the search. We model t...
Pavel Surynek, Roman Barták
CIKM
2008
Springer
13 years 9 months ago
Modeling multi-step relevance propagation for expert finding
An expert finding system allows a user to type a simple text query and retrieve names and contact information of individuals that possess the expertise expressed in the query. Thi...
Pavel Serdyukov, Henning Rode, Djoerd Hiemstra
ICML
1999
IEEE
14 years 8 months ago
Using Reinforcement Learning to Spider the Web Efficiently
Consider the task of exploring the Web in order to find pages of a particular kind or on a particular topic. This task arises in the construction of search engines and Web knowled...
Jason Rennie, Andrew McCallum
EDBT
2012
ACM
228views Database» more  EDBT 2012»
11 years 10 months ago
Finding maximal k-edge-connected subgraphs from a large graph
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...