首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   395篇
  免费   139篇
  国内免费   32篇
  2024年   2篇
  2023年   5篇
  2022年   2篇
  2021年   8篇
  2020年   7篇
  2019年   12篇
  2018年   6篇
  2017年   21篇
  2016年   23篇
  2015年   16篇
  2014年   27篇
  2013年   33篇
  2012年   29篇
  2011年   44篇
  2010年   28篇
  2009年   36篇
  2008年   17篇
  2007年   36篇
  2006年   27篇
  2005年   24篇
  2004年   30篇
  2003年   12篇
  2002年   17篇
  2001年   17篇
  2000年   18篇
  1999年   20篇
  1998年   11篇
  1997年   9篇
  1996年   1篇
  1995年   3篇
  1994年   5篇
  1993年   6篇
  1992年   5篇
  1991年   4篇
  1990年   3篇
  1989年   1篇
  1988年   1篇
排序方式: 共有566条查询结果,搜索用时 31 毫秒
561.
基于半实物仿真的HLA/RTI关键技术研究   总被引:1,自引:0,他引:1  
分析了基于HLA/RTI的半实物仿真中实践管理、数据收集能力、RTI通用性以及网络传输安全等问题,研究了新的时间管理策略,提出了合理设置lookahead的算法,设计了数据收集的层次框架,并制定了研发RTI的通用原则和安全有效的网络传输方案,为现代半实物系统仿真提供了理论借鉴。  相似文献   
562.
通过测量弹丸炮口速度和引信解除保险时间的方法得出电子时间引信远解距离。在介绍某型电子时间引信实现远距离解除保险的方法和机构工作过程的同时,对远解距离进行理论分析,并对试验引信改装的实现方法作了详细说明。在此基础上,进行了电子时间引信解除保险距离测试试验并对试验结果作了分析。  相似文献   
563.
We consider a dynamic lot‐sizing model with production time windows where each of n demands has earliest and latest production due dates and it must be satisfied during the given time window. For the case of nonspeculative cost structure, an O(nlogn) time procedure is developed and it is shown to run in O(n) when demands come in the order of latest production due dates. When the cost structure is somewhat general fixed plus linear that allows speculative motive, an optimal procedure with O(T4) is proposed where T is the length of a planning horizon. Finally, for the most general concave production cost structure, an optimal procedure with O(T5) is designed. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
564.
We formulate exact expressions for the expected values of selected estimators of the variance parameter (that is, the sum of covariances at all lags) of a steady‐state simulation output process. Given in terms of the autocovariance function of the process, these expressions are derived for variance estimators based on the simulation analysis methods of nonoverlapping batch means, overlapping batch means, and standardized time series. Comparing estimator performance in a first‐order autoregressive process and the M/M/1 queue‐waiting‐time process, we find that certain standardized time series estimators outperform their competitors as the sample size becomes large. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
565.
We investigate the relative effectiveness of top‐down versus bottom‐up strategies for forecasting the demand of an item that belongs to a product family. The demand for each item in the family is assumed to follow a first‐order univariate autoregressive process. Under the top‐down strategy, the aggregate demand is forecasted by using the historical data of the family demand. The demand forecast for the items is then derived by proportional allocation of the aggregate forecast. Under the bottom‐up strategy, the demand forecast for each item is directly obtained by using the historical demand data of the particular item. In both strategies, the forecasting technique used is exponential smoothing. We analytically evaluate the condition under which one forecasting strategy is preferred over the other when the lag‐1 autocorrelation of the demand time series for all the items is identical. We show that when the lag‐1 autocorrelation is smaller than or equal to 1/3, the maximum difference in the performance of the two forecasting strategies is only 1%. However, if the lag‐1 autocorrelation of the demand for at least one of the items is greater than 1/3, then the bottom‐up strategy consistently outperforms the top‐down strategy, irrespective of the items' proportion in the family and the coefficient of correlation between the item demands. A simulation study reveals that the analytical findings hold even when the lag‐1 autocorrelation of the demand processes is not identical. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.  相似文献   
566.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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