<?xml version="1.0" encoding="UTF-8" ?>
<?xml-stylesheet type="text/xsl" href="http://blogs.msdn.com/utility/FeedStylesheets/rss.xsl" media="screen"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:wfw="http://wellformedweb.org/CommentAPI/"><channel><title>I'm a traveling man, don't tie me down</title><link>http://blogs.msdn.com/b/ericlippert/archive/2003/09/24/i-m-a-traveling-man-don-t-tie-me-down.aspx</link><description>While I was waiting for a shuttle the other day (Microsoft has a fleet of shuttle busses that take people all over the campuses) I was thinking about optimization heuristics.</description><dc:language>en-US</dc:language><generator>Telligent Evolution Platform Developer Build (Build: 5.6.50428.7875)</generator><item><title>RE: I'm a traveling man, don't tie me down</title><link>http://blogs.msdn.com/b/ericlippert/archive/2003/09/24/i-m-a-traveling-man-don-t-tie-me-down.aspx#53096</link><pubDate>Tue, 30 Sep 2003 15:15:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:53096</guid><dc:creator>Alan Dean</dc:creator><description>It seems to me that the solution is a probabilistic algorithm. Each time you view a film, you gain more knowledge as to the probability of watching the film more than once. This explains the behaviour of buying classic movies from the past without having watched the DVD version.
If you watch a film once, the probability of watching becomes more known than before you watched it. For example, if the film was dross you may think &amp;quot;the chances of me watching that film again are nil! Heck, if it comes on I'm leaving the room.&amp;quot;
When you make it probabilistic, other behaviours start to make more sense too - why do we ask our friends and peers what they think of a new release? Because we can factor in the extent to which those who share our tastes enjoyed a film to our decision to view.
As an aside, I think that this is the driver behind the Amazon &amp;quot;people who bought this also bought&amp;quot; feature set.&lt;div style="clear:both;"&gt;&lt;/div&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=53096" width="1" height="1"&gt;</description></item><item><title>RE: I'm a traveling man, don't tie me down</title><link>http://blogs.msdn.com/b/ericlippert/archive/2003/09/24/i-m-a-traveling-man-don-t-tie-me-down.aspx#53095</link><pubDate>Fri, 26 Sep 2003 08:53:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:53095</guid><dc:creator>Ben Wilhelm</dc:creator><description>The only problem with precalculating is that if your data changes, you have to remember to precalculate it again. I write games for the PS2, and we'd be doomed without some form of precalculation . . . but on the minus side, rebuilding a level takes anywhere from an hour to a day to get it in full working order again.

Luckily it's all automated - in fact, we can rebuild the entire game with two commands if we want - but it's just a bit slow.&lt;div style="clear:both;"&gt;&lt;/div&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=53095" width="1" height="1"&gt;</description></item><item><title>RE: I'm a traveling man, don't tie me down</title><link>http://blogs.msdn.com/b/ericlippert/archive/2003/09/24/i-m-a-traveling-man-don-t-tie-me-down.aspx#53094</link><pubDate>Thu, 25 Sep 2003 06:25:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:53094</guid><dc:creator>Bruce</dc:creator><description>Another good trick is to pre-calculate when possible.  If the program is always calculating the postman's path for the same set of cities, you're better off just calculating the ideal path once in advance, and hard-coding that knowledge in your program.&lt;div style="clear:both;"&gt;&lt;/div&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=53094" width="1" height="1"&gt;</description></item><item><title>RE: I'm a traveling man, don't tie me down</title><link>http://blogs.msdn.com/b/ericlippert/archive/2003/09/24/i-m-a-traveling-man-don-t-tie-me-down.aspx#53093</link><pubDate>Thu, 25 Sep 2003 04:46:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:53093</guid><dc:creator>Eric Lippert</dc:creator><description>Indeed.  In fact, I've taken to doing crossword puzzles.  I can usually do the entire USATODAY crossword puzzle in one shuttle trip, but USATODAY publishes pretty unchallenging puzzles.&lt;div style="clear:both;"&gt;&lt;/div&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=53093" width="1" height="1"&gt;</description></item><item><title>RE: I'm a traveling man, don't tie me down</title><link>http://blogs.msdn.com/b/ericlippert/archive/2003/09/24/i-m-a-traveling-man-don-t-tie-me-down.aspx#53092</link><pubDate>Thu, 25 Sep 2003 04:17:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:53092</guid><dc:creator>Deadprogrammer</dc:creator><description>You can always sell a dvd on ebay. Also, you can read while waiting for the shuttle.  And you can also read on the shuttle.  &lt;div style="clear:both;"&gt;&lt;/div&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=53092" width="1" height="1"&gt;</description></item><item><title>RE: I'm a traveling man, don't tie me down</title><link>http://blogs.msdn.com/b/ericlippert/archive/2003/09/24/i-m-a-traveling-man-don-t-tie-me-down.aspx#53091</link><pubDate>Thu, 25 Sep 2003 04:13:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:53091</guid><dc:creator>Eric Lippert</dc:creator><description>Hmm, come to think of it, it would be better to buy the DVD on the fourth viewing.  Then the worst case is 4 viewings for $42, which is less than twice the optimal case.  But whatever, you take my point I'm sure.

Don't forget people, my degree is in MATHEMATICS, not ARITHMETIC.
&lt;div style="clear:both;"&gt;&lt;/div&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=53091" width="1" height="1"&gt;</description></item></channel></rss>