AN OPTIMAL DISPATCH PLANNING OF GUARDS TO COUNTER TO A SUICIDE BOMBER
スポンサーリンク
概要
- 論文の詳細を見る
- 2010-07-01
著者
-
Fukuda Emiko
Department Of Computer Science National Defense Academy
-
Hohzaki Ryusuke
Department Of Computer Science National Defense Academy
-
Hohzaki Ryusuke
Department Of Applied Physics National Defense Academy
-
KOMIYA TORU
Department of Computer Science, National Defense Academy
-
POLPARNT METHEE
Department of Computer Engineering, Chulachomklao Royal Military Academy
-
Komiya Toru
Department Of Computer Science National Defense Academy
-
Polparnt Methee
Department Of Computer Engineering Chulachomklao Royal Military Academy
関連論文
- HIDE-AND-SEAERCH GAME WITH THE RISK CRITERION
- AN OPTIMAL SEARCH FOR A DISAPPEARING TARGET WITH A RANDOM LIFETIME
- PATH CONSTRAINED SEARCH PROBLEM WITH REWARD CRITERION
- AN OPTIMAL DISPATCH PLANNING OF GUARDS TO COUNTER TO A SUICIDE BOMBER
- A SEARCH GAME WITH DURABLE SEARCHING RESOURCES
- A SHORTEST PATH PROBLEM ON THE NETWORK WITH AGV-TYPE TIME-WINDOWS
- Rescheduling for AGVs by Time Windows Concept
- AN OPTIMAL SEARCH PLAN FOR A MOVING TARGET WHEN A SEARCH PATH IS GIVEN
- Efficient Algorithms for a Convex Programming Problem with a Constraint on the Weighted Total Amount
- A MOVING TARGET SEARCH PROBLEM WITH NESTED CONSTRAINTS OF SEARCH EFFORT