3055 search results - page 71 / 611 » Randomized Search Trees |
304
click to vote
ICAART
2010
INSTICC
16 years 4 months ago
2010
INSTICC
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
175
click to vote
IDEAS
2007
IEEE
16 years 1 months ago
2007
IEEE
Many recent applications deal with data streams, conceptually endless sequences of data records, often arriving at high flow rates. Standard data-mining techniques typically assu...
190
click to vote
FLAIRS
2006
15 years 8 months ago
2006
Decision Trees are well known for their training efficiency and their interpretable knowledge representation. They apply a greedy search and a divide-and-conquer approach to learn...
194
click to vote
INFOCOM
2005
IEEE
16 years 19 days ago
2005
IEEE
— We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes comb...
197
click to vote
ACG
2009
Springer
16 years 1 months ago
2009
Springer
With the recent success of Monte-Carlo tree search algorithms in Go and other games, and the increasing number of cores in standard CPUs, the efficient parallelization of the sear...