首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   158篇
  免费   45篇
  国内免费   24篇
  2023年   1篇
  2022年   2篇
  2020年   1篇
  2019年   5篇
  2018年   2篇
  2017年   10篇
  2016年   21篇
  2015年   6篇
  2014年   10篇
  2013年   9篇
  2012年   25篇
  2011年   13篇
  2010年   9篇
  2009年   15篇
  2008年   10篇
  2007年   14篇
  2006年   19篇
  2005年   7篇
  2004年   8篇
  2003年   4篇
  2002年   3篇
  2001年   6篇
  2000年   4篇
  1999年   2篇
  1998年   1篇
  1997年   5篇
  1996年   6篇
  1994年   1篇
  1993年   1篇
  1992年   1篇
  1991年   2篇
  1990年   3篇
  1989年   1篇
排序方式: 共有227条查询结果,搜索用时 0 毫秒
121.
鉴于网络中心战中指挥所的重要性,根据实际作战原则,通过对传统武器目标分配(WTA)模型的分析,建立了考虑指控节点受攻击的武器目标分配(Weapon-Target Assignment with Vulnerable Command and Control Nodes,WTAVC2N)模型,并利用随机PSO算法对该模型进行仿真验证。仿真结果表明了利用随机PSO算法解决考虑指挥所被摧毁的武器目标分配问题的有效性及合理性。  相似文献   
122.
对带有状态滞后的连续广义系统的严格正实性进行了分析,得出了这类系统渐近稳定且严格正实的充分条件,该充分条件与滞后无关。进一步地,对这类系统带有不确定性和控制量的情况进行了研究。提出了一种基于线性状态反馈控制的鲁棒正实控制器设计方法,使得控制器设计可以通过求解线性矩阵不等式方便地加以解决,且保证了闭环系统的严格正实性。最后,通过实例分析说明所提出的鲁棒正实控制器设计方法是可行的、有效的。  相似文献   
123.
基于二人有限零和对策的防空兵火力分配方法   总被引:1,自引:0,他引:1  
为了优化防空作战过程中火力分配问题,使射击达到最佳效果,运用对策论、线性规划等理论方法,采用对策矩阵建立了防空火力分配的线性规划模型,并通过计算示例和计算机仿真初步预测了敌方的空袭兵器使用情况和我方相应的兵力分配对策。该模型建立的防空火力分配方法较好地满足了要地防空装备的战术应用问题,对提高作战效能具有一定的参考价值。  相似文献   
124.
应用单亲遗传算法进行大规模UCAVs任务分配   总被引:1,自引:1,他引:0  
在应用GA求解大规模无人作战飞机(UCAVs)任务分配这个典型组合优化问题时,需要使用描述问题直观的序号编码方式,但由于传统的交叉、变异算子操作复杂,因而进化效率不高.针对上述的不足,提出了一种单亲遗传算法,采用序号编码,使用基因换位等遗传算子,简化了遗传操作.通过对单亲遗传算法、传统遗传算法求解该问题所得的结果作了详细的比较,证明了单亲遗传算法在寻优效率上的优越性.  相似文献   
125.
从Kelvin横波航迹的形成原理出发,详细推导了Kelvin横波波峰模型,提出一种基于广义Hough变换的遥感图像船舶横波自动检测方法,取得了较好的检测效果,并依据检测结果对船舶速度进行了估计。所述方法对海上船舶运输和港口管理等具有重要意义。  相似文献   
126.
超视距多目标攻击排序及火力分配建模与解算   总被引:17,自引:3,他引:14  
针对未来超视距空战条件下的多目标攻击排序和制导武器火力分配问题,提出了一种用以评估超视距空战作战效能的综合优势指数法;当目标数多于攻击机数时,通过构造综合优势矩阵,将非平衡指派问题转化为平衡指派问题,并建立了多目标攻击排序的0-1规划模型,该模型可解决对多个目标同时攻击的排序问题;以2对8攻击排序为例,利用求解线性规划软件Lindo6.0进行解算。最后,建立了1对4攻击火力分配的非线性规划模型,并利用求解非线性规划软件Lingo5.0进行解算。计算结果验证了建模的合理性和运用Lindo、Lingo软件求解较大规模目标攻击排序和火力分配问题的实时性。  相似文献   
127.
The well‐known generalized assignment problem (GAP) involves the identification of a minimum‐cost assignment of tasks to agents when each agent is constrained by a resource in limited supply. The multi‐resource generalized assignment problem (MRGAP) is the generalization of the GAP in which there are a number of different potentially constraining resources associated with each agent. This paper explores heuristic procedures for the MRGAP. We first define a three‐phase heuristic which seeks to construct a feasible solution to MRGAP and then systematically attempts to improve the solution. We then propose a modification of the heuristic for the MRGAP defined previously by Gavish and Pirkul. The third procedure is a hybrid heuristic that combines the first two heuristics, thus capturing their relative strengths. We discuss extensive computational experience with the heuristics. The hybrid procedure is seen to be extremely effective in solving MRGAPs, generating feasible solutions to more than 99% of the test problems and consistently producing near‐optimal solutions. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 468–483, 2001  相似文献   
128.
Consider a binary, monotone system of n components. The assessment of the parameter vector, θ, of the joint distribution of the lifetimes of the components and hence of the reliability of the system is often difficult due to scarcity of data. It is therefore important to make use of all information in an efficient way. For instance, prior knowledge is often of importance and can indeed conveniently be incorporated by the Bayesian approach. It may also be important to continuously extract information from a system currently in operation. This may be useful both for decisions concerning the system in operation as well as for decisions improving the components or changing the design of similar new systems. As in Meilijson [12], life‐monitoring of some components and conditional life‐monitoring of some others is considered. In addition to data arising from this monitoring scheme, so‐called autopsy data are observed, if not censored. The probabilistic structure underlying this kind of data is described, and basic likelihood formulae are arrived at. A thorough discussion of an important aspect of this probabilistic structure, the inspection strategy, is given. Based on a version of this strategy a procedure for preventive system maintenance is developed and a detailed application to a network system presented. All the way a Bayesian approach to estimation of θ is applied. For the special case where components are conditionally independent given θ with exponentially distributed lifetimes it is shown that the weighted sum of products of generalized gamma distributions, as introduced in Gåsemyr and Natvig [7], is the conjugate prior for θ. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 551–577, 2001.  相似文献   
129.
We present a stochastic optimization model for planning capacity expansion under capacity deterioration and demand uncertainty. The paper focuses on the electric sector, although the methodology can be used in other applications. The goals of the model are deciding which energy types must be installed, and when. Another goal is providing an initial generation plan for short periods of the planning horizon that might be adequately modified in real time assuming penalties in the operation cost. Uncertainty is modeled under the assumption that the demand is a random vector. The cost of the risk associated with decisions that may need some tuning in the future is included in the objective function. The proposed scheme to solve the nonlinear stochastic optimization model is Generalized Benders' decomposition. We also exploit the Benders' subproblem structure to solve it efficiently. Computational results for moderate‐size problems are presented along with comparison to a general‐purpose nonlinear optimization package. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:662–683, 2001  相似文献   
130.
大规模作战具有高动态、非完全信息和不确定性,在分析归纳目前解决动态武器目标分配问题的一系列方法的基础上,尝试构建基于双方动态博弈的攻防对抗综合数学模型,并利用纳什均衡和帕累托最优算法进行分阶段求解。结果表明,该数学模型和博弈论方法结合能够有效解决武器目标动态分配问题。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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