Large Algorithmic Methods for Dynamic System Management
Baruch Awerbuch, Frank Thomson Leighton · 2001
The issue of uncertainty-tolerant computing has been largely ignored by algorithm designers, who focused on developing elegant mathematical structures for solving traditional combinatorial problems. Our goal is to build new algorithmic primitives for handling issues of uncertainty. The comprehensive algorithmic theory of decision-making in the presence of uncertainty may be applicable in domains outside of computer science, including control systems, economics, manufacturing, etc.