DocumentCode
1638111
Title
Sample complexity of continuous binary search with noisy information
Author
Wang, I-Jeng ; Chong, Edwin K P ; Quong, Russell W.
Author_Institution
Dept. of Electr. Eng., Purdue Univ., West Lafayette, IN, USA
Volume
1
fYear
1994
Firstpage
650
Abstract
Studies the sample complexity of a continuous binary search problem with probabilistic noise present in the information. The authors derive a general lower bound on the complexity and propose an algorithm that can solve the problem with arbitrary accuracy and confidence. The authors also give the sufficient condition on the number of samples for the success of the algorithm
Keywords
noise; probability; search problems; complexity; continuous binary search; noisy information; probabilistic noise; sample complexity; sufficient condition; Approximation algorithms; Random variables; Search problems; Sufficient conditions; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 1994., Proceedings of the 33rd IEEE Conference on
Conference_Location
Lake Buena Vista, FL
Print_ISBN
0-7803-1968-0
Type
conf
DOI
10.1109/CDC.1994.410970
Filename
410970
Link To Document