SCOPUS 정보 검색 플랫폼

Volumn 261, Issue 2, 2001, Pages 267-295

The ultimate strategy to search on m rays?

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ROBOTICS;

LINEAR TIME ALGORITHMS;

MOTION PLANNING;

EID: 0034925308 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/S0304-3975(00)00144-4 Document Type: Conference Paper

Times cited : (51)

References (18)

1
- 0001544160
- Searching in the plane
- (1993) Inform. and Comput. , vol.106 , pp. 234-252
- Baeza-Yates, R.¹ Culberson, J.² Rawlins, G.³

2
- 84955607986
- Competitive searching in polygons - Beyond generalized streets
- Proc. 6th Annual Internat. Symp. on Algorithms and Computation, Springer, Berlin
- (1995) Lecture Notes in Computer Science , vol.1004 , pp. 32-41
- Datta, A.¹ Hipke, Ch.² Schuierer, S.³

3
- 0004515756
- Competitive searching in a generalized street
- (1999) Comput. Geom. Theory Appl. , vol.13 , pp. 109-120
- Datta, A.¹ Icking, Ch.²

6
- 0004517896
- How to find a point on a line within a fixed distance
- (1999) Discrete Appl. Math. , vol.93 , pp. 67-73
- Hipke, Ch.¹ Icking, Ch.² Klein, R.³ Langetepe, E.⁴

7
- 84949050259
- Searching for the kernel of a polygon: A competitive strategy
- (1995) Proc. 11th Annu. ACM Symp. Comput. Geom. , pp. 258-266
- Icking, Ch.¹ Klein, R.²

8
- 0004490780
- Optimal constructions of hybrid algorithms
- (1998) J. Algorithms , vol.29 , pp. 142-164
- Kao, M.Y.¹ Ma, Y.² Sipser, M.³ Yin, Y.⁴

9
- 0004512767
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
- (1997) Inform. and Comput. , vol.131 , Issue.1 , pp. 63-80
- Kao, M.Y.¹ Reif, J.H.² Tate, S.R.³

10
- 0027035404
- Walking an unknown street with bounded detour
- (1992) Comput. Geom. Theory Appl. , vol.1 , pp. 325-351
- Klein, R.¹

11
- 0004140018
- Addison-Wesley, Reading, MA
- (1997) Algorithmische Geometrie
- Klein, R.¹

12
- 84947754508
- Searching a fixed graph
- Proc. 23rd Internat. Colloq. on Automata, Languages and Programming, Springer, Berlin
- (1996) Lecture Notes in Computer Science , vol.1099 , pp. 280-289
- Koutsoupias, E.¹ Papadimitriou, Ch.² Yannakakis, M.³

13
- 0004491829
- Ph.D. Thesis, Department of Computer Science, University of Waterloo
- (1996) On-line searching on bounded and unbounded domains
- López-Ortiz, A.¹

14
- 84958037303
- Generalized streets revisited
- M. Serna, J. Diaz (Eds.), Proc. 4th European Symp. on Algorithms, Springer, Berlin
- (1996) Lecture Notes in Computer Science , vol.1136 , pp. 546-558
- López-Ortiz, A.¹ Schuierer, S.²

15
- 84947943826
- Position-independent near optimal searching and on-line recognition in star polygons
- Proc. 5th Workshop on Algorithms and Data Structures, Springer, Berlin
- (1997) Lecture Notes in Computer Science , vol.1272 , pp. 284-296
- López-Ortiz, A.¹ Schuierer, S.²

16
- 0026190127
- Shortest paths without a map
- (1991) Theoret. Comput. Sci. , vol.84 , Issue.1 , pp. 127-150
- Papadimitriou, C.H.¹ Yannakakis, M.²

17
- 0022012946
- Amortized efficiency of list update and paging rules
- (1985) Comm. ACM , vol.28 , pp. 202-208
- Sleator, D.D.¹ Tarjan, R.E.²

18
- 0004531825
- Ph.D. Thesis, Department of Mathematics and Laboratory for Computer Science, MIT, MA
- (1994) Teaching, learning, and exploration
- Yin, Y.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.