129 search results - page 6 / 26 » Average case analysis of the Boyer-Moore algorithm |
SODA
1998
ACM
13 years 8 months ago
1998
ACM
We prove that the First Fit bin packing algorithm is stable under the input distribution U{k - 2, k} for all k 3, settling an open question from the recent survey by Coffman, Gar...
COCOON
2008
Springer
13 years 9 months ago
2008
Springer
Consider a trader who exchanges one dollar into yen and assume that the exchange rate fluctuates within the interval [m, M]. The game ends without advance notice, then the trader ...
FCT
2001
Springer
13 years 12 months ago
2001
Springer
This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousan...
STOC
1989
ACM
13 years 11 months ago
1989
ACM
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
ALT
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...