首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   204篇
  免费   9篇
  国内免费   2篇
  215篇
  2024年   2篇
  2023年   8篇
  2022年   2篇
  2021年   2篇
  2020年   5篇
  2019年   4篇
  2018年   4篇
  2017年   9篇
  2016年   11篇
  2015年   15篇
  2014年   4篇
  2013年   10篇
  2012年   15篇
  2011年   16篇
  2010年   14篇
  2009年   11篇
  2008年   11篇
  2007年   13篇
  2006年   11篇
  2005年   8篇
  2004年   3篇
  2003年   2篇
  2002年   4篇
  2001年   6篇
  2000年   5篇
  1999年   9篇
  1998年   4篇
  1997年   2篇
  1996年   2篇
  1994年   1篇
  1990年   1篇
  1988年   1篇
排序方式: 共有215条查询结果,搜索用时 15 毫秒
151.
    
We consider the effects of cueing in a cooperative search mission that involves several autonomous agents. Two scenarios are discussed: one in which the search is conducted by a number of identical search‐and‐engage vehicles and one where these vehicles are assisted by a search‐only (reconnaissance) asset. The cooperation between the autonomous agents is facilitated via cueing, i.e., the information transmitted to the agents by a searcher that has just detected a target. The effect of cueing on the target detection probability is derived from first principles using a Markov chain analysis. In particular, it is demonstrated that the benefit of cueing on the system's effectiveness is bounded. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   
152.
本文在分析反潜编队应召搜索特点的基础上,对应召搜索能力进行了必要的战术计算,对应召搜索的效果进行了评估,为实际反潜作战中提高对潜搜索的效果提供了可靠的依据。  相似文献   
153.
侦察水雷是水雷战的一项重要内容。在水下无人作战平台和航空反水雷直升机作战平台搜索水雷概率模型分析基础上,给出了多平台协同搜索水雷方案优化模型,经分析归纳得到多平台协同搜索水雷最优方案,可为实际作战中多平台协同搜索水雷方案的制定、优化提供决策支持,具有较高的实用性。  相似文献   
154.
    
The Annealing Adaptive Search (AAS) algorithm for global optimization searches the solution space by sampling from a sequence of Boltzmann distributions. For a class of optimization problems, it has been shown that the complexity of AAS increases at most linearly in the problem dimension. However, despite its desirable property, sampling from a Boltzmann distribution at each iteration of the algorithm remains a practical challenge. Prior work to address this issue has focused on embedding Markov chain‐based sampling techniques within the AAS framework. In this article, based on ideas from the recent Cross‐Entropy method and Model Reference Adaptive Search, we propose an algorithm, called Model‐based Annealing Random Search (MARS), that complements prior work by sampling solutions from a sequence of surrogate distributions that iteratively approximate the target Boltzmann distributions. We establish a novel connection between MARS and the well‐known Stochastic Approximation method. By exploiting this connection, we prove the global convergence of MARS and characterize its asymptotic convergence rate behavior. Our empirical results indicate promising performance of the algorithm in comparison with some of the existing methods. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011  相似文献   
155.
    
We investigate the problem in which an agent has to find an object that moves between two locations according to a discrete Markov process (Pollock, Operat Res 18 (1970) 883–903). At every period, the agent has three options: searching left, searching right, and waiting. We assume that waiting is costless whereas searching is costly. Moreover, when the agent searches the location that contains the object, he finds it with probability 1 (i.e. there is no overlooking). Waiting can be useful because it could induce a more favorable probability distribution over the two locations next period. We find an essentially unique (nearly) optimal strategy, and prove that it is characterized by two thresholds (as conjectured by Weber, J Appl Probab 23 (1986) 708–717). We show, moreover, that it can never be optimal to search the location with the lower probability of containing the object. The latter result is far from obvious and is in clear contrast with the example in Ross (1983) for the model without waiting. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009  相似文献   
156.
    
Motivated by challenges in the smartphone manufacturing industry, we develop a dynamic production ramp-up model that can be applied to economically satisfy nonstationary demand for short-life-cycle products by high-tech companies. Due to shorter life cycles and more rapid evolution of smartphones, production ramp-up has been increasingly critical to the success of a new smartphone. In the production ramp-up, the key challenge is to match the increasing capacity to nonstationary demand. The high-tech smartphone manufacturers are urged to jointly consider the effect of increasing capacity and decreasing demand. We study the production planning problem using a high-dimensional Markov decision process (MDP) model to characterize the production ramp-up. To address the curse of dimensionality, we refine Monte Carlo tree search (MCTS) algorithm and theoretically analyze its convergence and computational complexity. In a real case study, we find that the MDP model achieves revenue improvement by stopping producing the existing product earlier than the benchmark policy. In synthetic instances, we validate that the proposed MCTS algorithm saves computation time without loss of solution quality compared with traditional value iteration algorithm. As part of the Lenovo production solution, our MDP model enables high-tech smartphone manufacturers to better plan the production ramp-up.  相似文献   
157.
反潜直升机吊声搜潜效能的建模仿真   总被引:9,自引:0,他引:9  
从直升机使用吊放声纳(简称吊声)的搜潜过程入手,通过仿真环境假设,吊声搜潜效能描述,建立了吊声搜潜效能的蒙特卡洛法模型。介绍了常用搜索方法,并建立了其搜索要素表。根据模型编制了仿真程序,实现了不同搜索方法的仿真计算,为研究不同战术条件下如何合理选择有效的搜索方法奠定了基础。  相似文献   
158.
舰载直升机反潜搜索最佳方案优选模型及应用   总被引:4,自引:0,他引:4  
目前,舰载直升机已成为现代水面舰艇搜潜反潜的重要力量,为了提高作战效率,对舰载直升机在反潜搜索中的战斗使用进行了研究,建立了搜索力的最优配置模型,解决了在已知目标分布的条件下舰载直升机反潜搜索中选择初始探测点、确定搜索路径、确定搜索次数以及搜索效率评估等问题,并在几种常见的目标分布下对最佳搜索方案作了实例演示,为舰载直升机的反潜战斗使用提供了依据。  相似文献   
159.
以空中无人平台为背景,研究了地磁辅助惯性导航系统。分析了地磁匹配的特点,给出了一维匹配的概念。从特征空间、相似性度量、搜索空间、搜索策略等四个方面对一维匹配进行了分析,建立了一个地磁匹配方法研究的框架。通过简化惯导解算过程,将一维地磁匹配归结为一个带补偿过程的仿射变换,并提出了一种基于等值线约束的组合匹配算法。该算法兼顾了匹配的全局搜索能力和局部定位能力,能在飞行过程中在线进行。在仿真和车载实验中,对算法的匹配精度、速度、适应性进行了分析和验证,检验了算法的有效性和可行性。  相似文献   
160.
以潜艇离散搜索战术为背景,对离散搜索的定义及优缺点进行了阐述,建立了离散搜索发现概率模型,模型中对单位周期的发现目标期望数和发现概率进行了计算,并对隐蔽与非隐蔽两种离散搜索样式的搜索效果进行了模拟仿真,但计算中没有考虑水声环境的影响和敌方潜艇实施反搜索的情况,最后,结合仿真结果,针对潜艇实际运用确定了高低速航行时间,提出了实施此战术时的几点建议,以期为部队合理使用离散搜索战术提供决策依据。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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