全文获取类型
收费全文 | 3339篇 |
免费 | 82篇 |
国内免费 | 1篇 |
专业分类
3422篇 |
出版年
2021年 | 37篇 |
2019年 | 88篇 |
2018年 | 51篇 |
2017年 | 80篇 |
2016年 | 78篇 |
2015年 | 62篇 |
2014年 | 65篇 |
2013年 | 710篇 |
2010年 | 35篇 |
2009年 | 37篇 |
2008年 | 47篇 |
2007年 | 52篇 |
2006年 | 36篇 |
2005年 | 42篇 |
2004年 | 56篇 |
2003年 | 42篇 |
2002年 | 57篇 |
1999年 | 41篇 |
1998年 | 47篇 |
1997年 | 47篇 |
1996年 | 61篇 |
1995年 | 42篇 |
1994年 | 59篇 |
1993年 | 64篇 |
1992年 | 58篇 |
1991年 | 74篇 |
1990年 | 39篇 |
1989年 | 72篇 |
1988年 | 78篇 |
1987年 | 68篇 |
1986年 | 71篇 |
1985年 | 66篇 |
1984年 | 36篇 |
1983年 | 42篇 |
1982年 | 43篇 |
1981年 | 46篇 |
1980年 | 51篇 |
1979年 | 45篇 |
1978年 | 49篇 |
1977年 | 45篇 |
1976年 | 45篇 |
1975年 | 46篇 |
1974年 | 52篇 |
1973年 | 50篇 |
1972年 | 52篇 |
1971年 | 43篇 |
1970年 | 40篇 |
1969年 | 40篇 |
1968年 | 34篇 |
1967年 | 34篇 |
排序方式: 共有3422条查询结果,搜索用时 15 毫秒
811.
We formulate and solve a discrete‐time path‐optimization problem where a single searcher, operating in a discretized three‐dimensional airspace, looks for a moving target in a finite set of cells. The searcher is constrained by maximum limits on the consumption of one or more resources such as time, fuel, and risk along any path. We develop a specialized branch‐and‐bound algorithm for this problem that uses several network reduction procedures as well as a new bounding technique based on Lagrangian relaxation and network expansion. The resulting algorithm outperforms a state‐of‐the‐art algorithm for solving time‐constrained problems and also is the first algorithm to solve multi‐constrained problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
812.
In this paper we optimally control service rates for an inventory system of service facilities with perishable products. We consider a finite capacity system where arrivals are Poisson‐distributed, lifetime of items have exponential distribution, and replenishment is instantaneous. We determine the service rates to be employed at each instant of time so that the long‐run expected cost rate is minimized for fixed maximum inventory level and capacity. The problem is modelled as a semi‐Markov decision problem. We establish the existence of a stationary optimal policy and we solve it by employing linear programming. Several numerical examples which provide insight to the behavior of the system are presented. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 464–482, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10021 相似文献
813.
A system reliability is often evaluated by individual tests of components that constitute the system. These component test plans have advantages over complete system based tests in terms of time and cost. In this paper, we consider the series system with n components, where the lifetime of the i‐th component follows exponential distribution with parameter λi. Assuming test costs for the components are different, we develop an efficient algorithm to design a two‐stage component test plan that satisfies the usual probability requirements on the system reliability and in addition minimizes the maximum expected cost. For the case of prior information in the form of upper bounds on λi's, we use the genetic algorithm to solve the associated optimization problems which are otherwise difficult to solve using mathematical programming techniques. The two‐stage component test plans are cost effective compared to single‐stage plans developed by Rajgopal and Mazumdar. We demonstrate through several numerical examples that our approach has the potential to reduce the overall testing costs significantly. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 95–116, 2002; DOI 10.1002/nav.1051 相似文献
814.
G. Levitin 《海军后勤学研究》2003,50(4):322-344
Weighted voting classifiers considered in this paper consist of N units each providing individual classification decisions. The entire system output is based on tallying the weighted votes for each decision and choosing the one which has total support weight exceeding a certain threshold. Each individual unit may abstain from voting. The entire system may also abstain from voting if no decision support weight exceeds the threshold. Existing methods of evaluating the reliability of weighted voting systems can be applied to limited special cases of these systems and impose some restrictions on their parameters. In this paper a universal generating function method is suggested which allows the reliability of weighted voting classifiers to be exactly evaluated without imposing constraints on unit weights. Based on this method, the classifier reliability is determined as a function of a threshold factor, and a procedure is suggested for finding the threshold which minimizes the cost of damage caused by classifier failures (misclassification and abstention may have different price.) Dynamic and static threshold voting rules are considered and compared. A method of analyzing the influence of units' availability on the entire classifier reliability is suggested, and illustrative examples are presented. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 322–344, 2003. 相似文献
815.
A double-ended queue with a Poisson arrival pattern is examined in a situation where the rates depend (in a restricted sense) on both the time and the state of the system. Under some circumstances, the rates can be controlled. This article studies the distribution of the difference in queue sizes for each member of a large class of control strategies and introduces the problem of determining the optimal times at which the control should be in effect in order to maximize certain objective functions. 相似文献
816.
Matthew S. Goldberg 《海军后勤学研究》1987,34(4):535-545
If material failures follow a Poisson distribution, then the expected number of failures is exactly proportional to flight hours. However, this article demonstrates that proportionality will not be revealed by simple correlation or regression analysis between monthly flight hours and the number of monthly failures. To test for proportionality, one must instead test the underlying hypothesis that the data follow a Poisson distribution. This article presents three simple tests that may be used for this purpose. The Poisson distribution requires that the mean and variance of the number of failures be equal. This article suggests several alternative models that may be used for samples in which the variance exceeds the mean. First, the mean of the Poisson distribution may itself be randomly distributed across the observational units according to a gamma distribution. If so, the number of failures will have a negative binomial distribution. Second, the mean of the Poisson distribution may depend systematically upon a set of observable explanatory variables. In this case, the Poisson regression model is appropriate. Finally, the mean of the Poisson distribution may contain both a systematic component that depends upon observable variables and a random component. This situation yields a generalized Poisson regression model. 相似文献
817.
For various parameter combinations, the logistic–exponential survival distribution belongs to four common classes of survival distributions: increasing failure rate, decreasing failure rate, bathtub‐shaped failure rate, and upside‐down bathtub‐shaped failure rate. Graphical comparison of this new distribution with other common survival distributions is seen in a plot of the skewness versus the coefficient of variation. The distribution can be used as a survival model or as a device to determine the distribution class from which a particular data set is drawn. As the three‐parameter version is less mathematically tractable, our major results concern the two‐parameter version. Boundaries for the maximum likelihood estimators of the parameters are derived in this article. Also, a fixed‐point method to find the maximum likelihood estimators for complete and censored data sets has been developed. The two‐parameter and the three‐parameter versions of the logistic–exponential distribution are applied to two real‐life data sets. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
818.
Donald D. Eisenstein 《海军后勤学研究》2008,55(4):350-362
Order picking accounts for most of the operating expense of a typical distribution center, and thus is often considered the most critical function of a supply chain. In discrete order picking a single worker walks to pick all the items necessary to fulfill a single customer order. Discrete order picking is common not only because of its simplicity and reliability, but also because of its ability to pick orders quickly upon receipt, and thus is commonly used by e‐commerce operations. There are two primary ways to reduce the cost (walking distance required) of the order picking system. First is through the use of technology—conveyor systems and/or the ability to transmit order information to pickers via mobile units. Second is through the design—where best to locate depots (where workers receive pick lists and deposit completed orders) and how best to lay out the product. We build a stochastic model to compare three configurations of different technology requirements: single‐depot, dual‐depot, and no‐depot. For each configuration we explore the optimal design. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
819.
We consider a system that depends on a single vital component. If this component fails, the system life will terminate. If the component is replaced before its failure then the system life may be extended; however, there are only a finite number of spare components. In addition, the lifetimes of these spare components are not necessarily identically distributed. We propose a model for scheduling component replacements so as to maximize the expected system survival. We find the counterintuitive result that when comparing components' general lifetime distributions based on stochastic orderings, not even the strongest ordering provides an a priori guarantee of the optimal sequencing of components. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
820.