Optimal search for a moving target in discrete time and space
SS Brown - Operations research, 1980 - pubsonline.informs.org
We consider optimal search for a moving target in discrete space. A limited amount of search
effort is available at each of a fixed number of time intervals and we assume an exponential …
effort is available at each of a fixed number of time intervals and we assume an exponential …
Optimal Search for a Moving Target in Discrete Time and Space
SS Brown - Operations Research, 1980 - ideas.repec.org
We consider optimal search for a moving target in discrete space. A limited amount of search
effort is available at each of a fixed number of time intervals and we assume an exponential …
effort is available at each of a fixed number of time intervals and we assume an exponential …
[引用][C] OPTIMAL SEARCH FOR A MOVING TARGET IN DISCRETE TIME AND SPACE
SS BROWN - 1980 - pascal-francis.inist.fr
OPTIMAL SEARCH FOR A MOVING TARGET IN DISCRETE TIME AND SPACE CNRS Inist
Pascal-Francis CNRS Pascal and Francis Bibliographic Databases Simple search Advanced …
Pascal-Francis CNRS Pascal and Francis Bibliographic Databases Simple search Advanced …
Optimal Search for a Moving Target in Discrete Time and Space
SS Brown - Operations Research, 1980 - JSTOR
We consider optimal search for a moving target in discrete space. A limited amount of search
effort is available at each of a fixed number of time intervals and we assume an exponential …
effort is available at each of a fixed number of time intervals and we assume an exponential …
Optimal Search for a Moving Target in Discrete Time and Space
SS Brown - Operations Research, 1980 - econpapers.repec.org
We consider optimal search for a moving target in discrete space. A limited amount of search
effort is available at each of a fixed number of time intervals and we assume an exponential …
effort is available at each of a fixed number of time intervals and we assume an exponential …
Optimal Search for a Moving Target in Discrete Time and Space
SS Brown - Operations Research, 1980 - dl.acm.org
We consider optimal search for a moving target in discrete space. A limited amount of search
effort is available at each of a fixed number of time intervals and we assume an exponential …
effort is available at each of a fixed number of time intervals and we assume an exponential …
Optimal Search for a Moving Target in Discrete Time and Space
SS Brown - Operations Research, 1980 - cir.nii.ac.jp
抄録< jats: p> We consider optimal search for a moving target in discrete space. A limited
amount of search effort is available at each of a fixed number of time intervals and we …
amount of search effort is available at each of a fixed number of time intervals and we …
Optimal Search for a Moving Target in Discrete Time and Space.
SS Brown - Operations Research, 1980 - search.ebscohost.com
We consider optimal search for a moving target in discrete space. A limited amount of search
effort is available at each of a fixed number of time intervals and we assume an exponential …
effort is available at each of a fixed number of time intervals and we assume an exponential …
[引用][C] Optimal search for a moving target in discrete time and space
SS BROWN - Operat. Res., 1980 - cir.nii.ac.jp
Optimal search for a moving target in discrete time and space | CiNii Research CiNii 国立情報学
研究所 学術情報ナビゲータ[サイニィ] 詳細へ移動 検索フォームへ移動 論文・データをさがす 大学 …
研究所 学術情報ナビゲータ[サイニィ] 詳細へ移動 検索フォームへ移動 論文・データをさがす 大学 …