Rick White stsci.edu> writes:
> It seems like numpy.random.permutation is pretty suboptimal in its
> speed. Here's a Python 1-liner that does the same thing (I think)
> but is a lot faster:
>
> a = 1+numpy.random.rand(M).argsort()[0:N-1]
>
> This still has the the problem that it generates
Anne Archibald gmail.com> writes:
> This was discussed on one of the mailing lists several months ago. It
> turns out that there is no simple way to efficiently choose without
> replacement in numpy/scipy.
That reassures me that I'm not missing something obvious! I'm pretty new with
numpy (I've
Robert Kern gmail.com> writes:
> On Thu, Sep 18, 2008 at 16:55, Paul Moore yahoo.co.uk> wrote:
> > I want to generate a series of random samples, to do simulations based
> > on them. Essentially, I want to be able to produce a SAMPLESIZE * N
> > matrix, where each
I want to generate a series of random samples, to do simulations based
on them. Essentially, I want to be able to produce a SAMPLESIZE * N
matrix, where each row of N values consists of either
1. Integers between 1 and M (simulating M rolls of an N-sided die), or
2. A sample of N numbers between
Jarrod Millman wrote:
> Please test the Windows binaries. So far I have only seen two
> testers. I can't tag the release until I know that our binary
> installers work on a wide variety of Windows machines.
For what it's worth, I got this:
System information for \\GANDALF:
Uptime:
