全文获取类型
收费全文 | 886篇 |
免费 | 19篇 |
出版年
2021年 | 11篇 |
2019年 | 18篇 |
2018年 | 8篇 |
2017年 | 19篇 |
2016年 | 17篇 |
2015年 | 16篇 |
2014年 | 19篇 |
2013年 | 165篇 |
2012年 | 8篇 |
2010年 | 9篇 |
2009年 | 14篇 |
2007年 | 16篇 |
2006年 | 9篇 |
2005年 | 10篇 |
2004年 | 13篇 |
2003年 | 11篇 |
2002年 | 14篇 |
2000年 | 8篇 |
1999年 | 9篇 |
1998年 | 17篇 |
1997年 | 15篇 |
1996年 | 13篇 |
1995年 | 7篇 |
1994年 | 21篇 |
1993年 | 23篇 |
1992年 | 16篇 |
1991年 | 21篇 |
1990年 | 15篇 |
1989年 | 28篇 |
1988年 | 25篇 |
1987年 | 23篇 |
1986年 | 26篇 |
1985年 | 19篇 |
1984年 | 11篇 |
1983年 | 10篇 |
1982年 | 15篇 |
1981年 | 14篇 |
1980年 | 11篇 |
1979年 | 16篇 |
1978年 | 18篇 |
1977年 | 7篇 |
1976年 | 11篇 |
1975年 | 9篇 |
1974年 | 15篇 |
1973年 | 10篇 |
1972年 | 12篇 |
1971年 | 11篇 |
1970年 | 14篇 |
1969年 | 10篇 |
1967年 | 9篇 |
排序方式: 共有905条查询结果,搜索用时 31 毫秒
31.
R. D. Wollmer 《海军后勤学研究》1970,17(2):207-216
This paper presents an algorithm for determining where to place intercepting units in order to maximize the probability of preventing an opposing force from proceeding from one particular node in an undirected network to another. The usual gaming assumptions are invoked; namely, the strategy for placing the units is known to the opponent and he will choose a path through the network which, based on this knowledge, maximizes his probability of successful traverse. As given quantities, the model requires a list of the arcs and nodes of the network, the number of intercepting units available to stop the opposing force, and the probabilities for stopping the opposition at the arcs and nodes as functions of the number of intercepting units placed there. From these quantities, the algorithm calculates the probabilities for placing the unit at the arcs and nodes when one intercepting unit is available, and the expected numbers of units to place at the arcs and nodes when multiple intercepting units are available. 相似文献
32.
Alan J. Kaplan 《海军后勤学研究》1970,17(2):253-258
This paper is concerned with the optimum decision variables found using order quantity, reorder point (Q, R) inventory models. It examines whether the optimum variables (Q* and R*) are necessarily monotonic functions of the backorder cost parameter (or equivalently of the performance objective). For a general class of models it is proved that R* must increase as the performance objective is raised, and an inequality condition is derived which governs how Q* will change. Probability distributions of lead time demand are cited or found for which Q* increases, Q* decreases, and Q* is independent of increases in performance objectives or backorder cost parameter. 相似文献
33.
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. 相似文献
34.
35.
Industrial situations exist where it is necessary to estimate the optimum number of parts to start through a manufacturing process in order to obtain a given number of completed good items. The solution to this problem is not straightforward when the expected number of rejects from the process is a random variable and when there are alternative penalties associated with producing too many or too few items. This paper discusses various aspects of this problem as well as some of the proposed solutions to it. In addition, tables of optimum reject allowances based on a comprehensive model are presented. 相似文献
36.
Mathematical models of tactical problems in Hntisubmarine Warfare (ASW) are developed. Specifically, a game of pursuit between a hunter-killer force. player 1, and a possible submarine, player 2 is considered. The game consists of a sequence of moves and terminates when player 2 is tcaught or evades player 1. When the players move they observe the actual tactical configuration of the forces (state) and each player choosa-s a tactical plan from a finite collection. This joint choice of tactical plans determines an immediate payoff and a transition probability distribution over the states. Hence an expected payoff function is defined, Formally this game is a Terminating Stochastic Game (TSG). Shapley demonstrated the existence of a value and optimal strategies (solution), An iterative technique to approximate the solution to within desired accuracy is proposed. Each iteration of the technique is obtained by solving a set of linear programs. To introduce more realism into the game several variations of the TSG are also considered. One variation is a finite TSG and linear programming techniques are employed to find the solution. 相似文献
37.
38.
39.
40.