76 search results - page 9 / 16 » Parallel Depth First Proof Number Search |
CVPR
2001
IEEE
14 years 10 months ago
2001
IEEE
Particle filters have proven to be an effective tool for visual tracking in non-gaussian, cluttered environments. Conventional particle filters however do not scale to the problem...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
1 The unstructured Peer-to-Peer (P2P) systems usually use a “blind search” method to find the requested data object by propagating a query to a number of peers randomly. In or...
ICN
2005
Springer
14 years 1 months ago
2005
Springer
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
KCAP
2003
ACM
14 years 1 months ago
2003
ACM
In this paper we describe a generic library of problemsolving methods (PSMs) for scheduling applications. Although, some attempts have been made in the past at developing librarie...
ADBIS
2003
Springer
14 years 1 months ago
2003
Springer
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...