Assumming good_quality_int_rand() ranges [0..15] and N is 9, the
mapping is 0->0, 1->1, ..., 8->8, 9->0, ..., 15->6. This shows 0 to 6
have twice of the chance of 7 and 8. This is the bias caused by
the modulo operation.
In addition,
>multiplication + rounding.
may return N. Use trancate instea
Thanks for the help with this. I actually managed to figure most of the
remaining details out on my own. I guess the chain management scheme in Orego
and Libego is a bit more efficient than mine due to the lack of pointer
initialization/management costs so I elected to modify my code and use the
Hi,
I thought I should let you know that I have accepted to serve as
programmers representative on the board of the ICGA. That position had
been vacant for a while, and the ICGA offered me to be an interim
representative until the election of the new board (which will take
place in Beijing).
On May 19, 2008, at 10:09 AM, Rémi Coulom <[EMAIL PROTECTED]>
wrote:
Hi,
I thought I should let you know that I have accepted to serve as
programmers representative on the board of the ICGA. That position
had been vacant for a while, and the ICGA offered me to be an
interim representati
Jason House wrote:
On May 19, 2008, at 10:09 AM, Rémi Coulom <[EMAIL PROTECTED]>
wrote:
Hi,
I thought I should let you know that I have accepted to serve as
programmers representative on the board of the ICGA. That position
had been vacant for a while, and the ICGA offered me to be an inter
On Mon, May 19, 2008 at 9:30 AM, Jason House
<[EMAIL PROTECTED]> wrote:
>
> On May 19, 2008, at 10:09 AM, Rémi Coulom <[EMAIL PROTECTED]> wrote:
[ICGA...]
>
>> So I am your representative, and any question or suggestion is welcome.
> I don't know what that means...__
I wrote:
> Hideki Kato wrote:
>> Gunnar Farnebäck: <[EMAIL PROTECTED]>:
>>> Hideki Kato wrote:
I didn't against you, Álvaro, rather I just made a caution for
programmers who will use your pseudo code as is. :)
First, I prefer SFMT (SIMD-oriented Fast Mersenne Twister) rather
>>
Thank you for detailed explanation. I've understood well now.
It's essentially the mapping problem from [0..N) to [0..M) where
N > M and N % M != 0 or N is greater than M and M don't divide N.
The frequencies of the mapping have to have the least difference, one
(unless discarding extra part of
I wrote:
>In addition, xor_shift is better than builtin rand() and faster and
>much smaller than MT.
but it's wrong. Sorry all.
I found recently a comparison at
http://www001.upp.so-net.ne.jp/isaku/rand.html (in Japanese).
Time to generate 10^8 pesudorandom numberson a Core 2 Duo E6600 +
VS20
