全文获取类型
收费全文 | 404篇 |
免费 | 11篇 |
国内免费 | 1篇 |
专业分类
416篇 |
出版年
2020年 | 4篇 |
2019年 | 16篇 |
2018年 | 15篇 |
2017年 | 10篇 |
2016年 | 9篇 |
2015年 | 6篇 |
2014年 | 9篇 |
2013年 | 102篇 |
2012年 | 4篇 |
2010年 | 7篇 |
2008年 | 3篇 |
2007年 | 7篇 |
2006年 | 4篇 |
2005年 | 6篇 |
2004年 | 4篇 |
2002年 | 7篇 |
2001年 | 3篇 |
1999年 | 6篇 |
1998年 | 10篇 |
1997年 | 11篇 |
1996年 | 6篇 |
1995年 | 5篇 |
1994年 | 10篇 |
1993年 | 11篇 |
1992年 | 7篇 |
1991年 | 10篇 |
1990年 | 10篇 |
1989年 | 6篇 |
1988年 | 9篇 |
1987年 | 4篇 |
1986年 | 8篇 |
1985年 | 7篇 |
1984年 | 3篇 |
1982年 | 7篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1977年 | 3篇 |
1976年 | 3篇 |
1975年 | 5篇 |
1974年 | 3篇 |
1973年 | 5篇 |
1972年 | 4篇 |
1971年 | 2篇 |
1969年 | 2篇 |
1968年 | 7篇 |
1967年 | 2篇 |
1966年 | 4篇 |
1948年 | 2篇 |
排序方式: 共有416条查询结果,搜索用时 15 毫秒
91.
This article shows how to determine the stationary distribution of the virtual wait in M/G/1 queues with either one-at-a-time or exhaustive server vacations, depending on either service times or accrued workload. For the first type of dependence, each vacation time is a function of the immediately preceding service time or of whether the server finds the system empty after returning from vacation. In this way, it is possible to model situations such as long service times followed by short vacations, and vice versa. For the second type of dependence, the vacation time assigned to an arrival to follow its service is a function of the level of virtual wait reached. By this device, we can model situations in which vacations may be shortened whenever virtual delays have gotten excessive. The method of analysis employs level-crossing theory, and examples are given for various cases of service and vacation-time distributions. A closing discussion relates the new model class to standard M/G/1 queues where the service time is a sum of variables having complex dependencies. © 1992 John Wiley & Sons, Inc. 相似文献
92.
William H. Ruckle 《海军后勤学研究》1992,39(7):893-903
This article is a theoretic study of the following problem in verification: Mobile units under control of an agent, whom we call the HIDER, travel on a known transportation network and must at the conclusion of their itinerary report locations at fixed time intervals to a monitoring authority, whom we call the SEEKER. The purpose of this reporting requirement is to verify that illegal units do not infiltrate the network from sources under the control of the HIDER. We assume that the SEEKER has an independent intelligence-gathering capability which gives sightings of both legal and illegal units. The purpose of this article is to quantify the advantage of frequent over infrequent reporting. © 1992 John Wiley & Sons, Inc. 相似文献
93.
Soung H. Kim 《海军后勤学研究》1985,32(4):647-651
The Markov assumption that transition probabilities are assumed to be constant over entire periods has been applied in economic and social structures, for example, in the analysis of income and wage distributions. In many cases, however, nonstationary transition probabilities exist over different periods. Based on causative matrix technique, this study shows a binomial approximation for obtaining nonstationary interim transition probabilities under undisturbance when the first and the last transition matrices are known. 相似文献
94.
In this journal in 1967. Szware presented an algorithm for the optimal routing of a common vehicle fleet between m sources and n sinks with p different types of commodities. The main premise of the formulation is that a truck may carry only one commodity at a time and must deliver the entire load to one demand area. This eliminates the problem of routing vehicles between sources or between sinks and limits the problem to the routing of loaded trucks between sources and sinks and empty trucks making the return trip. Szwarc considered only the transportation aspect of the problem (i. e., no intermediate points) and presented a very efficient algorithm for solution of the case he described. If the total supply is greater than the total demand, Szwarc shows that the problem is equivalent to a (mp + n) by (np + m) Hitchcock transportation problem. Digital computer codes for this algorithm require rapid access storage for a matrix of size (mp + n) by (np + m); therefore, computer storage required grows proportionally to p2. This paper offers an extension of his work to a more general form: a transshipment network with capacity constraints on all arcs and facilities. The problem is shown to be solvable directly by Fulkerson's out-of-kilter algorithm. Digital computer codes for this formulation require rapid access storage proportional to p instead of p2. Computational results indicate that, in addition to handling the extensions, the out-of-kilter algorithm is more efficient in the solution of the original problem when there is a mad, rate number of commodities and a computer of limited storage capacity. 相似文献
95.
The article attempts to show how network theory may be applied to gain new and better insights into basic economic problems. Starting with a precise definition of what is meant by acting and, in particular, by economic acting, we direct the line of argumentation toward solving the problem of how to aggregate economic decisions. Results indicate that network theory might well prove itself to be a powerful instrument in developing a theory of human behavior much more comprehensive than currently used models. 相似文献
96.
Jeffrey H. Grotte 《海军后勤学研究》1978,25(2):315-322
This paper considers the problem of allocating weapons to achieve targeting objectives while simultaneously minimizing aggregate damage to surrounding nonmilitary facilities, each of which has an upper limit to the damage it is permitted to incur. A model is formulated which assumes only that damage to individual targets or associated facilities does not decrease as the number of allocated weapons increases. An implicit enumeration algorithm, based on that of Lawler and Bell is described that yields optimal integer solutions. An example is presented. 相似文献
97.
A duality theory is developed for mathematical programs with strictly quasi-concave objective functions to be maximized over a convex set. This work broadens the duality theory of Rockafellar and Peterson from concave (convex) functions to quasi-concave (quasi-convex) functions. The theory is closely related to the utility theory in economics. An example from economic planning is examined and the solution to the dual program is shown to have the properties normally associated with market prices. 相似文献
98.
James H. Patterson 《海军后勤学研究》1976,23(1):95-123
Individual characteristics of multiple-constrained resource, project scheduling problems are examined in an attempt to predict the solution obtainable with heuristic methods. Difficulties encountered in performing this type of research are described, and several multiple regression models are developed for predicting heuristic performance. Both single and multiple project data are examined, and results reported demonstrate the efficacy of determining beforehand the method used for problem solution. 相似文献
99.
Charles H. Falkner 《海军后勤学研究》1969,16(3):287-295
A mathematical model is formulated for determining the number of spare components to purchase when components stochastically fail according to a known life distribution function and there is a cost incurred when a component is replaced. Bounds are determined for the optimal inventory which indicate that the inclusion of the replacement cost lowers the optimal inventory. Since these bounds are no easier to calculate than the optimal spares level, the theory is specialized to components with exponentially distributed time to failure. Procedures are given for calculating the optimal spares level, and numerical examples are provided. 相似文献
100.
S. H. Tijs 《海军后勤学研究》1981,28(1):153-156
For the family D, consisting of those zero-sum two-person games which have a value, the value-function on D is characterized by four properties called objectivity, monotony, symmetry and sufficiency. 相似文献