全文获取类型
收费全文 | 558篇 |
免费 | 17篇 |
出版年
2021年 | 13篇 |
2019年 | 13篇 |
2018年 | 7篇 |
2017年 | 12篇 |
2016年 | 10篇 |
2015年 | 12篇 |
2014年 | 13篇 |
2013年 | 96篇 |
2010年 | 5篇 |
2008年 | 6篇 |
2006年 | 7篇 |
2005年 | 7篇 |
2004年 | 4篇 |
2003年 | 4篇 |
2002年 | 10篇 |
2001年 | 9篇 |
2000年 | 6篇 |
1999年 | 6篇 |
1998年 | 9篇 |
1997年 | 13篇 |
1996年 | 6篇 |
1995年 | 8篇 |
1994年 | 10篇 |
1993年 | 15篇 |
1992年 | 10篇 |
1991年 | 10篇 |
1989年 | 10篇 |
1988年 | 23篇 |
1987年 | 9篇 |
1986年 | 19篇 |
1985年 | 17篇 |
1984年 | 13篇 |
1983年 | 6篇 |
1982年 | 6篇 |
1981年 | 9篇 |
1980年 | 10篇 |
1979年 | 13篇 |
1978年 | 10篇 |
1977年 | 12篇 |
1976年 | 4篇 |
1975年 | 9篇 |
1974年 | 12篇 |
1973年 | 6篇 |
1972年 | 8篇 |
1971年 | 10篇 |
1970年 | 7篇 |
1969年 | 9篇 |
1968年 | 4篇 |
1967年 | 4篇 |
1966年 | 4篇 |
排序方式: 共有575条查询结果,搜索用时 218 毫秒
71.
72.
In this paper we study higher‐order Markov chain models for analyzing categorical data sequences. We propose an efficient estimation method for the model parameters. Data sequences such as DNA and sales demand are used to illustrate the predicting power of our proposed models. In particular, we apply the developed higher‐order Markov chain model to the server logs data. The objective here is to model the users' behavior in accessing information and to predict their behavior in the future. Our tests are based on a realistic web log and our model shows an improvement in prediction. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
73.
The present paper provides a proof that the Bayes prediction ordering policy developed in [3] is an optimal policy, in the sense that it minimizes the total expected discounted cost of ordering for any finite planning horizon. 相似文献
74.
In many location problems, the solution is constrained to lie within a closed set. In this paper, optimal solutions to a special type of constrained location problem are characterized. In particular, the location problem with the solution constrained to be within a maximum distance of each demand point is considered, and an algorithm for its solution is developed and discussed. 相似文献
75.
Let X1 < X2 <… < Xn denote an ordered sample of size n from a Weibull population with cdf F(x) = 1 - exp (?xp), x > 0. Formulae for computing Cov (Xi, Xj) are well known, but they are difficult to use in practice. A simple approximation to Cov(Xi, Xj) is presented here, and its accuracy is discussed. 相似文献
76.
Paul S. Dwyer 《海军后勤学研究》1975,22(4):751-775
The general solution process of the Hitchcock transportation problem resulting from the application of the method of reduced matrices may give solutions with some negative xij values. This paper is devoted to a review of the reduced matrices method, an examination of suitable interpretation of sets of xij which include some negative values, and ways of interpreting these values in useful modifications of the Hitchcock problem. Such modifications include a) the reshipment problem, b) the overshipment problem, and c) the transshipment problem. Techniques are developed for determining and eliminating cij which are not optimal. These techniques and results are useful in solving the problems indicated above. The natural applicability of the simple and general method of reduced matrices is emphasized. 相似文献
77.
This paper considers the problem of computing optimal ordering policies for a product that has a life of exactly two periods when demand is random. Initially costs are charged against runouts (stockouts) and outdating (perishing). By charging outdating costs according to the expected amount of outdating one period into the future, a feasible one period model is constructed. The central theorem deals with the n-stage dynamic problem and demonstrates the appropriate cost functions are convex in the decision variable and also provides bounds on certain derivatives. The model is then generalized to include ordering and holding costs. The paper is concluded with a discussion of the infinite horizon problem. 相似文献
78.
M. S. Bazaraa 《海军后勤学研究》1973,20(2):357-366
In this study we interpret the exterior penalty function method as a generalized lagrangian metliod which fills duality gaps in nonconvex problems. Geometry and resolution of these gaps from a duality point of view are highlighted. 相似文献
79.
This paper describes a linear programming model used to perform cost-effectiveness analysis to determine the requirements for military strategic mobility resources. Expenditures for three classes of economic alternatives are considered: purchase of transportation resources; prepositioning of material; and augmentation of port facilities. The mix of economic alternatives that maximizes the effectiveness of the resultant transportation system is determined for a given investment level. By repeating the analysis for several levels of investment, a cost-effectiveness tradeoff curve can be developed. 相似文献
80.