全文获取类型
收费全文 | 437篇 |
免费 | 15篇 |
出版年
2020年 | 5篇 |
2019年 | 7篇 |
2018年 | 4篇 |
2017年 | 8篇 |
2016年 | 7篇 |
2015年 | 9篇 |
2014年 | 7篇 |
2013年 | 78篇 |
2011年 | 4篇 |
2010年 | 4篇 |
2009年 | 5篇 |
2007年 | 6篇 |
2005年 | 4篇 |
2004年 | 8篇 |
2003年 | 5篇 |
2002年 | 7篇 |
2001年 | 7篇 |
2000年 | 4篇 |
1999年 | 7篇 |
1998年 | 9篇 |
1997年 | 9篇 |
1996年 | 6篇 |
1995年 | 12篇 |
1994年 | 15篇 |
1993年 | 10篇 |
1992年 | 12篇 |
1991年 | 12篇 |
1990年 | 6篇 |
1989年 | 4篇 |
1988年 | 11篇 |
1987年 | 8篇 |
1986年 | 5篇 |
1985年 | 9篇 |
1984年 | 11篇 |
1983年 | 6篇 |
1982年 | 5篇 |
1981年 | 9篇 |
1980年 | 7篇 |
1979年 | 11篇 |
1978年 | 6篇 |
1977年 | 7篇 |
1976年 | 7篇 |
1975年 | 10篇 |
1974年 | 7篇 |
1973年 | 8篇 |
1972年 | 9篇 |
1971年 | 6篇 |
1969年 | 4篇 |
1968年 | 6篇 |
1967年 | 4篇 |
排序方式: 共有452条查询结果,搜索用时 15 毫秒
331.
Recurrence relations for the product moments of order statistics from a doubly truncated exponential distribution are obtained. These relations allow us to evaluate the product moments for all sample sizes. 相似文献
332.
Hemiter's entropy model for brand purchase behavior has been generalized for Renyi's measure of entropy which is a more general concept than Shannon's measure of entropy used by Herniter and which includes Shannon's measure as a limiting case. The generalized model considered here is more flexible than Herniter's model since it can give different marketing statistics for different products and it can give these statistics even when only some of the brands are considered. 相似文献
333.
Randolph F. C. Shen 《海军后勤学研究》1980,27(2):335-344
In 1973 the Defense Department made plans to close many Navy bases in the United States. Hardest hit was Rhode Island which would suffer a loss of 45.61% of the total cutback of 42,812 jobs. This paper describes two models which were built to forecast the severity of the economic impact in Rhode Island: one used the reduced form equation approach, and the other the simultaneous equations system approach. Tests on multicollinearity, specification, and serial correlation were conducted. An ex post evaluation of these two models' performance in forecasting then concludes the paper. 相似文献
334.
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. 相似文献
335.
A computationally simple method for obtaining confidence bounds for highly reliable coherent systems, based on component tests which experience few or no failures, is given. Binomial and Type I censored exponential failure data are considered. Here unknown component unreliabilities are ordered by weighting factors, which are firstly presumed known then sensitivity of the confidence bounds to these assumed weights is examined and shown to be low. 相似文献
336.
The 0-1 multiple-knapsack problem is an extension of the well-known 0-1 knapsack problem. It is a problem of assigning m objects, each having a value and a weight, to n knapsacks in such a way that the total weight in each knapsack is less than its capacity limit and the total value in the knapsacks is maximized. A branch-and-bound algorithm for solving the problem is developed and tested. Branching rules that avoid the search of redundant partial solutions are used in the algorithm. Various bounding techniques, including Lagrangean and surrogate relaxations, are investigated and compared. 相似文献
337.
Chelsea C. White 《海军后勤学研究》1979,26(3):415-422
This paper characterizes the structure of optimal strategies for a replacement problem for two special cases of observation quality. It is shown that when the state of the system is either completely observed or completely unobserved at every decision epoch by the controller, reasonable assumptions are sufficient for the existence of optimal replacement strategies composed of policies having a generalized, control-limit form. These structural results are of particular interest since the optimal cost functions for the two special cases represent bounds on the optimal cost function for the general partially observed case, significant computational simplification can result for the two special cases due to their optimal strategy structure, and optimal strategies possessing a control-limit structure do not necessarily exist for the general partially observed case. 相似文献
338.
An extended logistic system is a well-defined configuration of equipment, modules, inventories, and repair and replacement facilities modeling a complex, repairable system with on-going repair. The design of such systems has been based largely on the static tools of inventory theory and reliability theory, i.e., on steady-state distributions and on associated means and variances. Such static tools suppress the scale of real lime and ignore system persistence time in up-states and persistence time in down-states. A reasonably simple dynamic methodology is presented, focusing on system failure time as a more meaningful objective function for system-design tradeoff studies. In the presence of good reliability, it is shown that different candidates for system failure time effectively merge to yield an unambiguous, single system failure time. Examples illustrating the importance of dynamic information for system design are given. 相似文献
339.
340.
David R. Morrison Jason J. Sauppe Wenda Zhang Sheldon H. Jacobson Edward C. Sewell 《海军后勤学研究》2017,64(1):64-82
The cyclic best‐first search (CBFS) strategy is a recent search strategy that has been successfully applied to branch‐and‐bound algorithms in a number of different settings. CBFS is a modification of best‐first search (BFS) that places search tree subproblems into contours which are collections of subproblems grouped in some way, and repeatedly cycles through all non‐empty contours, selecting one subproblem to explore from each. In this article, the theoretical properties of CBFS are analyzed for the first time. CBFS is proved to be a generalization of all other search strategies by using a contour definition that explores the same sequence of subproblems as any other search strategy. Further, a bound is proved between the number of subproblems explored by BFS and the number of children generated by CBFS, given a fixed branching strategy and set of pruning rules. Finally, a discussion of heuristic contour‐labeling functions is provided, and proof‐of‐concept computational results for mixed‐integer programming problems from the MIPLIB 2010 database are shown. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 64–82, 2017 相似文献