메뉴 건너뛰기




Volumn 318 LNCS, Issue , 1988, Pages 176-189

Searching with uncertainty extended abstract

Author keywords

[No Author keywords available]

Indexed keywords

ROBOTS;

EID: 85032225447     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-19487-8_20     Document Type: Conference Paper
Times cited : (45)

References (12)
  • 2
    • 0001647221 scopus 로고
    • Bulletin of the American Mathematical Society
    • Bellman, R.; “A Minimization Problem,” Bulletin of the American Mathematical Society, 62,270, 1956.
    • (1956) A Minimization Problem , vol.62 , pp. 270
    • Bellman, R.1
  • 3
    • 0002187292 scopus 로고
    • An Almost Optimal Algorithm for Unbounded Searching
    • Bentley, J. L., and Yao, A. C.-C.; “An Almost Optimal Algorithm for Unbounded Searching,” Information Processing Letters, 5, 82-87, 1976.
    • (1976) Information Processing Letters , vol.5 , pp. 82-87
    • Bentley, J.L.1    Yao, A.C.2
  • 4
    • 84910418123 scopus 로고
    • A Triangular Scanning Technique for Locating Boundary Curves
    • Chang, S.-K.; “A Triangular Scanning Technique for Locating Boundary Curves,” Computer Graphics and Image Processing, 3, 313-317, 1974.
    • (1974) Computer Graphics and Image Processing , vol.3 , pp. 313-317
    • Chang, S.-K.1
  • 5
    • 0345884843 scopus 로고
    • The Shortest Curve that Meets all the Lines that Meet a Convex Body
    • Faber, V. and Mycielski, J.; “The Shortest Curve that Meets all the Lines that Meet a Convex Body,” American Mathematical Monthly, 93, 796-801, 1986.
    • (1986) American Mathematical Monthly , vol.93 , pp. 796-801
    • Faber, V.1    Mycielski, J.2
  • 8
    • 85032225415 scopus 로고
    • Le Chasseur Perdu darts la Forêt, (In French)
    • [81 Joris, H.; “Le Chasseur Perdu darts la Forêt,” (in French), Element der Mathematik, 35, 1-14, 1980.
    • (1980) Element Der Mathematik , vol.35 , pp. 1-14
    • Joris, H.1


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