摘要
针对离散空间上单目标3维e容错搜索模型中的end状态s,从理论上给出了提问者能够搜索成功的最小提问次数是其特征ch(s)。
This paper concerns the problem of optimal searching a single goal for 3 - ary with e lies in the discrete space. For the end state in the above model , theoretically we gave the minimum number of questions witch the quizzer asked to be able to search successfully in the state is its characteristic.
出处
《河南机电高等专科学校学报》
CAS
2009年第3期39-40,104,共3页
Journal of Henan Mechanical and Electrical Engineering College
关键词
3维e容错搜索模型
end状态
最小提问次数
k可解的
the model of 3 - ary search with e lies
end state
the minimum number of questions
k - solvable
