Derivation of a parallel string matching algorithm
مقال من تأليف: Misra, Jayadev ;
ملخص: How many questions are necessary and sufficient to guess an unknown number x in the set S={1,2,…,n}, by using only comparison questions, that is questions of the type "Is xa?", aS, when answers to questions are received with a delay of d time units and up to c of the answers can be lost, i.e., can not be received at all? We exactly solve this problem for all integers d0 and c=1.
لغة:
إنجليزية