Real-time algorithms for optimal recording of events

Real-time recording of a flux of random events is treated as a problem in minimizing the posteriori probability that a combination of samples of the process belongs to a specified class. Two algorithms are proposed which implement the method of realtime dynamic programming. These algorithms are compared in terms of utilizing the computer resources in solving the problem.