9997 search results - page 144 / 2000 » The case for crowd computing |
ITA
2008
14 years 10 months ago
2008
We propose a variation of Wythoff's game on three piles of tokens, in the sense that the losing positions can be derived from the Tribonacci word instead of the Fibonacci word...
RSA
2006
14 years 10 months ago
2006
Limit theorems (including a Berry-Esseen bound) are derived for the number of comparisons taken by the Boyer-Moore algorithm for finding the occurrences of a given pattern in a ra...
DC
2000
14 years 9 months ago
2000
ms, to use abstraction mappings to prove probabilistic properties, and to apply random walk theory in a distributed computational setting. We apply all of these techniques to analy...
DM
2002
14 years 9 months ago
2002
An approach to the computations of upper bounds on the size of large complete arcs is presented. In particular, we obtain geometrical properties of irreducible envelopes associated...
135
click to vote
Book
"In this article series you will be shown how to build a computer system. This article series will cover how to select and install everything such as the case, motherboard, vi...