This paper provides analysis to a generalized version of the coupon collector problem, in which the collector gets d coupons each run and he chooses the one that he has the least ...
—For the WAVE applications built on safety beacons, it is imperative that the neighboring vehicle information be collected as quickly and efficiently as possible. But the unreli...
—Neighbor discovery1 is one of the first steps in the initialization of a wireless ad hoc network. In this paper, we design and analyze practical algorithms for neighbor discove...
Sudarshan Vasudevan, Donald F. Towsley, Dennis Goe...
We propose a model for level-ups in Heroes of Might and Magic III, and give an O 1 ε2 ln 1 δ learning algorithm to estimate the probabilities of secondary skills induced by any ...
We analyze a sequential game between a Gambler and a Casino. The Gambler allocates bets from a limited budget over a fixed menu of gambling events that are offered at equal time i...