SHERP

제한된 경로를 가지는 이동-표적 탐색 문제에 대한 휴리스틱 알고리듬 연구 (단독 탐색자, 탐색속도, 다수 탐색자)
Fast heuristic algorithms for the constrained paths moving target search problems (single searcher, search relocation, multiple searchers)

Cited 0 time in webofscience Cited 0 time in scopus
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse