首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   482篇
  免费   85篇
  国内免费   62篇
  2023年   1篇
  2022年   2篇
  2021年   18篇
  2020年   15篇
  2019年   13篇
  2018年   11篇
  2017年   32篇
  2016年   44篇
  2015年   15篇
  2014年   61篇
  2013年   26篇
  2012年   43篇
  2011年   38篇
  2010年   13篇
  2009年   44篇
  2008年   26篇
  2007年   29篇
  2006年   35篇
  2005年   28篇
  2004年   26篇
  2003年   13篇
  2002年   14篇
  2001年   18篇
  2000年   14篇
  1999年   10篇
  1998年   14篇
  1997年   7篇
  1996年   2篇
  1995年   3篇
  1994年   5篇
  1993年   6篇
  1992年   1篇
  1990年   1篇
  1989年   1篇
排序方式: 共有629条查询结果,搜索用时 62 毫秒
41.
研究一类具有两种随机扰动的SISV传染病模型.对于第一种随机SISV模型,证明对任给的非负初值,该随机模型一定存在唯一的全局正解,并讨论该随机模型的解围绕确定性模型的无病平衡点的渐近行为;对于第二种随机SISV模型,通过构造适当的Lyapunov泛函证明该随机模型的解是随机渐近稳定的.  相似文献   
42.
为了提高智能协同空战攻击决策算法性能,将变异策略引入到DPSO(Discrete Particle Swarm Optimization)协同空战攻击决策算法中,提出了一种新的基于变异离散粒子群(Mutation Discrete Particle Swarm Optimization,MDPSO)的协同空战攻击决策算法。基于典型空战想定背景,仿真验证了算法的有效性。采用对比实验方法,基于准确性、可靠性和快速性等关键性能指标,分析比较了基于MDPSO协同空战攻击决策算法与多种智能决策算法,验证了基于MDPSO的协同空战攻击决策算法有着较好的综合性能。  相似文献   
43.
基于二元模糊比较法的单步空战机动决策研究   总被引:1,自引:0,他引:1  
空战机动决策过程中,往往需要根据敌我态势,给定多个任务指标,最终得出多指标条件下我方机动的最优控制解。通过对双机空战态势的研究,建立机动模型。在给定敌方运动轨迹的情况下,设定机动评价指标。运用二元模糊比较法融合空战态势的各种输入信息,通过不同指标下的机动模糊比较矩阵,对我机单步机动决策进行研究,最终得出我机机动轨迹。仿真结果表明,算法符合实际,并且具有较好的稳定性。  相似文献   
44.
抢险救灾非战争军事行动包括道路抢修和物资运输等任务,而这两类任务在灾后应急资源调度中存在关联性的影响,且面临路网结构可变及需求随机模糊等挑战,对此,提出了一种非确定性应急资源调度网络双层规划模型,设计了基于蒙特卡洛方法与遗传算法耦合的智能启发式求解策略.通过对典型情境下应急资源调度案例进行分析建模和数值求解,说明了该模型和算法的合理性和有效性.  相似文献   
45.
现代条件下战场情况复杂,影响作战效能的因素众多且具有不确定性,为了获得对作战效能更为准确,可靠的评价,构建了一种新的基于多属性融合的坦克分队作战效能评估模型。结合已有的证据理论改进算法,给出了一种新的解决冲突证据的组合规则,并提出了一种新的组合策略,将其应用于评估模型中定性指标的融合;通过线性与非线性综合加权的方法求得评价的综合分值,得出了最终的评估结果。通过实例表明,该模型符合评估实际,对多属性模型的评估具有一定的借鉴意义。  相似文献   
46.
针对作战效能评估过程中评价指标值同时存在精确数、区间数和语言类模糊数的情况,引入区间数与灰决策原理,提出了一种基于区间数与灰决策的作战效能评估模型。结合案例分析,对模型合理性进行验证,结果表明,该模型能够真实地反映武器装备作战效能的综合评估值。  相似文献   
47.
We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010  相似文献   
48.
We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010  相似文献   
49.
雷达侦察主要通过无源侦察接收设备对空域中敌方雷达辐射源信号进行检测,若要实现对敌辐射源信号的截获,基本条件就是敌雷达信号能量能够达到雷达信号侦收设备的截获灵敏度。然而现代战场中,电磁环境复杂多变,敌雷达信号往往被干扰信号、噪声等掩盖,导致侦收设备漏警概率提高。针对以上问题,提出基于随机共振原理的雷达信号截获判断的方法,增大了截获信号的输出信噪比,解决了由于噪声过大掩盖的雷达信号的侦收问题。将该方法应用于雷达告警接收机的前端截获部分,大大降低了截获系统的漏警概率,保证了整个截获系统的稳定性。仿真实验验证了该方法的有效性。  相似文献   
50.
Considering a supply chain with a supplier subject to yield uncertainty selling to a retailer facing stochastic demand, we find that commonly studied classical coordination contracts fail to coordinate both the supplier's production and the retailer's procurement decisions and achieve efficient performance. First, we study the vendor managed inventory (VMI) partnership. We find that a consignment VMI partnership coupled with a production cost subsidy achieves perfect coordination and a win‐win outcome; it is simple to implement and arbitrarily allocates total channel profit. The production cost subsidy optimally chosen through Nash bargaining analysis depends on the bargaining power of the supplier and the retailer. Further, motivated by the practice that sometimes the retailer and the supplier can arrange a “late order,” we also analyze the behavior of an advance‐purchase discount (APD) contract. We find that an APD with a revenue sharing contract can efficiently coordinate the supply chain as well as achieve flexible profit allocation. Finally, we explore which coordination contract works better for the supplier vs. the retailer. It is interesting to observe that Nash bargaining solutions for the two coordination contracts are equivalent. We further provide recommendations on the applications of these contracts. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 305–319, 2016  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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