全文获取类型
收费全文 | 568篇 |
免费 | 5篇 |
国内免费 | 9篇 |
出版年
2022年 | 3篇 |
2021年 | 8篇 |
2020年 | 7篇 |
2019年 | 4篇 |
2017年 | 11篇 |
2016年 | 10篇 |
2015年 | 10篇 |
2014年 | 10篇 |
2013年 | 61篇 |
2012年 | 33篇 |
2011年 | 37篇 |
2010年 | 36篇 |
2009年 | 22篇 |
2008年 | 37篇 |
2007年 | 26篇 |
2006年 | 27篇 |
2005年 | 13篇 |
2004年 | 10篇 |
2003年 | 5篇 |
2002年 | 10篇 |
2001年 | 5篇 |
1998年 | 6篇 |
1997年 | 6篇 |
1995年 | 5篇 |
1994年 | 4篇 |
1993年 | 10篇 |
1992年 | 7篇 |
1991年 | 6篇 |
1989年 | 12篇 |
1988年 | 3篇 |
1987年 | 10篇 |
1986年 | 10篇 |
1985年 | 7篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 8篇 |
1980年 | 9篇 |
1979年 | 11篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 7篇 |
1975年 | 7篇 |
1974年 | 2篇 |
1973年 | 2篇 |
1972年 | 12篇 |
1971年 | 3篇 |
1970年 | 3篇 |
1969年 | 9篇 |
1968年 | 7篇 |
1966年 | 3篇 |
排序方式: 共有582条查询结果,搜索用时 15 毫秒
411.
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. 相似文献
412.
413.
414.
415.
416.
417.
This paper analyses the E/M/c queueing system and shows how to calculate the expected number in the system, both at a random epoch and immediately preceding an arrival. These expectations are expressed in terms of certain initial probabilities which are determined by linear equations. The advantages and disadvantages of this method are also discussed. 相似文献
418.
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. 相似文献
419.
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. 相似文献
420.
“Relevation” is the name given by Krakowski to the distribution of failure time of a replacement from an aging stock. The present authors have extended this concept to include (i) hierarchal replacement systems and (ii) dependence between lifetimes of original and replacement items. In this article, we present some further developments, including first steps toward a synthesis of (i) and (ii). 相似文献