全文获取类型
收费全文 | 341篇 |
免费 | 16篇 |
出版年
2021年 | 11篇 |
2020年 | 3篇 |
2019年 | 10篇 |
2018年 | 5篇 |
2017年 | 6篇 |
2016年 | 8篇 |
2015年 | 7篇 |
2014年 | 6篇 |
2013年 | 48篇 |
2011年 | 6篇 |
2010年 | 3篇 |
2009年 | 9篇 |
2007年 | 8篇 |
2006年 | 3篇 |
2005年 | 5篇 |
2004年 | 9篇 |
2003年 | 5篇 |
2002年 | 9篇 |
2001年 | 8篇 |
2000年 | 5篇 |
1999年 | 10篇 |
1998年 | 5篇 |
1997年 | 4篇 |
1996年 | 3篇 |
1995年 | 8篇 |
1994年 | 5篇 |
1993年 | 5篇 |
1992年 | 8篇 |
1991年 | 12篇 |
1990年 | 6篇 |
1989年 | 6篇 |
1988年 | 10篇 |
1987年 | 8篇 |
1986年 | 8篇 |
1984年 | 7篇 |
1983年 | 3篇 |
1981年 | 7篇 |
1980年 | 3篇 |
1979年 | 6篇 |
1978年 | 5篇 |
1977年 | 7篇 |
1975年 | 3篇 |
1974年 | 5篇 |
1973年 | 4篇 |
1972年 | 3篇 |
1971年 | 6篇 |
1969年 | 4篇 |
1968年 | 5篇 |
1966年 | 2篇 |
1948年 | 2篇 |
排序方式: 共有357条查询结果,搜索用时 15 毫秒
261.
A point is placed at random on the real line according to some known distribution F, and a search is made for this point, beginning at some starting points s on the line, and moving along the line according to some function x(t). The objective of this article is to maximize the probability of finding the point while traveling at most d units. Characterizations of simple optimal searches are found for arbitrary distributions, for continuous distributions with continuous density everywhere (e.g., normal, Cauchy, triangular), and for continuous distributions with density which is continuous on its support (e.g., exponential, uniform). These optimal searches are also shown to be optimal for maximization of the expected number of points found if the points are placed on the line independently from a known distribution F. 相似文献
262.
The discrete evasion game with three-move lag, formulated over 30 years ago, was one of the earliest games with time-lag complications. This game remains unsolved even though it is well known that the game has a value. In this article we obtain an upper bound for the value by constructing a strategy which consists of 400 conditional probabilities for the minimizing player. This is believed to be the best upper bound known. 相似文献
263.
A one-period inventory situation where the supply is an NBUE random variable with mean proportional to the quantity ordered has been considered. The optimal exponential order quantity, which maximizes the minimum profit obtainable in the NBUE class of supply distributions, is a function of the demand distribution function. Here we show that an estimator of the maximin order quantity, which is already known to converge almost surely to its true value, converges also in distribution to an appropriate normal law with increasing sample size. 相似文献
264.
The classical work of Gittins, which resulted in the celebrated index result, had applications to research planning as an important part of its motivation. However, research planning problems often have features that are not accommodated within Gittins's original framework. These include precedence constraints on the task set, influence between tasks, stopping or investment options and routes to success in which some tasks do not feature. We consider three classes of Markovian decision models for research planning, each of which has all of these features. Gittins-index heuristics are proposed and are assessed both analytically and computationally. They perform impressively. © 1995 John Wiley & Sons, Inc. 相似文献
265.
The article deals with a single machine earliness-tardiness scheduling model where idle times are permitted in job processing. Based on a cluster concept we develop properties of the model that lead to a very fast algorithm to find an optimal timing schedule for a given sequence of jobs. The performance of this algorithm is tested on 480 randomly generated problems involving 100, 200, 400 and 500 jobs. It takes less than two seconds to solve a 500 job problem on a PC. © 1995 John Wiley & Sons, Inc. 相似文献
266.
Given a set of jobs, a processing time and a weight for each job, several parallel and identical machines, and a common due date that is not too early to constrain the scheduling decision, we want to find an optimal job schedule so as to minimize the maximum weighted absolute lateness. We show that this problem is NP-complete even for the single-machine case, and is strongly NP-complete for the general case. We present a polynomial time heuristic for this problem and analyze its worst-case performance. Empirical testing of the heuristic is reported, and the results suggest that the performance is asymptotically optimal as the number of jobs tends to infinity. © 1994 John Wiley & Sons, Inc. 相似文献
267.
An area to be defended consists of separated point targets. These targets are subject to an attack in which the offensive weapons are assumed to arrive simultaneously. The defense has area defenders, each of which is capable of intercepting any attacker'. Furthermore, the defense has impact-point prediction, i.e., it has knowledge of each attacker's intended target prior to allocation of the area interceptors. For a given attack, the defense wishes to allocate its interceptors against attackers so as to maximize the expected total survival value of the targets. In its first move, the offense seeks an attack allocation which will minimize expected total surviving value against best defense. We develop an algorithm to determine optimal attack and defense strategies and the optimal value of this sequential min-max problem. Branch-and-bound techniques are used to obtain integer solutions, and illustrative computational results are provided. 相似文献
268.
This paper describes the Value Added Analysis methodology which is used as part of the U.S. Army's Planning, Programming, Budgeting, and Execution System to assist the Army leadership in evaluating and prioritizing competing weapon system alternatives during the process of building the Army budget. The Value Added Analysis concept uses a family of models to estimate an alternative system's contribution to the Army's effectiveness using a multiattribute value hierarchy. A mathematical optimization model is then used to simultaneously determine an alternative's cost‐benefit and to identify an optimal mix of weapon systems for inclusion in the Army budget. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 233–253, 1999 相似文献
269.
Nonparametric classes of life distributions are usually based on the pattern of aging in some sense. The common parametric families of life distributions also feature monotone aging. In this paper we consider the class of log‐concave distributions and the subclass of concave distributions. The work is motivated by the fact that most of the common parametric models of life distributions (including Weibull, Gamma, log‐normal, Pareto, and Gompertz distributions) are log‐concave, while the remaining life of maintained and old units tend to have a concave distribution. The classes of concave and log‐concave distributions do not feature monotone aging. Nevertheless, these two classes are shown to have several interesting and useful properties. We examine the closure of these classes under a number of reliability operations, and provide sharp reliability bounds for nonmaintained and maintained units having life distribution belonging to these classes. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 419–433, 1999 相似文献
270.