Welcome to MSDN Blogs Sign in | Join | Help

October 2008 - Posts

Utilizing memoization and Dijkstra’s Fibonacci algorithm to compute large values

More of an acute fascination than anything else I expanded my use of memoization for computation to use a more efficient means of calculating Fibonacci sequences for values of n greater than 40 (previous Fibonacci example takes several minutes to compute

Extensions I found useful while developing with WPF and LINQ to SQL

  When I observe developers writing solutions using LINQ to SQL or Entity Framework, I see a number of conversions occurring time and time again. Below are some of the more trivial utility method extensions I used when developing solutions based

Significantly speeding up computations with smart predicates

There is a technique that allows optimization of repeated calculation results for a set of inputs called memoization . This technique is particularly helpful when working with numeric computations, pathing, such as for tree searches, etc. where the time
 
Page view tracker