829 search results - page 101 / 166 » Bandit Algorithms for Tree Search |
140
click to vote
AUSDM
2007
Springer
16 years 10 days ago
2007
Springer
Mining High Utility Itemsets from a transaction database is to find itemsests that have utility above a user-specified threshold. This problem is an extension of Frequent Itemset ...
140
click to vote
SAC
2004
ACM
15 years 11 months ago
2004
ACM
In this work we propose a parallel algorithm for the efficient extraction of binding-site consensus from genomic sequences. This algorithm, based on an existing approach, extracts...
186
click to vote
INFOCOM
2000
IEEE
15 years 9 months ago
2000
IEEE
The ability to classify packets according to pre-defined rules is critical to providing many sophisticated value-added services, such as security, QoS, load balancing, traffic acco...
169
click to vote
FSTTCS
2007
Springer
16 years 9 days ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
175
click to vote
IWPSE
2003
IEEE
15 years 11 months ago
2003
IEEE
The number of software systems is increasing at a rapid rate. For example, SourceForge currently has about sixty thousand software systems registered, twenty-two thousand of which...