全文获取类型
收费全文 | 407篇 |
免费 | 4篇 |
出版年
2019年 | 13篇 |
2018年 | 12篇 |
2017年 | 15篇 |
2016年 | 12篇 |
2015年 | 3篇 |
2014年 | 8篇 |
2013年 | 140篇 |
2012年 | 3篇 |
2010年 | 7篇 |
2009年 | 3篇 |
2007年 | 2篇 |
2006年 | 3篇 |
2005年 | 6篇 |
2004年 | 4篇 |
2003年 | 5篇 |
2002年 | 11篇 |
2000年 | 5篇 |
1999年 | 3篇 |
1998年 | 6篇 |
1997年 | 5篇 |
1996年 | 3篇 |
1995年 | 4篇 |
1994年 | 4篇 |
1993年 | 10篇 |
1992年 | 7篇 |
1991年 | 5篇 |
1990年 | 3篇 |
1989年 | 6篇 |
1988年 | 7篇 |
1987年 | 8篇 |
1986年 | 5篇 |
1985年 | 6篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1982年 | 3篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1979年 | 2篇 |
1978年 | 7篇 |
1977年 | 2篇 |
1976年 | 5篇 |
1975年 | 4篇 |
1974年 | 5篇 |
1973年 | 2篇 |
1972年 | 3篇 |
1971年 | 7篇 |
1970年 | 3篇 |
1969年 | 5篇 |
1968年 | 4篇 |
1967年 | 4篇 |
排序方式: 共有411条查询结果,搜索用时 15 毫秒
281.
282.
John S. Croucher 《海军后勤学研究》1975,22(1):197-203
This paper considers a two sided resource allocation game in which both players initially have fixed resources which may be distributed over various targets. Their effectiveness depends on the manner of distribution and also on the strategy of the opponent, a natural payoff function for such a situation being used. The complete solution to the game is derived and a numerical example given. 相似文献
283.
Henrich John Malik 《海军后勤学研究》1970,17(3):327-330
In this paper the exact distribution of the product of two noncentral beta variates is derived using Mellin integral transform. The density function of the product is represented as a mixture of Beta distributions and the distribution function as a mixture of Incomplete Beta Functions. 相似文献
284.
John S. Maybee 《海军后勤学研究》1985,32(2):225-237
The mathematical theory necessary to solve combined arms models of military combat is presented here. We show how to apply the theory of positive operators to such models. Most of the results are purely qualitative in character showing that many properties of such systems are independent of the actual numerical values of the coefficients. Finally, we discuss in some detail an example of such a system. 相似文献
285.
Least absolute value (LAV) regression has become a widely accepted alternative to least squares regression. This has come about as the result of advancements in statistical theory and computational procedures to obtain LAV estimates. Computer codes are currently available to solve a wide range of LAV problems including the best subset regression. The purpose of this article is to study the use of penalty calculations and other branching rules in developing the solution tree for the best subset LAV regression. 相似文献
286.
Peter Kubat 《海军后勤学研究》1982,29(3):399-402
Let Xi be independent IFR random variables and let Yi be independent exponential random variables such that E[Xi]=E[Yi] for all i=1, 2, ? n. Then it is well known that E[min (Xi)] ≥E[min (Xi)]. Nevertheless, for 1≤i≤n exponentially distributed Xi's and for a decreasing convex function ?(.). it is shown that . 相似文献
287.
John J. Kanet 《海军后勤学研究》1981,28(4):643-651
This paper considers a single-machine scheduling problem in which penalities occur when a job is completed early or late. The objective is to minimize the total penalty subject to restrictive assumptions on the due dates and penalty functions for jobs. A procedure is presented for finding an optimal schedule. 相似文献
288.
In this paper marginal investment costs are assumed known for two kinds of equipment stocks employed to supply telecommunications services: trunks and switching facilities. A network hierarchy is defined which includes important cases occurring in the field and also appearing in the literature. A different use of the classical concept of the marginal capacity of an additional trunk at prescribed blocking probability leads to a linear programming supply model which can be used to compute the sizes of all the high usage trunk groups. The sizes of the remaining trunk groups are approximated by the linear programming models, but can be determined more accurately by alternate methods once all high usage group sizes are computed. The approach applies to larger scale networks than previously reported in the literature and permits direct application of the duality theory of linear programming and its sensitivity analyses to the study and design of switched probabilistic communications networks with multiple busy hours during the day. Numerical results are presented for two examples based on field data, one of which having been designed by the multi-hour engineering method. 相似文献
289.
This paper considers the two different flow shop scheduling problems that arise when, in a two machine problem, one machine is characterized by sequence dependent setup times. The objective is to determine a schedule that minimizes makespan. After establishing the optimally of permutation schedules for both of these problems, an efficient dynamic programming formulation is developed for each of them. Each of these formulations is shown to be comparable, from a computational standpoint, to the corresponding formulation of the traveling salesman problem. Then, the relative merits of the dynamic programming and branch and bound approaches to these two scheduling problems are discussed. 相似文献
290.