links for 2009-06-01
by Mike on June 1, 2009
Companies are working fast to figure out how to make money from the wealth of data they’re beginning to have about our online friendships
Lotus Connections is a little bit screwy when it comes to profile pictures IMHO as they are being forced to be square in Profiles (115×115 pixels). In profiles search results however they are scaled to 55 pixel in width and height is automatic. This post contains code to fix that.(tags: connections)
The core of any great race starts with your training. And, of course, what you do just prior to your race and then during the event itself will have a tremendous impact on your performance. Spelling out the details of these two areas could fill the pages of Triathlete magazine for the next 10 years, but there are a few steps you can take regardless of the training program you are following right now to help boost your chances of achieving your goals.
In the Traveling Salesman Problem, the goal is to find the shortest distance between N different cities. The path that the salesman takes is called a tour. Testing every possibility for an N city tour would be N! math additions. A 30 city tour would have to measure the total distance of be 2.65 X 1032 different tours. Assuming a trillion additions per second, this would take 252,333,390,232,297 years. Adding one more city would cause the time to increase by a factor of 31. Obviously, this is an impossible solution. A genetic algorithm can be used to find a solution is much less time. Although it might not find the best solution, it can find a near perfect solution for a 100 city tour in less than a minute. There are a couple of basic steps to solving the traveling salesman problem using a GA.