全文获取类型
| 收费全文 | 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条查询结果，搜索用时 0 毫秒
151.
针对概略射击条件下反舰导弹机动搜索目标策略优化选择的需求,采用搜索论的基本理论对反舰导弹机动搜捕策略问题进行了研究,建立了反舰导弹随机搜索策略、平行搜索策略和螺旋搜索策略搜捕概率计算模型,并进行了仿真计算。仿真结果表明:在已知目标概略位置的条件下,反舰导弹假若采取螺旋式搜索策略,能以较高的概率快速捕捉目标。 相似文献
152.
A classic problem in Search Theory is one in which a searcher allocates resources to the points of the integer interval [1, n] in an attempt to find an object which has been hidden in them using a known probability function. In this paper we consider a modification of this problem in which there is a protector who can also allocate resources to the points; allocating these resources makes it more difficult for the searcher to find an object. We model the situation as a two‐person non‐zero‐sum game so that we can take into account the fact that using resources can be costly. It is shown that this game has a unique Nash equilibrium when the searcher's probability of finding an object located at point i is of the form (1 − exp (−λixi)) exp (−μiyi) when the searcher and protector allocate resources xi and yi respectively to point i. An algorithm to find this Nash equilibrium is given. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47:85–96, 2000 相似文献
153.
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 相似文献
154.
We analyze an interdiction scenario where an interceptor attempts to catch an intruder as the intruder moves through the area of interest. A motivating example is the detection and interdiction of drug smuggling vessels in the Eastern Pacific and Caribbean. We study two models in this article. The first considers a nonstrategic target that moves through the area without taking evasive action to avoid the interdictor. We determine the optimal location the interceptor should position itself to best respond when a target arrives. The second model analyzes the strategic interaction between the interceptor and intruder using a Blotto approach. The intruder chooses a route to travel on and the interceptor chooses a route to patrol. We model the interaction as a two‐player game with a bilinear payoff function. We compute the optimal strategy for both players and examine several extensions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 29–40, 2017 相似文献
155.
David R. Morrison Jason J. Sauppe Wenda Zhang Sheldon H. Jacobson Edward C. Sewell 《海军后勤学研究》2017,64(1):64-82
The cyclic best‐first search (CBFS) strategy is a recent search strategy that has been successfully applied to branch‐and‐bound algorithms in a number of different settings. CBFS is a modification of best‐first search (BFS) that places search tree subproblems into contours which are collections of subproblems grouped in some way, and repeatedly cycles through all non‐empty contours, selecting one subproblem to explore from each. In this article, the theoretical properties of CBFS are analyzed for the first time. CBFS is proved to be a generalization of all other search strategies by using a contour definition that explores the same sequence of subproblems as any other search strategy. Further, a bound is proved between the number of subproblems explored by BFS and the number of children generated by CBFS, given a fixed branching strategy and set of pruning rules. Finally, a discussion of heuristic contour‐labeling functions is provided, and proof‐of‐concept computational results for mixed‐integer programming problems from the MIPLIB 2010 database are shown. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 64–82, 2017 相似文献
156.
针对多平台协同搜索的最优搜索问题,以多无人机区域搜索任务为背景,将搜索论和随机规划引入到编队协同搜索中,建立了环境模型、无人机模型、传感器模型;为了解决目标丢失后的“应召”搜索问题,建立了目标的随机漫游模型;通过对搜索力最优分配问题的分析,认为其实质为一类线性规划问题,提出了一种基于递归原理的解算方法;最后,通过仿真计算,证明了该随机漫游模型的合理性,并验证了所提算法的有效性。 相似文献
157.
本文提出了一种求解无约束最优化问题的方法,称之为“恰当共轭方向法”。与通常的共轭方向法(如共轭梯度法)相比,这种方法可以节省大量的一维搜索工作量,并且还能提高收敛速率。 相似文献
158.
针对电子侦察卫星的使用约束,及不同任务的调度需求,建立了电子侦察卫星联合侦察的多目标混合整数规划模型.利用进化算法的全局搜索能力和变邻域搜索的局部优化能力,提出了一种多目标进化算法和变邻域搜索相结合两阶段混合调度算法MOEA VNS.针对问题多时间窗组合优化特点,设计了进化算子与邻域移动算子,在确保解多样性的同时使算法... 相似文献
159.
基于X射线脉冲星导航定位方法是一种全新的自主导航技术。该文给出了脉冲星绝对定位的基本原理,针对有关文章存在的疑问,提出了脉冲星导航绝对定位中整周模糊度改进算法,并对其进行了深入的分析和理论推导,通过仿真计算脉冲星整周模糊度和航天器的位置,得到了较理想的定位精度。这种新改进的整周模糊度算法为脉冲星绝对定位提供了新的思路。 相似文献
160.