Prev: Do you get paid more than you deserve?
Next: Programming to Beat the Odds in Gaming
From: cr88192 on 7 May 2008 01:57

"Thomas Richter" <thor(a)math.tu-berlin.de> wrote in message
news:fvpbq8$5dc$1(a)infosun2.rus.uni-stuttgart.de...
> cr88192 wrote:
>
>> the point is to generate presumably non-clashing numbers.
>> in this case, they would serve as segment numbers in some large address
>> space.
>
> In that case, you don't want "random" numbers, but a random *permutation*
> of the 48bit space, which is something different. I forgot the algorithm
> to do that, but I remember, it's in Knuth's book.
>

no, for the reason that a random permutation requires some amount of
centralization (for example, the segment addresses being generated from a
centralized source, wheras in this case, this is not possible).


> So long,
> Thomas


First  |  Prev  | 
Pages: 1 2
Prev: Do you get paid more than you deserve?
Next: Programming to Beat the Odds in Gaming