Benchmark #8s -- Dynamic Program 
 Large Sparse Matrices
Date:    Thu Jan 30 14:45:56 2003


Matrix Size = 700000
Entries per column   =  4
Number of matrices   =  2
Length of solution   =  100
Partition sizes     = 2   50

Time for set up: 
time: Setup CPU    =      48.1900  seconds
time: Setup Wall   =      48.6088  seconds
Time to run: 
time: Run CPU    =      84.7200  seconds
time: Run Wall   =      85.6503  seconds

Lg probability of path = 
data:                              -71.8474

A few of the steps are:
Steps 0 through 19
data:   332885  191375  402402   47566  176596  472823  146046  280204  570634  408732
data:   425321  647641  475954  540994  692097  204334  321432  141200  443473  138414

Steps 50 through 69
data:   659551  358583  669133   26955  486404  166261  619199  240878   92152  619816
data:   205637  521680  284569  419264  241036  373417  298303  417264  139605  457031

Steps 81 through 100
data:   556349  617372  192978  454327  439960  345413  486113  538312  442223  688740
data:   589385   95938  417876  511388  337275  361019   90827  416240  296280  285192