Improvement for anytime systems with modular architecture

Anytime systems represent a subfamily of the realtime ones. They provide continuous operation even in cases when the circumstances are changing, e.g temporary shortage of time, changing computational power, etc. As the available computation time decreases, the accuracy of the computation becomes negatively affected. Iterative algorithms support this kind of computation. Unfortunately the construction of iterative algorithms is complex and their usability is limited. In this paper a novel method for anytime systems with modular architecture is introduced. The main aim of the proposed algorithm is to extend the applicability of anytime systems. The effectiveness of the algorithm is demonstrated on a categorization problem.