Abstract
The author examines the following questions: Given specific information, what algorithm makes the best use of it, and is this algorithm simple and easy to implement? If information can be selected, what is the best strategy for doing so, and is this strategy adaptive (sequential)? How do the answers to the above questions change for noisy information? It is shown how the answers sometimes lead to sharp complexity bounds. Some generalizations concerning different error criteria, asymptotic setting, and random methods are briefly discussed.
Original language | English |
---|---|
Pages (from-to) | 374-379 |
Number of pages | 6 |
Journal | Proceedings of the American Control Conference |
DOIs | |
State | Published - 1990 |
Event | Proceedings of the 1990 American Control Conference - San Diego, CA, USA Duration: May 23 1990 → May 25 1990 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering