2996 search results - page 287 / 600 » Numberings and Randomness |
151
click to vote
EOR
2007
15 years 6 months ago
2007
In this paper, we consider a discrete-time finite-capacity queue with Bernoulli arrivals and batch services. In this queue, the single server has a variable service capacity and s...
156
click to vote
JAIR
2007
15 years 6 months ago
2007
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a novel constructive search technique that performs a series of resource-limited tree searches where each search begins...
164
click to vote
JSAC
2007
15 years 6 months ago
2007
—This paper derives the optimal search time and the optimal search cost that can be achieved in unstructured peer-topeer networks when the demand pattern exhibits clustering (i.e...
168
click to vote
TON
2002
15 years 6 months ago
2002
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
205
click to vote
PAMI
2007
15 years 6 months ago
2007
Abstract—We experimentally evaluate bagging and seven other randomizationbased approaches to creating an ensemble of decision tree classifiers. Statistical tests were performed o...