A colleague stumbled upon a paper on Ant Colony Systems and gave it to me to try to implement it and to check if the results were as good as the paper promised.
It was amazing how the solutions were so close to optimal ( we checked the results from the ACS algorithm against the brute-force solutions that took hours to compute ) and how fast the algorithm stabilized on the solutions.
It was also the first time I had used an algorithm that does not really stop, it just converges to a solution and another heuristic decides when to accept a final result.
I learned a lot from it.
Or is the process to make a non-Eulerian graph Eulerian NP?
You can see screenshots and read code here: http://juliangamble.com/blog/2011/12/28/clojure-gui-demo-of-...
Check out ( https://hn.algolia.com/?q=wikipedia#!/story/sort_by_date/0/w... ) to see recent wikipedia submissions. Just recently someone linked to the wikipedia article for "Code Golf". At didn't get any upvotes, which is great, but I just don't understand the mindset behind submitting it. I guess easy karma? I don't know.
I'd much rather see content like "Here is my solution to problem X using ant colony optimization". This is the first time I've made a comment like this, because usually I just flag and move on. I guess I just needed to vent a little.
On the one hand, it's frustrating because, damn it, if you don't already know how to play with these concepts then why on earth are you calling yourself a "hacker", but then on the other hand http://xkcd.com/1053/
I think I'll write a little plugin that will hide all wikipedia links and I'll be happy. Maybe something like "hide all wikipedia links unless #comments > N" would work nicely.
I bet this is not the case in this case. I can understand the attitude against plain Wikipedia links but at least I learned a new idea because of this link.