829 search results - page 102 / 166 » Bandit Algorithms for Tree Search |
111
click to vote
STACS
1992
Springer
15 years 1 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
CP
2007
Springer
15 years 4 months ago
2007
Springer
The typical constraint store transmits a limited amount of information because it consists only of variable domains. We propose a richer constraint store in the form of a limited-w...
104
click to vote
DMIN
2007
14 years 11 months ago
2007
- Several algorithms have been introduced for mining frequent itemsets. The recent datasettransformation approach suffers either from the possible increasing in the number of struc...
101
click to vote
AI
2011
Springer
14 years 4 months ago
2011
Springer
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
KDD
2002
ACM
15 years 10 months ago
2002
ACM
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...