首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   113篇
  免费   35篇
  国内免费   14篇
  2023年   2篇
  2022年   2篇
  2021年   1篇
  2020年   3篇
  2018年   1篇
  2017年   8篇
  2016年   9篇
  2015年   13篇
  2014年   4篇
  2013年   7篇
  2012年   8篇
  2011年   14篇
  2010年   11篇
  2009年   9篇
  2008年   8篇
  2007年   11篇
  2006年   9篇
  2005年   7篇
  2004年   3篇
  2003年   2篇
  2002年   4篇
  2001年   6篇
  2000年   5篇
  1999年   4篇
  1998年   4篇
  1997年   2篇
  1996年   2篇
  1994年   1篇
  1990年   1篇
  1988年   1篇
排序方式: 共有162条查询结果,搜索用时 31 毫秒
61.
直升机吊放声纳搜索方法效能研究   总被引:7,自引:0,他引:7  
利用直升机吊放声纳对潜艇目标进行搜索,是航空反潜作战的重要环节.引入蒙特卡罗法对吊放声纳搜潜方法进行效能评估,以概率和统计理论方法得出其搜索概率作为评定吊放声纳搜潜方法效能的指标.对三种吊放声纳搜潜方法进行了效能仿真.通过计算机模拟对三种方法对潜艇目标的搜索概率进行比较,结果表明采用蒙特卡罗法对吊放声纳搜潜方法进行效能评估是可行有效的.  相似文献   
62.
Search theory originates from the military research efforts of WWII. Most researchers of that period modeled their search games in noncooperative games, where players are enemies or compete against each other. In this article, we deal with a cooperative search game, where multiple searchers behave cooperatively. First we describe several search problems and discuss the possibility of a coalition or cooperation among searchers. For the cooperative search game, we define a function named quasi‐characteristic function, which gives us a criterion similar to the so‐called characteristic function in the general coalition game with transferable utility. The search operation includes a kind of randomness with respect to whether the searchers can detect a target and get the value of the target. We also propose a methodology to divide the obtained target value among members of the coalition taking account of the randomness. As a concrete problem of the cooperative search game, we take the so‐called search allocation game, where searchers distribute their searching resources to detect a target in a cooperative way and the target moves in a search space to evade the searchers. Lastly, we discuss the core of the cooperative search allocation game. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009  相似文献   
63.
为了定量分析风对反潜巡逻机应召搜索延迟时间的影响,根据飞行气象学中风对飞行的影响描述以及实际需求,建立了反潜巡逻机飞往潜艇初始概略位置的航路模型。研究结果证明了模型的正确性,并通过仿真分析了反潜巡逻机的航速和航向、风速和风向的变化对延迟时间的影响。结果表明风对延迟时间的影响是不能忽略的,为反潜巡逻机航路的优化、应召搜索效能的提高提供了决策依据。  相似文献   
64.
针对指挥控制资源部署问题,引入任务复杂度来定义决策实体的工作负载,并建立以最小化决策实体工作负载的均方根为目标的优化模型。针对传统的层次聚类法容易陷入局部最优,提出了一种变邻域搜索(Variable Neighborhood Search,VNS)和模拟退火(Simulated Annealing,SA)相结合的具有全局性的求解方法,使用VNS进行全局寻优,使用SA对VNS中的邻域进行局部寻优。最后通过一个联合作战案例的平台调度方案,验证了所提方法的优越性。  相似文献   
65.
传统的电子战接收系统的搜索方式主要针对参数完全未知的敌方信号,通过在频域、空域等各维度进行大范围的逐段重复搜索可在较长时间内获得较好的侦察效果,但不适合短时间内对特定目标群的搜索和验证。针对电子战接收机存在的盲目侦察接收、与作战目标结合不紧密等问题,提出了一种基于作战目标的侦察策略,能够智能引导超外差接收机进行搜索截获,有效提升了超外差接收机对重点目标的实时截获与准确识别能力。  相似文献   
66.
基于约束条件的海上机动目标位置长期预测模型   总被引:2,自引:0,他引:2  
海上目标运动模型已经有很多,但是对海上机动目标位置的长期预测问题还没有得到很好的解决。灰色系统理论是解决时间序列问题的有效工具,将其与海上机动目标的运动特点相结合,可以较准确地预测海上机动目标在未来较长时期内的位置分布,为引导卫星搜索海上机动目标提供理论依据。  相似文献   
67.
This paper deals with a two‐person zero‐sum game called a search allocation game, where a searcher and a target participate, taking account of false contacts. The searcher distributes his search effort in a search space in order to detect the target. On the other hand, the target moves to avoid the searcher. As a payoff of the game, we take the cumulative amount of search effort weighted by the target distribution, which can be derived as an approximation of the detection probability of the target. The searcher's strategy is a plan of distributing search effort and the target's is a movement represented by a path or transition probability across the search space. In the search, there are false contacts caused by environmental noises, signal processing noises, or real objects resembling true targets. If they happen, the searcher must take some time for their investigation, which interrupts the search for a while. There have been few researches dealing with search games with false contacts. In this paper, we formulate the game into a mathematical programming problem to obtain its equilibrium point. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
68.
In this paper, we study a m‐parallel machine scheduling problem with a non‐crossing constraint motivated by crane scheduling in ports. We decompose the problem to allow time allocations to be determined once crane assignments are known and construct a backtracking search scheme that manipulates domain reduction and pruning strategies. Simple approximation heuristics are developed, one of which guarantees solutions to be at most two times the optimum. For large‐scale problems, a simulated annealing heuristic that uses random neighborhood generation is provided. Computational experiments are conducted to test the algorithms. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.  相似文献   
69.
In a rendez‐vous search two or more teams called seekers try to minimize the time needed to find each other. In this paper, we consider s seekers in a rectangular lattice of locations where each knows the configuration of the lattice, the distribution of the seekers at time 0, and its own location, but not the location of any other. We measure time discretely, in turns. A meeting takes place when the two seekers reach the same point or adjacent points. The main result is that for any dimension of lattice, any initial distribution of seekers there are optimal strategies for the seekers that converge (in a way we shall make clear) to a center. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
70.
搜索引擎是互联网信息检索技术的核心,中文搜索引擎与国外相比存在着搜索引擎覆盖率低、查准率不高、检索精度差、更新速度慢、无法控制网络信息的动态变化、对信息内容难于控制和管理等问题。对此,提出了中文搜索引擎从单一查询工具向综合化、全功能服务发展;分类主题一体化,检索语言向自然语言发展;查询智能化,向多国化和多语种化发展;搜索引擎集成化、网络资源著录标准化及利用智能代理技术的信息检索等对策。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号