首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   509篇
  免费   98篇
  国内免费   24篇
  2024年   1篇
  2023年   3篇
  2022年   3篇
  2021年   14篇
  2020年   13篇
  2019年   9篇
  2018年   6篇
  2017年   10篇
  2016年   16篇
  2015年   28篇
  2014年   23篇
  2013年   73篇
  2012年   24篇
  2011年   23篇
  2010年   43篇
  2009年   32篇
  2008年   44篇
  2007年   34篇
  2006年   30篇
  2005年   30篇
  2004年   24篇
  2003年   17篇
  2002年   25篇
  2001年   22篇
  2000年   13篇
  1999年   20篇
  1998年   6篇
  1997年   3篇
  1996年   1篇
  1995年   5篇
  1994年   5篇
  1993年   3篇
  1992年   4篇
  1991年   1篇
  1990年   4篇
  1989年   2篇
  1988年   1篇
  1987年   3篇
  1986年   2篇
  1985年   2篇
  1983年   1篇
  1982年   1篇
  1981年   1篇
  1979年   1篇
  1978年   3篇
  1973年   1篇
  1967年   1篇
排序方式: 共有631条查询结果,搜索用时 187 毫秒
521.
研究了坦克靶场射击模拟训练系统的总体技术,给出了系统的结构与功能,构建了靶场射击模拟训练系统硬件和系统软件,重点阐述了信号接口模块、判命中子系统、靶场管理子系统、视景回放子系统和参数分析子系统的技术方案,并给出了具体的实现过程。  相似文献   
522.
针对传统AHP在实际应用中存在的问题,采用三标度法进行炮阵地的多目标优选决策,避免了采用九标度方法构建判断矩阵时权重选择的模糊性,从而减少了决策过程中决策者的主观臆断性。实例证明,三标度法具有简单明了、使用方便等优点,在应用于多目标决策等复杂系统时是适合可靠的。  相似文献   
523.
提出了一种应用A*启发式搜索算法对虚拟战场中坦克CGF(Computer Generated Forces)实体进行全局路径规划的方法,同时对A*算法进行了改进,利用二叉堆的结构组织OPEN表,大大加速了A*算法的搜索效率。所提方法可以处理较大规模的战场地形,具有较高的效率。  相似文献   
524.
We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016  相似文献   
525.
We consider the problem of determining the capacity to assign to each arc in a given network, subject to uncertainty in the supply and/or demand of each node. This design problem underlies many real‐world applications, such as the design of power transmission and telecommunications networks. We first consider the case where a set of supply/demand scenarios are provided, and we must determine the minimum‐cost set of arc capacities such that a feasible flow exists for each scenario. We briefly review existing theoretical approaches to solving this problem and explore implementation strategies to reduce run times. With this as a foundation, our primary focus is on a chance‐constrained version of the problem in which α% of the scenarios must be feasible under the chosen capacity, where α is a user‐defined parameter and the specific scenarios to be satisfied are not predetermined. We describe an algorithm which utilizes a separation routine for identifying violated cut‐sets which can solve the problem to optimality, and we present computational results. We also present a novel greedy algorithm, our primary contribution, which can be used to solve for a high quality heuristic solution. We present computational analysis to evaluate the performance of our proposed approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 236–246, 2016  相似文献   
526.
We present a validation of a centralized feedback control law for robotic or partially robotic water craft whose task is to defend a harbor from an intruding fleet of water craft. Our work was motivated by the need to provide harbor defenses against hostile, possibly suicidal intruders, preferably using unmanned craft to limit potential casualties. Our feedback control law is a sample‐data receding horizon control law, which requires the solution of a complex max‐min problem at the start of each sample time. In developing this control law, we had to deal with three challenges. The first was to develop a max‐min problem that captures realistically the nature of the defense‐intrusion game. The second was to ensure the solution of this max‐min problem can be accomplished in a small fraction of the sample time that would be needed to control a possibly fast moving craft. The third, to which this article is dedicated, was to validate the effectiveness of our control law first through computer simulations pitting a computer against a computer or a computer against a human, then through the use of model hovercraft in a laboratory, and finally on the Chesapeake Bay, using Yard Patrol boats. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 247–259, 2016  相似文献   
527.
ABSTRACT

China’s defense science, technology, and industrial system has been undergoing a far-reaching transformation over the past two decades and the single biggest factor behind this turnaround is the role of external technology and knowledge transfers and the defense industry’s improving ability to absorb these inputs and convert into localized output. China is pursuing an intensive campaign to obtain defense and dual-use civil–military foreign technology transfers using a wide variety of means, which is explored in this article.  相似文献   
528.
The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016  相似文献   
529.
The paper analyzes the effects of military spending on economic growth in a small open stochastic endogenous growth model involving the supply-side and demand-side effects produced by military spending. We show that a rise in the military spending affects economic growth through four channels, including the crowding-out effect, the spin-off effect, the resource mobilization effect, and the portfolio effect. The net effect which depends on these four channels is ambiguous. Hence, we demonstrate that there exists an optimal defense burden that maximizes the economic growth rate.  相似文献   
530.
In this article we have generalized previous models on multiechelon recoverable inventory systems to cover the cases of batch ordering and shipment policy, and when items can either be repaired or condemned. The batch ordering and shipment policy is appropriate when the setup cost for shipment and order and/or the demand rates of the items are relatively high. The operating characteristics of such a system have been studied. Specifically, the probability distribution of backorder levels at the bases are analyzed for different repair-time distributions. An approximation scheme is proposed for this distribution, and is evaluated using extensive simulation results. The results indicate that the scheme is very effective in providing near-optimal stocking levels in such a system.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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