|Perl: the Markov chain saw|
Re^12: Travelling problem (Anyone better 86850?)by BrowserUk (Pope)
|on Dec 27, 2013 at 09:02 UTC||Need Help??|
Here's my second attempt at a threaded version. Running it with -T=24 won't be fastest unless you have 24 cores, but it has the interesting side effect of running all first picks in parallel.
Ignore this! (I was forgetting to add the last distance :( )
I've also recoded the algorithm into C which runs very quickly, but so far I haven't threaded it.
With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.