Optimal information organization for web and other displays

We usually look at information and assimilate them in small chunks in a time-wise linear fashion. Processing an information chunk x_j has two parts: (1) looking at x_j, and (2) recalling zero or more pre viously seen chunks x_i that have direct semantic relationship with x_j in order to properly assimilate x_j. Since a larger gap between the presentations of x_i and x_j means a larger effort in recalling x_i at x_j, the total recall effort R(x_j) at x_j depends on the order of presentation of x_i´s, but it does not affect the other effort of looking at x_j´s. We present an O(n²) algorithm to minimize ΣR(x_j) for a given collection of information chunks {x_j; 1 ≤ j ≤ n}, where the weights s(x_i, x_j) ≥ 0 represent the strength of the semantic dependency of x_j on x_i and the weights w(x_i) >; 0 represent the gap due to x_i.