首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   867篇
  免费   21篇
  2021年   13篇
  2019年   28篇
  2018年   22篇
  2017年   20篇
  2016年   21篇
  2015年   19篇
  2014年   14篇
  2013年   190篇
  2011年   8篇
  2009年   12篇
  2008年   11篇
  2007年   9篇
  2006年   10篇
  2005年   19篇
  2004年   17篇
  2003年   12篇
  2002年   9篇
  2000年   9篇
  1999年   8篇
  1998年   11篇
  1997年   18篇
  1996年   16篇
  1995年   9篇
  1994年   19篇
  1993年   7篇
  1992年   11篇
  1991年   26篇
  1989年   15篇
  1988年   12篇
  1987年   23篇
  1986年   15篇
  1985年   19篇
  1984年   11篇
  1983年   10篇
  1982年   10篇
  1980年   11篇
  1979年   14篇
  1978年   10篇
  1977年   14篇
  1976年   12篇
  1975年   8篇
  1974年   13篇
  1973年   15篇
  1972年   15篇
  1971年   11篇
  1970年   14篇
  1969年   11篇
  1968年   9篇
  1967年   10篇
  1966年   7篇
排序方式: 共有888条查询结果,搜索用时 15 毫秒
21.
According to “interference theory” of reliability, a component fails if the maximum stress exceeds the component's strength. Assuming that both these quantities are random and their distributions are normal, we obtain in this paper some point and interval estimates of reliability when the stress distribution is known and a few observations exist on component strengths.  相似文献   
22.
Under certain conditions, the re-supply capability of a combatant force may be limited by the characteristics of the transportation network over which supplies must flow. Interdiction by an opposing force may be used to reduce the capacity of that network. The effects of such efforts vary for differing missions and targets. With only a limited total budget available, the interdictor must decide which targets to hit, and with how much effort. An algorithm is presented for determining the optimum interdiction plan for minimizing network flow capacity when the minimum capacity on an arc is positive and the cost of interdiction is a linear function of arc capacity reduction.  相似文献   
23.
This paper presents a general solution for the M/M/r queue with instantaneous jockeying and r > 1 servers. The solution is obtained in matrices in closed form without recourse to the generating function arguments usually used. The solution requires the inversion of two (Zr?1) × (2r?1) matrices. The method proposed is extended to allow different queue selection preferences of arriving customers, balking of arrivals, jockeying preference rules, and queue dependent selection along with jockeying. To illustrate the results, a problem previously published is studied to show how known results are obtained from the proposed general solution.  相似文献   
24.
Frequently there exists an insufficient amount of actual data upon which to base a decision. In this paper a method is presented whereby the subjective opinions of a group of qualified persons are utilized to quantify the relative importance of a finite number of parameters or objectives. A means of testing the consistency among the judges is given which allows the decision maker to determine the validity of the opinions gathered. The application presented here is in the area of Multiple Incentive Contracting. Namely, a method is proposed to facilitate the answering of the question, “What is the value to the purchaser of an incremental change in the performance of a system?” Such a vehicle is not essential to the methodology proposed.  相似文献   
25.
In this paper a model is presented which focuses on the difficult problem of predicting demands for items with extremely low usage rates. These form the bulk of repair parts in military systems. The basic notion underlying the model is the pooling of usage data for common design items with movement for the purpose of estimating usage rates for similar items which have shown no movement. A unique feature of the model is that it also makes possible the estimation of usage rates for items newly introduced into a system for which no previous usage history is available.  相似文献   
26.
27.
An allocation problem is considered in lvhich different kinds of resources must be allocated to various activities, within a given time period. The opportunities for allo'cation appear randomly during this period. Certain assumptions about the values of possible allocations and the distribution of occurrences of opportunities lead to a dynamic programming formulation of the problem. This leads to a system of ordinary differential equations which are (in theory) solvable recursively, and can be solved numerically to any desired degree of precision. An example is given for the allocation of aircraft-carried weapons to targets of opportunity.  相似文献   
28.
29.
It has long been an accepted proposition that base level usage df technical repair items for aircraft is related to program elements. The program element most often cited in this connection is flying hours. Evidence of this relationship on a line item basis, however, has been sparse. This study suggests that although the supposed relation is intuitively plausible, for most line items it cannot be effectively utilized in projecting base level requirements. The basis of this conclusion is an analysis of demand characteristics for technical repair items for a variety of naval aircraft.  相似文献   
30.
In some queueing systems the total service capacity utilized at any given time is a variable under the control of a decision maker. Management doctrines are examined which prescribe the actual service capacity as a function of the queue length and the recent history of the system. Steady state probabilities, expected queue lengths and frequencies of change in capacity are evaluated for a wide class of possible control schemes. Optimization procedures are outlined.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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