首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   566篇
  免费   7篇
  2021年   5篇
  2020年   5篇
  2019年   9篇
  2017年   19篇
  2016年   12篇
  2015年   9篇
  2014年   13篇
  2013年   105篇
  2012年   23篇
  2011年   26篇
  2010年   23篇
  2009年   15篇
  2008年   27篇
  2007年   14篇
  2006年   15篇
  2005年   5篇
  2002年   4篇
  2001年   4篇
  2000年   3篇
  1999年   3篇
  1998年   9篇
  1997年   7篇
  1996年   3篇
  1995年   8篇
  1994年   5篇
  1993年   12篇
  1992年   9篇
  1991年   6篇
  1990年   3篇
  1989年   12篇
  1988年   6篇
  1987年   12篇
  1986年   12篇
  1985年   9篇
  1983年   5篇
  1982年   6篇
  1981年   8篇
  1980年   9篇
  1979年   11篇
  1978年   5篇
  1977年   6篇
  1976年   8篇
  1975年   7篇
  1972年   12篇
  1971年   3篇
  1970年   4篇
  1969年   9篇
  1968年   8篇
  1967年   4篇
  1966年   3篇
排序方式: 共有573条查询结果,搜索用时 15 毫秒
31.
RBF网络用于战车火控系统弹道解算的方法   总被引:1,自引:0,他引:1  
弹道解算问题对战车火控系统的性能有着直接的影响.传统的弹道解算方法在精度和实时性方面都存在一定的局限性.为了提高解算精度、战车首发命中率和解算的实时性,基于RBF网络的函数逼近及预测能力,将RBF网络用于弹道解算,对传统算法进行优化,得到了新的弹道解算方法.最后对所提方法进行了仿真,发现新方法在解算精度没有降低的条件下,大大提高了弹道解算的实时性.  相似文献   
32.
33.
Whenever n demand points are located on a hemisphere, spherical location problems can be solved easily using geometrical methods or mathematical programming. A method based on a linear programming formulation with four constraints is presented to determine whether n demand points are on a hemisphere. The formulation is derived from a modified minimax spherical location problem whose Karush-Kuhn-Tucker conditions are the constraints of the linear program. © 1993 John Wiley & Sons, Inc.  相似文献   
34.
35.
36.
This article explores ordering policies for inventory systems with three supply modes. This model is particularly interesting because the optimal ordering decision needs to balance the inventory and purchase costs, as well as the costs for earlier and later periods. The latter cost trade-off is present only in inventory systems with three or more supply modes. Therefore, the result not only offers guidelines for the operation of the concerned inventory systems, but also provides valuable insight into the complex cost trade-offs when more supply modes are available. We assume that the difference between the lead times is one period, and the inventory holding and shortage costs are linear. We analyze two cases and obtain the structure of the optimal ordering policy. Moreover, in the first case, explicit formulas are derived to calculate the optimal order-up-to levels. In the second case, although the optimal order-up-to levels are functions of the initial inventory state and are not obtained in closed form, their properties are discussed. We also develop heuristic ordering policies based on the news-vendor model. Our numerical experiments suggest that the heuristic policies perform reasonably well. © 1996 John Wiley & Sons, Inc.  相似文献   
37.
Many Markov chain models have very large state spaces, making the computation of stationary probabilities very difficult. Often the structure and numerical properties of the Markov chain allows for more efficient computation through state aggregation and disaggregation. In this article we develop an efficient exact single pass aggregation/disaggregation algorithm which exploits structural properties of large finite irreducible mandatory set decomposable Markov chains. The required property of being of mandatory set decomposable structure is a generalization of several other Markov chain structures for which exact aggregation/disaggregation algorithms exist. © 1995 John Wiley & Sons, Inc.  相似文献   
38.
We examine the problem of estimating the item fill rate in a periodic inventory system. We show that the traditional expressions for line item fill rate, found in many operations management textbooks, perform well for high fill rates (above 90%), but they consistently underestimate the true fill rate. The problem of underestimation becomes significant as the fill rate falls below 90% and is greatly amplified in cases with very low fill rates (below 50%). We review other more accurate expressions for fill rate, discussing their relative merits. We then develop an exact fill rate expression that is robust for both high and low fill rates. We compare the new expression to others found in the literature via an extensive set of simulation experiments using data that reflect actual inventory systems found at Hewlett-Packard. We also examine the robustness of the expressions to violations in the underlying assumptions. Finally, we develop an alternative fill rate expression that is robust for cases of high demand variability where product returns are allowed. © 1995 John Wiley & Sons, Inc.  相似文献   
39.
Consider the problem of estimating the reliability of a series system of (possibly) repairable subsystems when test data and historical information are available at the component, subsystem, and system levels. Such a problem is well suited to a Bayesian approach. Martz, Waller, and Fickas [Technometrics, 30 , 143–154 (1988)] presented a Bayesian procedure that accommodates pass/fail (binomial) data at any level. However, other types of test data are often available, including (a) lifetimes of nonrepayable components, and (b) repair histories for repairable subsystems. In this article we describe a new Bayesian procedure that accommodates pass/fail, life, and repair data at any level. We assume a Weibull model for the life data, a censored Weibull model for the pass/fail data, and a power-law process model for the repair data. Consequently, the test data at each level can be represented by a two-parameter likelihood function of a certain form, and historical information can be expressed using a conjugate family of prior distributions. We discuss computational issues, and use the procedure to analyze the reliability of a vehicle system. © 1994 John Wiley & Sons, Inc.  相似文献   
40.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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