The general class of online algorithms. An online algorithm is provided with an initial model,
represented by a universe encoding the probability distribution over the initial state,
and a transition model, which produces a universe encoding the probability distribution
over the new state. An implementation of Online must implement the update method.
Querying and asserting evidence to a online algorithm are done using references. This is because references are stable over time,
while the particular elements they refer to are not.
The general class of online algorithms. An online algorithm is provided with an initial model, represented by a universe encoding the probability distribution over the initial state, and a transition model, which produces a universe encoding the probability distribution over the new state. An implementation of Online must implement the update method.
Querying and asserting evidence to a online algorithm are done using references. This is because references are stable over time, while the particular elements they refer to are not.