Results 1 
2 of
2
The Bit Vector Intersection Problem
, 1995
"... This paper introduces the bit vector intersection problem: given a large collection of sparse bit vectors, find all the pairs with at least t ones in common for a given input parameter t. The assumption is that the number of ones common to any two vectors is significantly less than t, except for an ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
for an unknown set of O(n) pairs. This problem has important applications in DNA physical mapping, clustering, and searching for approximate dictionary matches. We present two randomized algorithins that solve this problem with high probability and in subquadratic expected time. One of these algorithms is based
Bestfirst minimax search: First results
 In Proceedings of the AAAI'93 Fall Symposium
, 1993
"... We present a very simple selective minimax search algorithm for twoplayer gaines. It ahvays expands next the frontier node at the end of the principal variation, or current best line of play, which is the node that determines the minimax value of the root. The algorithm requires no information othe ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
other than a static evaluation function, and its time overhead per node is similar to that of alphabeta minimax. On random game trees, our algorithm outperforms an efficient implementation of alphabeta, giving both the same amount of computation. In the game of Othello, using the evaluation function