离散空间上具有时滞的q-维1-容错搜索模型最优策略被引量：2

下载PDF

导出

作者刘文安张雪丽

机构地区河南师范大学数学与信息科学学院

出处《河南师范大学学报（自然科学版）》 CAS CSCD 北大核心 2008年第3期151-151,共1页 Journal of Henan Normal University(Natural Science Edition)

基金国家自然科学基金(10571045) 河南省杰出青年科学基金(074100510024) 河南省教育厅自然科学基金(2007110018)

关键词时滞遗失容错策略

参考文献3

1Pelc A. Searching games with errors-fifty years of coping with liars[J]. Theoret Comput Sci, 2002,270:71-109.
2Ambainis A, Bloch S A, Schweizer D L. Delayed binary search, or playing twenty questions with a procrastinator[J].Algorithmica, 2002, 32:641-650.
3Cicalese F, Vaccaro U. Binary search with delays and missing answers[J]. Information Processing Letters, 2003,85:239-247.

1KOOPMAN B O. Theory of Search,Part 1:Kinetic Bases[J].{H}Operations Research,1956,(03):324-346.
2KOOPMAN B O. Theory of Search,Part 2:Target Detection[J].{H}Operations Research,1956,(05):503-531.
3KOOPMAN B O. Theory of Search,Part 3:The Optimum Distribution of Searching Effort[J].{H}Operations Research,1956.613-627.
4PELC A. Searching Games with Errors:Fifty Years of Coping with Liars[J].{H}Theoretical computer science,2002,(1/2):71-109.
5STONE L D. Theory of Optimal Search[M].{H}New York:Academic Press,Inc,1975.120-153.
6HALEY K B,STONE L D. Search Theory and Applications[M].{H}New York:Plenum Press,1980.83-125.
7GAL S. Search Games[M].{H}New York:Academic Press,Inc,1980.96-135.
8AMBAINIS A,BLOCH S A,SCHWEITZER D L. Delayed Binary Search,or Playing Twenty Questions With aProcrastinator[J].{H}ALGORITHMICA,2002.641-650.
9KOOPMAN B O. Theory of Search, Part 1: Kinetic Bases [J]. Operations Research, 1956, 4(3): 324-346.
10KOOPMAN B O. Theory of Search, Part 2: Target Detection[J], Operations Research, 1956, 4(5): 503-531.

河南师范大学学报（自然科学版）

2008年第3期

内容加载中请稍等...