1186 search results - page 187 / 238 » Improving Random Walk Performance |
ICML
2007
IEEE
14 years 10 months ago
2007
IEEE
The UCT algorithm learns a value function online using sample-based search. The TD() algorithm can learn a value function offline for the on-policy distribution. We consider three...
ICML
2005
IEEE
14 years 10 months ago
2005
IEEE
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
ICML
2001
IEEE
14 years 10 months ago
2001
IEEE
Direct policy search is a practical way to solve reinforcement learning problems involving continuous state and action spaces. The goal becomes finding policy parameters that maxi...
MOBIHOC
2009
ACM
14 years 10 months ago
2009
ACM
In this paper, we propose a practical scheme, called Non-Binary Joint Network-Channel Decoding (NB-JNCD) for reliable communication in wireless networks. It seamlessly couples cha...
KDD
2007
ACM
14 years 10 months ago
2007
ACM
We address the task of learning rankings of documents from search engine logs of user behavior. Previous work on this problem has relied on passively collected clickthrough data. ...