Sciweavers

1950 search results - page 67 / 390
» Varieties of Increasing Trees
Sort
View
CG
2010
Springer
13 years 6 months ago
Scalability and Parallelization of Monte-Carlo Tree Search
Monte-Carlo Tree Search is now a well established algorithm, in games and beyond. We analyze its scalability, and in particular its limitations, and the implications in terms of pa...
Amine Bourki, Guillaume Chaslot, Matthieu Coulm, V...
ICASSP
2009
IEEE
13 years 6 months ago
Tree configuration games for distributed stream mining systems
We consider the problem of configuring classifier trees in distributed stream mining system. The configuration involves selecting appropriate false-alarm detection tradeoffs for e...
Hyunggon Park, Deepak S. Turaga, Olivier Verscheur...
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 3 months ago
Upper Bounds for Maximally Greedy Binary Search Trees
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der...
Kyle Fox
IPPS
2007
IEEE
14 years 3 months ago
Power-Aware Routing for Well-Nested Communications On The Circuit Switched Tree
Although algorithms that employ dynamic reconfiguration are extremely fast, they need the underlying architecture to change structure very rapidly, possibly at each step of the c...
Hatem M. El-Boghdadi
ICDM
2003
IEEE
92views Data Mining» more  ICDM 2003»
14 years 2 months ago
Postprocessing Decision Trees to Extract Actionable Knowledge
Most data mining algorithms and tools stop at discovered customer models, producing distribution information on customer profiles. Such techniques, when applied to industrial pro...
Qiang Yang, Jie Yin, Charles X. Ling, Tielin Chen