John, When I tried to ressurect my thing a couple years ago, I realized my original code was all wrong in trading time for space (plenty of time on the 386, then SunOS servers; not enough space, but new machine had plenty of unused RAM). I thought some about redesigning to reverse the trade-off, which would be helpful, but I'm sure it would not just be easier, but more effective, to run it on a cluster (many nodes, not much ram per node needed, and any nonzero amount of communication sufficient, but more can be usefull). Peter
On 10/2/08, John Hearns <[EMAIL PROTECTED]> wrote: > > > > 2008/10/2 Peter St. John <[EMAIL PROTECTED]> > >> John, >> After I first thought up my nutty GA scheme, I was then astonished by the >> John Holland Scientific American artifcle. I was aghast that anyone could >> even imagine thinking along those lines with 1960's hardware, as he had >> done. >> >> I believe I read the same article. > In fact, the first algorithm I tried was simulated annealing (I know this > does not equal a GA). It swapped so horrendously that I was discouraged, and > the thing took all night to run even for a simple 2D case (I was working on > radiation therapy planning). > I guess I should have been smarter and worked out how to do it within the > constraints of RAM that I had. > > _______________________________________________ > Beowulf mailing list, Beowulf@beowulf.org > To change your subscription (digest mode or unsubscribe) visit > http://www.beowulf.org/mailman/listinfo/beowulf > >
_______________________________________________ Beowulf mailing list, Beowulf@beowulf.org To change your subscription (digest mode or unsubscribe) visit http://www.beowulf.org/mailman/listinfo/beowulf
