全文获取类型
收费全文 | 630篇 |
免费 | 5篇 |
专业分类
635篇 |
出版年
2021年 | 6篇 |
2020年 | 5篇 |
2019年 | 6篇 |
2017年 | 15篇 |
2016年 | 13篇 |
2015年 | 10篇 |
2014年 | 10篇 |
2013年 | 99篇 |
2012年 | 23篇 |
2011年 | 27篇 |
2010年 | 21篇 |
2009年 | 16篇 |
2008年 | 29篇 |
2007年 | 15篇 |
2006年 | 16篇 |
2005年 | 5篇 |
2004年 | 7篇 |
2002年 | 9篇 |
2001年 | 5篇 |
1999年 | 5篇 |
1998年 | 9篇 |
1997年 | 10篇 |
1996年 | 4篇 |
1995年 | 9篇 |
1994年 | 7篇 |
1993年 | 12篇 |
1992年 | 12篇 |
1991年 | 11篇 |
1990年 | 6篇 |
1989年 | 14篇 |
1988年 | 6篇 |
1987年 | 15篇 |
1986年 | 12篇 |
1985年 | 12篇 |
1983年 | 8篇 |
1982年 | 9篇 |
1981年 | 11篇 |
1980年 | 12篇 |
1979年 | 11篇 |
1978年 | 5篇 |
1977年 | 7篇 |
1976年 | 9篇 |
1975年 | 9篇 |
1974年 | 6篇 |
1973年 | 5篇 |
1972年 | 14篇 |
1971年 | 4篇 |
1970年 | 4篇 |
1969年 | 12篇 |
1968年 | 8篇 |
排序方式: 共有635条查询结果,搜索用时 0 毫秒
421.
In this paper we are concerned with several random processes that occur in M/G/1 queues with instantaneous feedback in which the feedback decision process is a Bernoulli process. Queue length processes embedded at various times are studied. It is shown that these do not all have the same asymptotic distribution, and that in general none of the output, input, or feedback processes is renewal. These results have implications in the application of certain decomposition results to queueing networks. 相似文献
422.
A serial production line is defined wherein a unit is produced if, and only if, all machines are functioning. A single buffer stock with finite capacity is to be placed immediately after one of the first N-1 machines in the N machine line. When all machines have equal probability of failure it is shown that the optimal buffer position is exactly in the middle of the line. This result is synthesized with the earlier work of Koenigsberg and Buzacott including an analysis of the covariance between transition states. An alternative model formulation is presented and integrated with previous results. Finally, a sufficient condition and solution procedure is derived for the installation of a buffer where there is a possible trade-off between increasing the reliability of the line versus adding a buffer stock. 相似文献
423.
424.
We consider the problem of temporal expansion of the capacity of, say, a plant or road given estimates of its desired usage (demand). The basic problem is: given a sequence of predicted demands for N time periods, determine the optimal investment decision in each period to minimize a linear investment cost and a strictly convex cost of capacity. The relationship between capacity and the investment decisions is assumed to be linear, but time varying. Constraints on both the individual decisions and on the sum of the decisions are considered. An algorithm for solving this problem is derived. 相似文献
425.
426.
A computationally feasible matrix method is presented to find the first-passage probabilities in a Markov chain where a set of states is taboo during transit. This concept has been used to evaluate the reliability of a system whose changes in strength can be thought of as a Markov chain, while the environment in which it is functioning generates stresses which can also be envisaged as another Markov chain. 相似文献
427.
This exposition presents a method for incorporating a technique known as “splitting the bump” within an elimination form reinversion algorithm. This procedure is designed to reduce fill-in during reinversion and should improve the efficiency of linear programming systems which already use the superior elimination form of the inverse. 相似文献
428.
429.
430.