Searching with Local Constraints on Erro
โ
Jurek Czyzowicz; K.B. Lakshmanan; Andrzej Pelc
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 175 KB
We give an asymptotically optimal algorithm of search for an unknown element in a finite set under the assumption that at most one error can occur in every sequence of \(r\) consecutive answers, where \(r \geqslant 3\) is a constant.