首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   487篇
  免费   173篇
  国内免费   38篇
  2024年   3篇
  2023年   3篇
  2022年   6篇
  2021年   18篇
  2020年   11篇
  2019年   13篇
  2018年   6篇
  2017年   29篇
  2016年   33篇
  2015年   18篇
  2014年   34篇
  2013年   52篇
  2012年   30篇
  2011年   35篇
  2010年   29篇
  2009年   40篇
  2008年   44篇
  2007年   36篇
  2006年   31篇
  2005年   33篇
  2004年   27篇
  2003年   24篇
  2002年   23篇
  2001年   18篇
  2000年   12篇
  1999年   20篇
  1998年   16篇
  1997年   8篇
  1996年   5篇
  1995年   3篇
  1994年   5篇
  1993年   5篇
  1992年   3篇
  1991年   5篇
  1990年   18篇
  1989年   2篇
排序方式: 共有698条查询结果,搜索用时 15 毫秒
91.
In this paper we present an algorithm for solving a class of queueing network design problems. Specifically, we focus on determining both service and arrival rates in an open Jackson network of queueing stations. This class of problems has been widely studied and used in a variety of applications, but not well solved due to the difficulty of the resulting optimization problems. As an example, consider the classic application in computer network design which involves determining the minimum cost line capacities and flow assignments while satisfying a queueing performance measure such as an upper limit on transmission delay. Other application areas requiring the selection of both service and arrival rates in a network of queues include the design of communication, manufacturing, and health care systems. These applications yield optimization problems that are difficult to solve because typically they are nonconvex, which means they may have many locally optimal solutions that are not necessarily globally optimal. Therefore, to obtain a globally optimal solution, we develop an efficient branch and bound algorithm that takes advantage of the problem structure. Computational testing on randomly generated problems and actual problems from a health care organization indicate that the algorithm is able to solve realistic sized problems in reasonable computing time on a laptop computer. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 1–17, 2000  相似文献   
92.
The opportunistic maintenance of a k‐out‐of‐n:G system with imperfect preventive maintenance (PM) is studied in this paper, where partial failure is allowed. In many applications, the optimal maintenance actions for one component often depend on the states of the other components and system reliability requirements. Two new (τ, T) opportunistic maintenance models with the consideration of reliability requirements are proposed. In these two models, only minimal repairs are performed on failed components before time τ and the corrective maintenance (CM) of all failed components are combined with PM of all functioning but deteriorated components after τ; if the system survives to time T without perfect maintenance, it will be subject to PM at time T. Considering maintenance time, asymptotic system cost rate and availability are derived. The results obtained generalize and unify some previous research in this area. Application to aircraft engine maintenance is presented. © 2000 John Wiley & Sons;, Inc. Naval Research Logistics 47: 223–239, 2000  相似文献   
93.
In this paper we consider the discrete time/resource trade-off problem in project networks. Given a project network consisting of nodes (activities) and arcs (technological precedence relations), in which the duration of the activities is a discrete, nonincreasing function of the amount of a single renewable resource committed to it, the discrete time/resource trade-off problem minimizes the project makespan subject to precedence constraints and a single renewable resource constraint. For each activity, a work content is specified such that all execution modes (duration/resource requirement pairs) for performing the activity are allowed as long as the product of the duration and the resource requirement is at least as large as the specified work content. We present a tabu search procedure which is based on a decomposition of the problem into a mode assignment phase and a resource-constrained project scheduling phase with fixed mode assignments. Extensive computational experience, including a comparison with other local search methods, is reported. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 553–578, 1998  相似文献   
94.
介绍仿真机和仿真软件的发展,分析了银河仿真机系统性能,探讨了仿真机的未来发展特征。  相似文献   
95.
软件无线电技术近年来得到了较快发展,其主要是利用软件来实现无线通信系统中的各种功能。介绍了软件无线电的关键技术、评价标准和发展过程,并展望了软件无线电的发展前景。  相似文献   
96.
国外火炮定位雷达的现状和发展趋势   总被引:1,自引:0,他引:1  
主要描述了国外火炮定位雷达的研制现状,对美国研制的Firefinder系列雷达,俄罗斯研制的Zoopark-1雷达,英、法、德等国联合研制的COBRA雷达以及瑞典和挪威联合研制的AR THUR雷达等几种火炮定位雷达的特点、主要技术指标及市场销售情况做了简要的介绍,最后总结了国外火炮定位雷达的最新发展趋势。  相似文献   
97.
片上系统(SoC)技术是近年来随着微电子技术发展出现的新技术,现已被广泛应用.利用SoC可以将原来由许多芯片完成的复杂功能,集中到一块芯片中完成,以获得更高的系统性能.以某火控系统中的模拟量输入通道为例,阐述了通过SoC技术,用基于FPGA/CPLD的方法对火控系统硬件电路进行维修改造,从而探讨了解决装备维修问题的一种方法.并讨论了改造过程中单稳态触发器96L02的替代问题,以及FPGA/CPLD与外围电路的驱动能力问题.  相似文献   
98.
在115 V/400Hz逆变电源中,A/D转换器引起的量化误差对系统的影响是造成系统不稳定的主要因素之一.通过对逆变器反馈通道误差的分析,采用全波整流电路对115 V/400 Hz逆变电源中A/D采样电路进行了改进,减小反馈通道误差,使逆变器的稳态电压输出波形质量得到显著改善.  相似文献   
99.
GPS/INS复合制导技术   总被引:3,自引:0,他引:3  
近年来随着制导技术的发展,国外许多新型的武器装备都采用了GPS/INS复合制导技术。介绍了国外GPS/INS复合制导技术的发展和应用,重点分析了惯性导航系统和全球定位系统的优缺点,综述了GPS/INS复合制导的工作原理和关键技术。文中列举了美国GPS/INS系统的小型化,以及GPS/INS复合制导系统在SM-3导弹、洲际导弹等多种导弹制导过程中发挥的作用。由此可见,掌握国外复合制导体系的发展动态对我国GPS/INS复合制导技术的发展将起到重要的借鉴和启示作用。  相似文献   
100.
An area defense consists of several groups that act independently, i.e., do not communicate with each other. Each group has a fixed number of defenders and a controller that allocates these defenders optimally against the individual attackers comprising an attack. We analyze the effectiveness of this partially coordinated defense against a simultaneous attack of known size in which all attackers are considered to be equally lethal. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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