首页 | 本学科首页   官方微博 | 高级检索  
     


On the two-dimensional cow search problem
Authors:Artur Je?
Affiliation:Institute of Computer Science, University of Wroc?aw, Wroc?aw, Poland
Abstract:We investigate the problem introduced by Baeza-Yates et al. [R.A. Baeza-Yates, J.C. Culberson, G.J.E. Rawlins, Searching with uncertainty, Research report, University of Waterloo, 1987]: given a plane and a horizontal or a vertical line in unknown location give a strategy to find this line. We use a competitive analysis to measure the performance of this strategy. This problem is one of the first generalisations of the cow search problem.
Keywords:On-line algorithms   Search problems   Uncertainty
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号