3055 search results - page 13 / 611 » Randomized Search Trees |
117
Voted
AAAI
2006
15 years 3 months ago
2006
We derive a recursive formula for expected utility values in imperfect- information game trees, and an imperfectinformation game tree search algorithm based on it. The formula and...
170
click to vote
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
134
click to vote
VLDB
1999
ACM
15 years 6 months ago
1999
ACM
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
109
click to vote
RSA
2006
15 years 2 months ago
2006
We study random cutting down of a rooted tree and show that the number of cuts is equal (in distribution) to the number of records in the tree when edges (or vertices) are assigned...
219
click to vote
ICDE
2009
IEEE
16 years 4 months ago
2009
IEEE
Abstract-- Large flash disks have become an attractive alternative to magnetic hard disks, due to their high random read performance, low energy consumption and other features. How...