首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   742篇
  免费   44篇
  国内免费   9篇
  795篇
  2025年   12篇
  2024年   16篇
  2023年   33篇
  2022年   21篇
  2021年   15篇
  2020年   21篇
  2019年   21篇
  2018年   12篇
  2017年   45篇
  2016年   55篇
  2015年   28篇
  2014年   57篇
  2013年   31篇
  2012年   53篇
  2011年   45篇
  2010年   30篇
  2009年   46篇
  2008年   28篇
  2007年   28篇
  2006年   52篇
  2005年   31篇
  2004年   20篇
  2003年   14篇
  2002年   14篇
  2001年   9篇
  2000年   6篇
  1999年   10篇
  1998年   7篇
  1997年   1篇
  1996年   4篇
  1995年   6篇
  1994年   4篇
  1993年   4篇
  1992年   3篇
  1991年   4篇
  1990年   4篇
  1989年   5篇
排序方式: 共有795条查询结果,搜索用时 0 毫秒
331.
指挥引导是作战指挥的重要组成部分,指挥引导效率的高低直接关系到作战效能的发挥。现代战争条件下,为完成某一作战任务,所需出动的兵力较多,空中态势复杂,如何合理分配指挥引导机构的指挥引导任务,选择有利的引导方式,对完成任务影响很大。因此,结合指挥引导的特点和要求,对指挥引导能力进行分析,设定相关参数的具体示例,运用动态规划理论、关联分析方法,通过建模和解算,确定各项指标的关联度,尝试解决影响指挥引导能力分配诸多复杂因素的关联问题,对指挥引导方式进行优化。  相似文献   
332.
针对信息化条件下指挥体系结构的特点,运用复杂网络理论,提出了指挥体系的优化算法,将组织有序度最大化作为目标函数,以边的关键度作为调节变量,构建了优化模型和算法,并对指挥网络进行了实例分析,对比优化前后指挥体系在平均路径、聚类系数、度分布以及网络的抗毁性等指标上变化,最后得到最优化的指挥网络。该算法对指挥流程的优化具有一定的参考价值和指导意义。  相似文献   
333.
在编队目标信息态势实现共享的条件下,可实现网络化防空反导作战的常规作战样式,对目标进行集中统一分配,如何形成最优化分配方案,是防空反导作战指挥决策中的关键。在给定目标来袭态势下,根据编队目标分配原则,可形成多种目标分配初始方案,先后采用了基于负载平衡和基于任务有利度方法,对目标分配方案进行优化。优化所得方案有利度的均方根最大,目标来袭密度的均方根最小,可作为下一步编队组织使用火力通道的依据。  相似文献   
334.
从舰艇编队的实际作战需求出发,将作战使命分解为多个作战任务,然后分配给相关平台。首先在每个平台只能承担一项任务的前提下,构建了编队作战任务分配的基本模型。在此基础上研究了两平台协同执行任务时效能互补、单平台在同时执行多项任务时武器装备相互干扰等情况,进一步构建了考虑平台间协同效益和平台执行多任务的作战任务分配模型。应用改进的遗传算法给出了编队作战任务分配方案优化选择的具体方法步骤,最后针对一个典型案例进行了仿真计算与分析,验证了三种模型的合理性。  相似文献   
335.
    
Applications for content distribution over networks, such as Video‐on‐Demand (VOD), are expected to grow significantly over time. Effective bandwidth allocation schemes that can be repeatedly executed must be deployed since new programs are often installed at various servers while other are deleted. We present a model for bandwidth allocation in a content distribution network that consists of multiple trees, where the root of each tree has a server that broadcasts multiple programs throughout the tree. Each network link has limited capacity and may be used by one or more of these trees. The model is formulated as an equitable resource allocation problem with a lexicographic maximin objective function that attempts to provide equitable service performance for all requested programs at the various nodes. The constraints include link capacity constraints and tree‐like ordering constraints imposed on each of the programs. We present an algorithm that provides an equitable solution in polynomial time for certain performance functions. At each iteration, the algorithm solves single‐link maximin optimization problems while relaxing the ordering constraints. The algorithm selects a bottleneck link, fixes various variables at their lexicographic optimal solution while enforcing the ordering constraints, and proceeds with the next iteration. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010  相似文献   
336.
    
We study a periodic-review multi-supplier series inventory system in which the demand is restricted to partial sum uncertainty sets. We present and solve a robust rolling-horizon model for the system. We propose an induction framework to characterize the closed-form robust optimal solution of the problem. We show that the robust optimal policy combines the echelon base-stock policy and a gap-of-echelon-base-stock policy for the uppermost stage and a modified echelon base-stock policy for the other downstream stages. The policy structure is easy for the manager to understand and implement in practice. The policy parameters are directly determined by a sequence of nominal partial-sum demands, and its computation is very effective. In addition, the policy does not rely on complete information about the demand distribution; its solution can be more robust than that of stochastic optimization methods, especially when demand is highly uncertain, and forecasting is difficult. Based on the structure of the robust optimal policy, we design two heuristic policies for the system and evaluate the policies' performance through an extensive numerical study using both synthetic and real data.  相似文献   
337.
    
We study the assortment optimization problem with position effects under the nested logit model, whose goal is to find the revenue-maximizing subset of products as well as their corresponding display positions. In this joint assortment-position optimization problem, the choices of products are affected by not only their qualities and prices but also the positions where they are displayed. Despite determining the assortment and their corresponding display positions sequentially, we propose to solve this problem in an integrated way to obtain the optimal solution. We formulate this problem as a nonlinear binary integer programming model and develop a dynamic programming based solution approach to obtain the optimal assortment-position assignments. We carry out extensive numerical experiments to evaluate the benefit of our integrated approach. The most important insight we discover is that it is not necessarily better to put the most attractive products in the best position. Moreover, we show that compared to the sequential approaches, our approach can improve revenue by 10.38% on average, which suggests that firms should take into consideration position effects when making assortment decisions. Finally, we discuss results related to two extensions of this problem, that is, the special case when positions are preassigned to nests, and the joint assortment-position-price optimization problem.  相似文献   
338.
We review the operations research/management science literature on data-driven methods in retail operations. This line of work has grown rapidly in recent years, thanks to the availability of high-quality data, improvements in computing hardware, and parallel developments in machine learning methodologies. We survey state-of-the-art studies in three core aspects of retail operations—assortment optimization, order fulfillment, and inventory management. We then conclude the paper by pointing out some interesting future research possibilities for our community.  相似文献   
339.
    
《防务技术》2020,16(2):325-333
In this study, a theoretical nonlinear dynamic model was established for a saddle ring based on a dynamic force analysis of the launching process and the structure according to contact-impact theory. The ADAMS software was used to build a parameterized dynamic model of the saddle ring. A parameter identification method for the ring was proposed based on the particle swarm optimization algorithm. A loading test was designed and performed several times at different elevation angles. The response histories of the saddle ring with different loads were then obtained. The parameters of the saddle ring dynamic model were identified from statistics generated at a 50° elevation angle to verify the feasibility and accuracy of the proposed method. The actual loading history of the ring at a 70° elevation angle was taken as the model input. The response histories of the ring under these working conditions were obtained through a simulation. The simulation results agreed with the actual response. Thus, the effectiveness and applicability of the proposed dynamic model were verified, and it provides an effective method for modeling saddle rings.  相似文献   
340.
    
《防务技术》2020,16(3):662-667
In this paper, an improved discharging circuit was proposed to quicken the decay of the current in the drive coil in a reluctance accelerator when the armature reaches the center of the coil. The aim of this is to prevent the suck-back effect caused by the residual current in drive coil. The method is adding a reverse charging branch with a small capacitor in the traditional pulsed discharging circuit. The results under the traditional circuit and the improved circuit were compared in a simulation. The experiment then verified the simulations and they had good agreement. Simulation and experiment both demonstrated the improved circuit can effectively prevent the suck-back effect and increase the efficiency. At the voltage of 800 V, an efficiency increase of 36.34% was obtained.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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