Sciweavers

94 search results - page 1 / 19
» Scalable Precomputed Search Trees
Sort
View
MIG
2010
Springer
13 years 3 months ago
Scalable Precomputed Search Trees
Manfred Lau, James Kuffner
KDD
2007
ACM
148views Data Mining» more  KDD 2007»
14 years 5 months ago
Scalable look-ahead linear regression trees
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
David S. Vogel, Ognian Asparouhov, Tobias Scheffer
CG
2010
Springer
13 years 2 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...
ICC
2007
IEEE
116views Communications» more  ICC 2007»
13 years 11 months ago
Skip Tree Graph: a Distributed and Balanced Search Tree for Peer-to-Peer Networks
Abstract—Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It...
Alejandra González Beltrán, Paul Sag...
EDBT
2006
ACM
159views Database» more  EDBT 2006»
14 years 4 months ago
Fast Nearest Neighbor Search on Road Networks
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
Haibo Hu, Dik Lun Lee, Jianliang Xu