Parallel On-Line Searching
暂无分享,去创建一个
[1] Mihalis Yannakakis,et al. Shortest Paths Without a Map , 1989, Theor. Comput. Sci..
[2] Anna R. Karlin,et al. Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[3] Daniel P. Heyman,et al. Stochastic models in operations research , 1982 .
[4] Ming-Yang Kao,et al. Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem , 1996, SODA '93.
[5] A. Peterson,et al. Difference Equations: An Introduction with Applications , 2000 .
[6] Ricardo A. Baeza-Yates,et al. Searching in the Plane , 1993, Inf. Comput..
[7] M. Goldberg. A Minimization Problem , 1981 .
[8] Refael Hassin,et al. Minimal length curves that are not embeddable in an open planar set: the problem of a lost swimmer with a compass , 1992 .
[9] J. R. Isbell. An optimal search pattern , 1957 .
[10] B. Gluss. An alternative solution to the “lost at sea” problem , 1961 .
[11] B. Gluss. The minimax path in a search for a circle in a plane , 1961 .