全文获取类型
收费全文 | 602篇 |
免费 | 24篇 |
出版年
2021年 | 8篇 |
2019年 | 12篇 |
2018年 | 8篇 |
2017年 | 15篇 |
2016年 | 12篇 |
2015年 | 10篇 |
2014年 | 13篇 |
2013年 | 95篇 |
2011年 | 8篇 |
2010年 | 7篇 |
2009年 | 8篇 |
2007年 | 7篇 |
2006年 | 7篇 |
2005年 | 7篇 |
2004年 | 10篇 |
2002年 | 11篇 |
2001年 | 10篇 |
2000年 | 7篇 |
1999年 | 9篇 |
1998年 | 10篇 |
1997年 | 15篇 |
1996年 | 8篇 |
1995年 | 14篇 |
1994年 | 15篇 |
1993年 | 19篇 |
1992年 | 11篇 |
1991年 | 14篇 |
1990年 | 7篇 |
1989年 | 8篇 |
1988年 | 17篇 |
1987年 | 9篇 |
1986年 | 8篇 |
1985年 | 16篇 |
1984年 | 16篇 |
1983年 | 8篇 |
1981年 | 10篇 |
1980年 | 11篇 |
1979年 | 14篇 |
1978年 | 10篇 |
1977年 | 10篇 |
1976年 | 8篇 |
1975年 | 8篇 |
1974年 | 13篇 |
1973年 | 7篇 |
1972年 | 10篇 |
1971年 | 12篇 |
1970年 | 6篇 |
1969年 | 7篇 |
1968年 | 6篇 |
1967年 | 6篇 |
排序方式: 共有626条查询结果,搜索用时 0 毫秒
31.
New closure theorems for shock models in reliability theory are presented. If the number of shocks to failure and the times between the arrivals of shocks have probability distributions of phase type, then so has the time to failure. PH-distributions are highly versatile and may be used to model many qualitative features of practical interest. They are also well-suited for algorithmic implementation. The computational aspects of our results are discussed in some detail. 相似文献
32.
We study via simulation an M/M/1 queueing system with the assumption that a customer's service time and the interarrival interval separating his arrival from that of his predecessor are correlated random variables having a bivariate exponential distribution. We show that positive correlation reduces the mean and variance of the total waiting time and that negative correlation has the opposite effect. By using spectral analysis and a nonparametric test applied to the sample power spectra associated with certain simulated waiting times we show the effect to be statistically significant. 相似文献
33.
This paper reconsiders the classical model for selling an asset in which offers come in daily and a decision must then be made as to whether or not to sell. For each day the item remains unsold a continuation (or maintenance cost) c is incurred. The successive offers are assumed to be independent and identically distributed random variables having an unknown distribution F. The model is considered both in the case where once an offer is rejected it may not be recalled at a later time and in the case where such recall of previous offers is allowed. 相似文献
34.
In this paper we discuss the properties of a Bilinear Programming problem, and develop a convergent cutting plane algorithm. The cuts involve only a subset of the variables and preserve the special structure of the constraints involving the remaining variables. The cuts are deeper than other similar cuts. 相似文献
35.
John P. Matthews 《海军后勤学研究》1977,24(4):679-690
The purpose of this paper and the accompanying tables is to facilitate the calculation of constrained optimum order quantities and reorder points for an inventory control system where the criterion of optimality is the minimization of expected inventory holding, ordering, and time-weighted backorder costs. The tables provided in the paper allow the identification of the optimal solution when order quantities and/or reorder points are restricted to a set of values which do not include the unconstrained optimal solution. 相似文献
36.
Calculations for large Markovian finite source, finite repair capacity two-echelon repairable item inventory models are shown to be feasible using the randomization technique and a truncated state space approach. More complex models (involving transportation pipelines, multiple-item types and additional echelon levels) are also considered. 相似文献
37.
Timothy C. Barkdoll Donald P. Gaver Kevin D. Glazebrook Patricia A. Jacobs Sergio Posadas 《海军后勤学研究》2002,49(8):723-742
Blue strike aircraft enter region ? to attack Red targets. In Case 1, Blue conducts (preplanned) SEAD to establish air superiority. In the (reactive) SEAD scenario, which is Case 2, such superiority is already in place, but is jeopardized by prohibitive interference from Red, which threatens Blue's ability to conduct missions. We utilize both deterministic and stochastic models to explore optimal tactics for Red in such engagements. Policies are developed which will guide both Red's determination of the modes of operation of his engagement radar, and his choice of Blue opponent to target next. An index in the form of a simple transaction kill ratio plays a major role throughout. Published 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 723–742, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10046 相似文献
38.
William C. Spracher 《Low Intensity Conflict & Law Enforcement》2002,11(1):29-54
The newest US Cabinet department is Homeland Security (DHS). One of the most controversial aspects in the process of developing this entity is the role of intelligence in providing information on the increasing terrorist threat. This article examines the intelligence challenges for homeland security. In doing so, it explores the problems of merging disparate cultures - law enforcement vs intelligence, civil entities vs military, federal vs state and local jurisdictions, and domestic focus vs international perspective. Given the nature of the globalized, asymmetric threat, the need for more and better intelligence sharing is obvious. Terrorists and other criminals do not respect international boundaries; in fact, they exploit them in an effort to prevent effective and timely countermeasures. This demands that robust multinational collaboration and interagency coordination be practiced. 相似文献
39.
40.
We address the problem of dispatching a vehicle with different product classes. There is a common dispatch cost, but holding costs that vary by product class. The problem exhibits multidimensional state, outcome and action spaces, and as a result is computationally intractable using either discrete dynamic programming methods, or even as a deterministic integer program. We prove a key structural property for the decision function, and exploit this property in the development of continuous value function approximations that form the basis of an approximate dispatch rule. Comparisons on single product‐class problems, where optimal solutions are available, demonstrate solutions that are within a few percent of optimal. The algorithm is then applied to a problem with 100 product classes, and comparisons against a carefully tuned myopic heuristic demonstrate significant improvements. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 742–769, 2003. 相似文献