摘要
本文通过建立简洁而有效的搜索方法 ,证明了对于无穷多个n来说 ,三个目标的最优搜索问题的最小试验次数等于信息论下界 .同时也研究了上述问题的修正情形 ,证明了对于所有整数n来说 ,对应的最小试验次数或者等于信息论下界或者超过信息论下界 1次并且对于无穷多个区间 ,信息论下界均是可以达到的 .
It is proved that the minimum number of weighings required to find three objects is equal to the information-theoretic bound for an infinite set of n's,by establishing some concise and powerful methods of searching.Moreover,a slightly modified problem is also considered.It is shown that for all integers n≥3,the corresponding minimum number of weighing is either equal to the information-theoretic bound,or exceeds it by 1 and the information-theoretic bound is achievable for infinitely many intervals.
出处
《应用数学》
CSCD
北大核心
2004年第3期405-409,共5页
Mathematica Applicata
基金
国家自然科学基金资助项目 (6 9874 0 10 )
关键词
组合搜索
序列算法
信息论下界
试验
Combinatorial search
Sequential algorithm
Information-theoretic bound
