全文获取类型
收费全文 | 228篇 |
免费 | 13篇 |
出版年
2021年 | 4篇 |
2020年 | 4篇 |
2019年 | 10篇 |
2018年 | 4篇 |
2017年 | 5篇 |
2016年 | 9篇 |
2015年 | 12篇 |
2014年 | 3篇 |
2013年 | 49篇 |
2012年 | 2篇 |
2011年 | 5篇 |
2009年 | 2篇 |
2008年 | 2篇 |
2007年 | 6篇 |
2006年 | 2篇 |
2005年 | 3篇 |
2004年 | 6篇 |
2003年 | 6篇 |
2002年 | 5篇 |
2001年 | 3篇 |
2000年 | 3篇 |
1999年 | 8篇 |
1998年 | 4篇 |
1997年 | 3篇 |
1995年 | 3篇 |
1994年 | 6篇 |
1993年 | 4篇 |
1992年 | 6篇 |
1991年 | 7篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 4篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1981年 | 3篇 |
1979年 | 3篇 |
1977年 | 3篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1974年 | 4篇 |
1973年 | 1篇 |
1972年 | 1篇 |
1971年 | 4篇 |
1969年 | 2篇 |
1968年 | 3篇 |
1967年 | 1篇 |
1966年 | 2篇 |
1948年 | 1篇 |
排序方式: 共有241条查询结果,搜索用时 15 毫秒
1.
2.
Let X denote a random vector with a spherically symmetric distribution. The density of U = X'X, called a “generalized chi-square,” is derived for the noncentral case, when μ = E(X) ≠ 0. Explicit series representations are found in certain special cases including the “generalized spherical gamma,” the “generalized” Laplace and the Pearson type VII distributions. A simple geometrical representation of U is shown to be useful in generating random U variates. Expressions for moments and characteristic functions are also given. These densities occur in offset hitting probabilities. 相似文献
3.
An algorithm is given for solving minimum-cost flow problems where the shipping cost over an arc is a convex function of the number of units shipped along that arc. This provides a unified way of looking at many seemingly unrelated problems in different areas. In particular, it is shown how problems associated with electrical networks, with increasing the capacity of a network under a fixed budget, with Laplace equations, and with the Max-Flow Min-Cut Theorem may all be formulated into minimum-cost flow problems in convex-cost networks. 相似文献
4.
5.
Ancker's stochastic duels with limited ammunition supply are extended to cases where a kill is obtained through repetitive multiple hits with two firing modes, single-shot firing and pattern firing. Examples with negative exponential firing time and geometric ammunition supply are given. 相似文献
6.
Sufficient conditions are given for stochastic comparison of two alternating renewal processes based on the concept of uniformization. The result is used to compare component and system performance processes in maintained reliability systems. 相似文献
7.
8.
We consider a one-machine scheduling problem with earliness and tardiness penalties. All jobs are assigned a common due date and the objective is to minimize the total penalty due to job earliness and tardiness. We are interested in finding the optimal combination of the common due-date value and the job sequence. Despite the fact that this problem in general is very hard to solve, we prove that there exists at least a common property for all optimal solutions: The first job in an optimal sequence is one of the longest jobs. We also prove that this property holds for a general class of unimodal penalty functions. 相似文献
9.
This article develops a robust, exact algorithm for the maximal covering problem (MCP) using dual-based solution methods and greedy heuristics in branch and bound. Based on tests using randomly generated problems with problem parameters similar to those in the existing literature, the hybrid approach developed in this work appears to be effective over a wide range of MCP model parameters. The method is further validated on problems constructed from three real-world data sets. The extensive computational study compares the new method with other existing exact methods using problems that are as big, or larger than, those used in previous work on MCP. The results show that the proposed method is effective in most instances of MCP. In particular, it is shown that bounding schemes using Lagrangian relaxation are effective on MCP as a method of obtaining both exact and heuristic solutions. © 1996 John Wiley & Sons, Inc. 相似文献
10.
We examine the problem of estimating the item fill rate in a periodic inventory system. We show that the traditional expressions for line item fill rate, found in many operations management textbooks, perform well for high fill rates (above 90%), but they consistently underestimate the true fill rate. The problem of underestimation becomes significant as the fill rate falls below 90% and is greatly amplified in cases with very low fill rates (below 50%). We review other more accurate expressions for fill rate, discussing their relative merits. We then develop an exact fill rate expression that is robust for both high and low fill rates. We compare the new expression to others found in the literature via an extensive set of simulation experiments using data that reflect actual inventory systems found at Hewlett-Packard. We also examine the robustness of the expressions to violations in the underlying assumptions. Finally, we develop an alternative fill rate expression that is robust for cases of high demand variability where product returns are allowed. © 1995 John Wiley & Sons, Inc. 相似文献