首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   284篇
  免费   11篇
  国内免费   3篇
  298篇
  2025年   3篇
  2023年   19篇
  2022年   6篇
  2021年   4篇
  2020年   8篇
  2019年   6篇
  2018年   5篇
  2017年   18篇
  2016年   19篇
  2015年   14篇
  2014年   24篇
  2013年   17篇
  2012年   23篇
  2011年   17篇
  2010年   11篇
  2009年   18篇
  2008年   13篇
  2007年   17篇
  2006年   13篇
  2005年   7篇
  2004年   6篇
  2003年   5篇
  2002年   6篇
  2001年   5篇
  2000年   3篇
  1999年   1篇
  1998年   2篇
  1997年   1篇
  1995年   2篇
  1994年   1篇
  1993年   1篇
  1991年   1篇
  1989年   2篇
排序方式: 共有298条查询结果,搜索用时 0 毫秒
151.
对多层弹道导弹防御体系火力分配问题进行了研究。首先对多层弹道导弹防御体系火力分配问题进行了描述,在此基础上建立了基于最大化资源剩余价值目标函数的多层弹道导弹防御体系火力分配模型,分析了求解该模型的难点,提出了基于文化基因的多层弹道导弹防御体系火力分配问题文化基因求解算法,最后应用实例验证了模型的有效性,并对算法进行了对比分析。试验结果证明,合理制定多层弹道导弹防御体系火力分配方案,对于提升防御效能具有重要意义。  相似文献   
152.
    
Multi‐issue allocation situations study problems where an estate must be divided among a group of agents. The claim of each agent is a vector specifying the amount claimed by each agent on each issue. We present a two‐stage rule. First, we divide the estate among the issues following the constrained equal awards rule. Second, the amount assigned to each issue is divided among the agents in proportion to their demands on this issue. We apply the rule to two real‐world problems: the distribution of natural resources between countries and the distribution of budget for education and research between universities.  相似文献   
153.
    
A simultaneous non‐zero‐sum game is modeled to extend the classical network interdiction problem. In this model, an interdictor (e.g., an enforcement agent) decides how much of an inspection resource to spend along each arc in the network to capture a smuggler. The smuggler (randomly) selects a commodity to smuggle—a source and destination pair of nodes, and also a corresponding path for traveling between the given pair of nodes. This model is motivated by a terrorist organization that can mobilize its human, financial, or weapon resources to carry out an attack at one of several potential target destinations. The probability of evading each of the network arcs nonlinearly decreases in the amount of resource that the interdictor spends on its inspection. We show that under reasonable assumptions with respect to the evasion probability functions, (approximate) Nash equilibria of this game can be determined in polynomial time; depending on whether the evasion functions are exponential or general logarithmically‐convex functions, exact Nash equilibria or approximate Nash equilibria, respectively, are computed. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 139–153, 2017  相似文献   
154.
    
This article investigates the method of allocating arriving vessels to the terminals in transshipment hubs. The terminal allocation decision faced by a shipping alliance has the influence on the scheduled arrival time of vessels and further affects the bunker consumption cost for the vessels. A model is formulated to minimize the bunker consumption cost as well as the transportation cost of inter‐terminal transshipment flows/movements. The capacity limitation of the port resources such as quay cranes (QCs) and berths is taken into account. Besides the terminal allocation, the QC assignment decision is also incorporated in the proposed model. A local branching based method and a particle swarm optimization based method are developed to solve the model in large‐scale problem instances. Numerical experiments are also conducted to validate the effectiveness of the proposed model, which can save around 14% of the cost when compared with the “First Come First Served” decision rule. Moreover, the proposed solution methods not only solve the proposed model within a reasonable computation time, but also obtain near‐optimal results with about 0.1~0.7% relative gap. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 529–548, 2016  相似文献   
155.
    
This paper considers the rescheduling of surface‐to‐air missiles (SAMs) for a naval task group (TG), where a set of SAMs have already been scheduled to intercept a set of anti‐ship missiles (ASMs). In missile defense, the initial engagement schedule is developed according to the initial state of the defensive and attacking units. However, unforeseen events may arise during the engagement, creating a dynamic environment to be handled, and making the initial schedule infeasible or inefficient. In this study, the initial engagement schedule of a TG is assumed to be disrupted by the occurrence of a destroyed ASM, the breakdown of a SAM system, or an incoming new target ASM. To produce an updated schedule, a new biobjective mathematical model is formulated that maximizes the no‐leaker probability value for the TG and minimizes the total deviation from the initial schedule. With the problem shown to be NP‐hard, some special cases are presented that can be solved in polynomial time. We solve small size problems by the augmented ? ‐ constraint method and propose heuristic procedures to generate a set of nondominated solutions for larger problems. The results are presented for different size problems and the total effectiveness of the model is evaluated.  相似文献   
156.
描述了导弹武器系统保障性参数及其指标的涵义,探讨了确定纳入导弹武器系统研制任务书中的保障性指标应注意的几个问题.  相似文献   
157.
针对以网络为中心的作战计划的特点,提出基于层次任务网络的军事作战计划建模方法.在对层次任务网络形式化描述的基础上,介绍层次任务网络计划求解算法.基于军事作战计划的抽象模型,提出军事和战计划中军事规则、作战使命、作战能力和作战行动过程等要素与层次任务网络的映射关系,并针对登岛战役案例对基于层次任务网络的军事计划建模和求解过程进行说明.  相似文献   
158.
武警职权的配置是武警部队依法行使权力、完成任务的基础,武警职权的行使又是实现武警职能的途径。从宏观上确定武警职权的配置与行使的基本原则,是保障武警部队正确行使权力、合法用权的前提。通过对武警职权的属性、配置原则、行使原则三个问题的探讨,从理论研究的角度对相关问题一一提出了相应的观点。  相似文献   
159.
多操纵面战斗机飞行控制系统设计   总被引:1,自引:0,他引:1  
现代多操纵面战斗机飞行控制系统多采用非线性控制方法进行设计,其中逆系统方法具有物理概念清晰、参数对应明确、无不确定性算法、容易结合传统经验等优点,易于工程实现.将该方法应用于多操纵面战斗机的基本控制律设计,使用多层简化设计,改进了多操纵面的控制分配策略,并针对某型多操纵面战斗机六自由度模型进行数字仿真,效果良好.  相似文献   
160.
提出一种定量评价C4ISR(Command Control Communication Computer Intelligence Surveillance and Reconnaissance)系统任务实时性方法--时序着色模糊时间Petri网(TCFTPN)方法.用时序逻辑公式来限制着色Petri网的变迁引发行为,用模糊时间来表示各工作过程的时延特性和降级工作问题.通过估计在规定的时间内标识从任务开始状态到达任务完成状态的概率来确定C4ISR系统的任务实时性.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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