ACM Home Page
Please provide us with feedback. Feedback
A princess swimming in the fog looking for a monster cow
Full text PdfPdf (121 KB)
Source ACM SIGACT News archive
Volume 35 ,  Issue 2  (June 2004) table of contents
COLUMN: Online algorithms table of contents
Pages: 74 - 78  
Year of Publication: 2004
ISSN:0163-5700
Author
Marek Chrobak  University of California, Riverside
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 36,   Citation Count: 2
Additional Information:

references   cited by   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/992287.992304
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Steve Alpern and Shmuel Gal. The Theory of Search Games and Rendezvous. Kluwer, 2003.
 
2
 
3
V. J. Baston. Two rendezvous search problems on the line. Naval Research Logistics, 46:335--340, 1999.
 
4
R. Bellman. An optimal search problem. SIAM Review, 5:274, 1963.
 
5
R. Bellman. On the linear search problem. Naval Research Logistics Quarterly, 2:221--228, 1964.
 
6
Shmuel Gal. Search Games. Academic Press, 1980.
 
7
J. R. Isbell. An optimal search pattern. Naval Research Logistics Quarterly, 4:357--358, 1957.
 
8
 
9


Peer to Peer - Readers of this Article have also read: