Sciweavers

10051 search results - page 1372 / 2011
» A Dynamic Separator Algorithm
Sort
View
ICML
2008
IEEE
16 years 8 months ago
Sample-based learning and search with permanent and transient memories
We present a reinforcement learning architecture, Dyna-2, that encompasses both samplebased learning and sample-based search, and that generalises across states during both learni...
David Silver, Martin Müller 0003, Richard S. ...
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
16 years 7 months ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...
KDD
2006
ACM
109views Data Mining» more  KDD 2006»
16 years 7 months ago
Extracting redundancy-aware top-k patterns
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
Dong Xin, Hong Cheng, Xifeng Yan, Jiawei Han
RECOMB
2006
Springer
16 years 7 months ago
New Methods for Detecting Lineage-Specific Selection
Abstract. So far, most methods for identifying sequences under selection based on comparative sequence data have either assumed selectional pressures are the same across all branch...
Adam C. Siepel, Katherine S. Pollard, David Haussl...
STOC
2002
ACM
156views Algorithms» more  STOC 2002»
16 years 7 months ago
Selfish traffic allocation for server farms
We investigate the price of selfish routing in non-cooperative networks in terms of the coordination and bicriteria ratios in the recently introduced game theoretic network model ...
Artur Czumaj, Piotr Krysta, Berthold Vöcking
« Prev « First page 1372 / 2011 Last » Next »