5316 search results - page 234 / 1064 » Which Search Problems Are Random |
138
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
148
click to vote
CPAIOR
2010
Springer
15 years 3 months ago
2010
Springer
Many search problems contain large amounts of redundancy in the search. In this paper we examine how to automatically exploit remaining subproblem equivalence, which arises when tw...
132
Voted
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
This paper investigates randomization and replication as strategies to achieve reliable performance in disk arrays targeted for video-on-demand (VoD) workloads. A disk array can p...
170
Voted
AAAI
2000
15 years 6 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
176
click to vote
ALGORITHMICA
2011
14 years 11 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...