Go Back   London Fixed-gear and Single-speed > Miscellaneous & Meaningless


 
Thread Tools
Old 18th August 2008   #1
cg5154
 
cg5154's Avatar
No wonder I spend so much time on this forum

I have the following options:

1) Trawl through code (written by somebody else) that generates a complicated report, trying to figure out why a certain number is incorrect by a factor of 4000
2) Read every single post on this forum

Which would you choose?
  quote   reply
Registered users don't see adverts. Signup or signin to hide them.
Old 18th August 2008   #2
teenslain
 
teenslain's Avatar
Poll! ;)
  quote   reply
Old 18th August 2008   #3
Broker
 
Broker's Avatar
Geek
  quote   reply
Old 18th August 2008   #4
Superprecise
 
Superprecise's Avatar
I have a similar dilemma:

1) calculate times taken to travel between various points by ferry in an imaginary city in a far away country
2) read every single post on this forum
  quote   reply
Old 18th August 2008   #5
cg5154
 
cg5154's Avatar
Quote:
Originally Posted by Broker View Post
Geek
Fuckin' aye. I say it loud and I say it proud.
  quote   reply
Old 18th August 2008   #6
The Seldom Killer
 
The Seldom Killer's Avatar
I could individually update lead times on a poorly configures SAP system and then process the resulting stock requirement exceptions.

cg5154 - does CTRL+F x4000 help you out any?

Last edited by The Seldom Killer; 18th August 2008 at 15:35.. Reason: Worthless Degenerate Scum. Die Motherfucker Die
  quote   reply
Old 18th August 2008   #7
cg5154
 
cg5154's Avatar
Quote:
Originally Posted by Superprecise View Post
I have a similar dilemma:

1) calculate times taken to travel between various points by ferry in an imaginary city in a far away country
2) read every single post on this forum
As a geek, I feel obligated to suggest that you write a program that creates a weighted graph and applies Dijkstra's shortest path algorithm. It'll take more time than doing the calculations manually, but so much more fun.
  quote   reply
Old 18th August 2008   #8
mikec
 
mikec's Avatar
I hate going through other peoples code! Most haven't got a clue and I get very frustrated. I tend to rewrite whole chunks of it when asked to do it. I can see your point
  quote   reply
Old 18th August 2008   #9
the-smiling-buddha
 
the-smiling-buddha's Avatar
All 2,500 Television channels are working properly, no problem with the 5,000 radio channels, not much news, the Olympics has been up and running for days all twenty three space craft are working properly and I am not back at Uni until september.
  quote   reply
Old 18th August 2008   #10
Sparky
 
Sparky's Avatar
Shortest path is for the travelling salesman problem, this sounds like something different. In any case, I wouldn't use that. Depending on the level of accuracy needed I would use a metaheuristic like a genetic algorithm.
  quote   reply
Old 19th August 2008   #11
rjs
 
rjs's Avatar
Quote:
Originally Posted by Sparky View Post
Shortest path is for the travelling salesman problem, this sounds like something different. In any case, I wouldn't use that. Depending on the level of accuracy needed I would use a metaheuristic like a genetic algorithm.
But it works for routing passengers via ferries - given that path costs are time, then you get a overall topology that will show you the fastest way between node A and node B. However, you need to run Dijkstra's for each node in the graph to find the quickest way between any two arbitrary nodes.

SPF algorithms are awesome. </network geek>
  quote   reply
Old 19th August 2008   #12
Buffalo Bill
 
Buffalo Bill's Avatar
Quote:
Originally Posted by the-smiling-buddha View Post
All 2,500 Television channels are working properly, no problem with the 5,000 radio channels, not much news, the Olympics has been up and running for days all twenty three space craft are working properly and I am not back at Uni until september.
Show off!
  quote   reply
Old 19th August 2008   #13
Sparky
 
Sparky's Avatar
Quote:
Originally Posted by rjs View Post
But it works for routing passengers via ferries - given that path costs are time, then you get a overall topology that will show you the fastest way between node A and node B. However, you need to run Dijkstra's for each node in the graph to find the quickest way between any two arbitrary nodes.

SPF algorithms are awesome. </network geek>
I think he's trying to calculate journey times for ferry crossings, not the shortest route between a set.
  quote   reply

Bookmarks Shortcuts
Posts Categories

Tags
forum, spend, time
Registered users don't see adverts. Signup or signin to hide them.


Currently Active Users Viewing This Thread: 1 (0 members and 1 guests)
 
Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
I Like This Forum bosshogg General 8 7th August 2008 19:53
£800 to spend, looking for ideas twist305 Bikes & Bits 44 6th August 2008 13:32
Help me spend around £800 20thebear Bikes & Bits 27 5th May 2008 17:58
£1000 to Spend on (non-fixed) Bike. Suggestions? mashton Bikes & Bits 29 11th March 2008 18:07
£60 to spend. What to buy? rusty General 12 29th October 2007 15:04

Creative Commons License All times are GMT. The time now is 00:27.

Search Engine Optimization by vBSEO 3.2.0 (Unauthorized Upgrade)