找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Optimal Search for Moving Targets; Lawrence D. Stone,Johannes O. Royset,Alan R. Washb Book 2016 Springer International Publishing Switzerl

[复制链接]
楼主: coherent
发表于 2025-3-25 03:39:15 | 显示全部楼层
Lawrence D. Stone,Johannes O. Royset,Alan R. Washburn
发表于 2025-3-25 08:37:30 | 显示全部楼层
Lawrence D. Stone,Johannes O. Royset,Alan R. Washburn
发表于 2025-3-25 15:28:31 | 显示全部楼层
发表于 2025-3-25 17:50:41 | 显示全部楼层
Lawrence D. Stone,Johannes O. Royset,Alan R. Washburn
发表于 2025-3-25 20:18:55 | 显示全部楼层
发表于 2025-3-26 02:12:42 | 显示全部楼层
发表于 2025-3-26 06:23:13 | 显示全部楼层
发表于 2025-3-26 09:21:00 | 显示全部楼层
Search for a Stationary Target,rget by a fixed time and explores related optimal search problems such as minimizing the mean time to find the target. It presents algorithms that may be used to compute optimal plans in most cases. Optimal search for a stationary target is covered more extensively in Stone (2007).
发表于 2025-3-26 14:54:43 | 显示全部楼层
发表于 2025-3-26 19:01:06 | 显示全部楼层
Search Games, location and movement to either discourage detection (Sect. 7.1) or encourage it (Sect. 7.2). The searcher will know the target’s capabilities, but not his habits or intentions, so probability laws for the target’s location and movement will be missing.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-31 23:04
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表