全文获取类型
收费全文 | 737篇 |
免费 | 21篇 |
专业分类
758篇 |
出版年
2019年 | 16篇 |
2018年 | 9篇 |
2017年 | 25篇 |
2016年 | 15篇 |
2015年 | 17篇 |
2014年 | 20篇 |
2013年 | 173篇 |
2012年 | 7篇 |
2011年 | 10篇 |
2010年 | 10篇 |
2009年 | 14篇 |
2008年 | 8篇 |
2007年 | 6篇 |
2006年 | 12篇 |
2005年 | 15篇 |
2004年 | 14篇 |
2003年 | 7篇 |
2002年 | 13篇 |
2000年 | 9篇 |
1999年 | 8篇 |
1998年 | 13篇 |
1997年 | 8篇 |
1996年 | 11篇 |
1995年 | 7篇 |
1994年 | 18篇 |
1993年 | 17篇 |
1992年 | 13篇 |
1991年 | 16篇 |
1990年 | 10篇 |
1989年 | 16篇 |
1988年 | 17篇 |
1987年 | 18篇 |
1986年 | 17篇 |
1985年 | 13篇 |
1984年 | 8篇 |
1983年 | 9篇 |
1982年 | 7篇 |
1981年 | 11篇 |
1980年 | 6篇 |
1979年 | 9篇 |
1978年 | 12篇 |
1976年 | 7篇 |
1975年 | 8篇 |
1974年 | 8篇 |
1973年 | 8篇 |
1972年 | 9篇 |
1971年 | 5篇 |
1970年 | 10篇 |
1969年 | 6篇 |
1967年 | 7篇 |
排序方式: 共有758条查询结果,搜索用时 15 毫秒
291.
Edward J. Dudewicz 《海军后勤学研究》1970,17(1):69-78
Suppose that observations from populations π1, …, πk (k ≥ 1) are normally distributed with unknown means μ1., μk, respectively, and a common known variance σ2. Let μ[1] μ … ≤ μ[k] denote the ranked means. We take n independent observations from each population, denote the sample mean of the n observation from π1 by X i (i = 1, …, k), and define the ranked sample means X [1] ≤ … ≤ X [k]. The problem of confidence interval estimation of μ(1), …,μ[k] is stated and related to previous work (Section 1). The following results are obtained (Section 2). For i = 1, …, k and any γ(0 < γ < 1) an upper confidence interval for μ[i] with minimal probability of coverage γ is (? ∞, X [i]+ h) with h = (σ/n1/2) Φ?1(γ1/k-i+1), where Φ(·) is the standard normal cdf. A lower confidence interval for μ[i] with minimal probability of coverage γ is (X i[i] – g, + ∞) with g = (σ/n1/2) Φ?1(γ1/i). For the upper confidence interval on μ[i] the maximal probability of coverage is 1– [1 – γ1/k-i+1]i, while for the lower confidence interval on μ[i] the maximal probability of coverage is 1–[1– γ1/i] k-i+1. Thus the maximal overprotection can always be calculated. The overprotection is tabled for k = 2, 3. These results extend to certain translation parameter families. It is proven that, under a bounded completeness condition, a monotone upper confidence interval h(X 1, …, X k) for μ[i] with probability of coverage γ(0 < γ < 1) for all μ = (μ[1], …,μ[k]), does not exist. 相似文献
292.
J. R. Isbell 《海军后勤学研究》1967,14(4):569-571
The solution of isaacs1 problem of optimal pursuit in a plane with a circular disk removed, given constant speeds, zero turning radius, and perfect visibility for both players is presented herein. The hole has three effects: the trivial effect that shortest paths are not straight, the trapping effect to turn the evader from running into the hole, and the screening effect causing an evader retreating behind the hole not to retreat across a line through its center. 相似文献
293.
294.
A promising approach to failure modeling, in particular to developing failure-time distributions, is discussed. Under this approach, system state or wear and tear is modeled by an appropriately chosen random process—for example, a diffusion process—and the occurrences of fatal shocks are modeled by a Poisson process whose rate function is state dependent. The system is said to fail when either wear and tear accumulates beyond an acceptable or safe level or a fatal shock occurs. This approach has significant merit. First, it provides revealing new insights into most of the famous and frequently used lifetime distributions in reliability theory. Moreover, it suggests intuitively appealing ways for enhancing those standard models. Indeed, this approach provides a means of representing the underlying dynamics inherent in failure processes. Reasonable postulates for the dynamics of failure should lend credence to the prediction and estimation of reliability, maintainability, and availability. In other words, accuracy of representation could lead to better, more reliable prediction of failure. 相似文献
295.
296.
We examine the behavior of a manufacturer and a retailer in a decentralized supply chain under price‐dependent, stochastic demand. We model a retail fixed markup (RFM) policy, which can arise as a form of vertically restrictive pricing in a supply chain, and we examine its effect on supply chain performance. We prove the existence of the optimal pricing and replenishment policies when demand has a linear additive form and the distribution of the uncertainty component has a nondecreasing failure rate. We numerically compare the relative performance of RFM to a price‐only contract and we find that RFM results in greater profit for the supply chain than the price‐only contract in a variety of scenarios. We find that RFM can lead to Pareto‐improving solutions where both the supplier and the retailer earn more profit than under a price‐only contract. Finally, we compare RFM to a buyback contract and explore the implications of allowing the fixed markup parameter to be endogenous to the model. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006. 相似文献
297.
We consider the problem of maximizing the number of on‐time jobs on two uniform parallel machines. We show that a straightforward extension of an algorithm developed for the simpler two identical parallel machines problem yields a heuristic with a worst‐case ratio bound of at least . We then show that the infusion of a “look ahead” feature into the aforementioned algorithm results in a heuristic with the tight worst‐case ratio bound of , which, to our knowledge, is the tightest worst‐case ratio bound available for the problem. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
298.
The deterministic problem for finding an aircraft's optimal risk trajectory in a threat environment has been formulated. The threat is associated with the risk of aircraft detection by radars or similar sensors. The model considers an aircraft's trajectory in three‐dimensional (3‐D) space and represents the aircraft by a symmetrical ellipsoid with the axis of symmetry directing the trajectory. Analytical and discrete optimization approaches for routing an aircraft with variable radar cross‐section (RCS) subject to a constraint on the trajectory length have been developed. Through techniques of Calculus of Variations, the analytical approach reduces the original risk optimization problem to a vectorial nonlinear differential equation. In the case of a single detecting installation, a solution to this equation is expressed by a quadrature. A network optimization approach reduces the original problem to the Constrained Shortest Path Problem (CSPP) for a 3‐D network. The CSPP has been solved for various ellipsoid shapes and different length constraints in cases with several radars. The impact of ellipsoid shape on the geometry of an optimal trajectory as well as the impact of variable RCS on the performance of a network optimization algorithm have been analyzed and illustrated by several numerical examples. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
299.
Consider a patrol problem, where a patroller traverses a graph through edges to detect potential attacks at nodes. An attack takes a random amount of time to complete. The patroller takes one time unit to move to and inspect an adjacent node, and will detect an ongoing attack with some probability. If an attack completes before it is detected, a cost is incurred. The attack time distribution, the cost due to a successful attack, and the detection probability all depend on the attack node. The patroller seeks a patrol policy that minimizes the expected cost incurred when, and if, an attack eventually happens. We consider two cases. A random attacker chooses where to attack according to predetermined probabilities, while a strategic attacker chooses where to attack to incur the maximal expected cost. In each case, computing the optimal solution, although possible, quickly becomes intractable for problems of practical sizes. Our main contribution is to develop efficient index policies—based on Lagrangian relaxation methodology, and also on approximate dynamic programming—which typically achieve within 1% of optimality with computation time orders of magnitude less than what is required to compute the optimal policy for problems of practical sizes. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 557–576, 2014 相似文献
300.