As per Dave's LJ. I know at least 2 people who will find this way too funny:


( Read more... )

19th Birthday... Ugh...

I want it!

Take the travelling salesman problem (TSP). Since TSP is in NP-Complete and by defintion in NP, if you can find a polynomial algorithm then P = NP by definition. The solution is simple. In the future the salesman can teleport to each city thereby completely bypassing streets altogether. The path would be found in polynomial time by simply ( Read more... )

CLICK!

^_^

I had an interesting night... I don't really know if I want to explain it here because its just so bizarre. Its bizarre in contrast to what usually happens in my life. It was not a bad night at all. It started off good and stayed good until about midnight then it dipped a bit and then shot up to great around 12:30-12:45ish ( Read more... )

Main assumptions: constant trip delay, zero packet loss (using these for simplicity... can be extended later)

Two different solutions.

Server Side:-keep an IDictionary(Node,AugmentTime), play packet at time t = ArrivalTime + AugmentTime ( Read more... )

I realize the World Cup is long over but this just came to me while sitting at work ( Read more... )

- West Eglinton FC -We are currently in second place in the league with 21 points with a record of 7-2. We have won 7 straight after losing our first two games and are currently only 4 points behind the undefeated first place team. (Although they aren't REALLY undefeated since we beat them in the league cup game, but anyways.) We are playing ( Read more... )

FRIGGIN' HELL ( Read more... )