全文获取类型
收费全文 | 301篇 |
免费 | 5篇 |
出版年
2021年 | 4篇 |
2019年 | 9篇 |
2018年 | 5篇 |
2017年 | 7篇 |
2015年 | 3篇 |
2014年 | 4篇 |
2013年 | 51篇 |
2010年 | 4篇 |
2009年 | 3篇 |
2008年 | 6篇 |
2006年 | 2篇 |
2005年 | 3篇 |
2004年 | 5篇 |
2003年 | 4篇 |
2002年 | 3篇 |
2001年 | 4篇 |
2000年 | 4篇 |
1998年 | 5篇 |
1997年 | 5篇 |
1996年 | 9篇 |
1995年 | 4篇 |
1994年 | 2篇 |
1993年 | 4篇 |
1992年 | 5篇 |
1991年 | 8篇 |
1990年 | 5篇 |
1989年 | 8篇 |
1988年 | 8篇 |
1987年 | 7篇 |
1986年 | 7篇 |
1985年 | 6篇 |
1984年 | 6篇 |
1983年 | 2篇 |
1982年 | 4篇 |
1981年 | 5篇 |
1980年 | 10篇 |
1979年 | 4篇 |
1978年 | 6篇 |
1977年 | 4篇 |
1976年 | 5篇 |
1975年 | 6篇 |
1974年 | 4篇 |
1973年 | 2篇 |
1972年 | 5篇 |
1971年 | 8篇 |
1970年 | 4篇 |
1969年 | 4篇 |
1968年 | 5篇 |
1967年 | 4篇 |
1966年 | 6篇 |
排序方式: 共有306条查询结果,搜索用时 15 毫秒
201.
202.
In this paper marginal investment costs are assumed known for two kinds of equipment stocks employed to supply telecommunications services: trunks and switching facilities. A network hierarchy is defined which includes important cases occurring in the field and also appearing in the literature. A different use of the classical concept of the marginal capacity of an additional trunk at prescribed blocking probability leads to a linear programming supply model which can be used to compute the sizes of all the high usage trunk groups. The sizes of the remaining trunk groups are approximated by the linear programming models, but can be determined more accurately by alternate methods once all high usage group sizes are computed. The approach applies to larger scale networks than previously reported in the literature and permits direct application of the duality theory of linear programming and its sensitivity analyses to the study and design of switched probabilistic communications networks with multiple busy hours during the day. Numerical results are presented for two examples based on field data, one of which having been designed by the multi-hour engineering method. 相似文献
203.
A system deteriorates due to shocks received at random times, each shock causing a random amount of damage which accumulates over time and may result in a system failure. Replacement of a failed system is mandatory, while an operable one may also be replaced. In addition, the shock process causing system deterioration may be controlled by continuous preventive maintenance expenditures. The joint problem of optimal maintenance and replacement is analyzed and it is shown that, under reasonable conditions, optimal maintenance rate is decreasing in the cumulative damage level and that beyond a certain critical level the system should be replaced. Meaningful bounds are established on the optimal policies and an illustrative example is provided. 相似文献
204.
Roy D. Shapiro 《海军后勤学研究》1980,27(3):489-498
Consider a set of task pairs coupled in time: a first (initial) and second (completion) tasks of known durations with a specified time between them. If the operator or machine performing these tasks is able to process only one at a time, scheduling is necessary to insure that no overlap occurs. This problem has a particular application to production scheduling, transportation, and radar operations (send-receive pulses are ideal examples of time-linked tasks requiring scheduling). This article discusses several candidate techniques for schedule determination, and these are evaluated in a specific radar scheduling application. 相似文献
205.
Nozer D. Singpurwalla 《海军后勤学研究》1978,25(1):1-14
In this paper we propose a method for estimating reliability growth (or deterioration) using time series analysis. Our method does not call for the specification of a particular model, and estimates the growth in the presence of periodicity. We illustrate our procedure by considering some binomial failure data generated during the testing of a large system of the U.S. Navy. 相似文献
206.
A serial production line is defined wherein a unit is produced if, and only if, all machines are functioning. A single buffer stock with finite capacity is to be placed immediately after one of the first N-1 machines in the N machine line. When all machines have equal probability of failure it is shown that the optimal buffer position is exactly in the middle of the line. This result is synthesized with the earlier work of Koenigsberg and Buzacott including an analysis of the covariance between transition states. An alternative model formulation is presented and integrated with previous results. Finally, a sufficient condition and solution procedure is derived for the installation of a buffer where there is a possible trade-off between increasing the reliability of the line versus adding a buffer stock. 相似文献
207.
Wade D. Cook 《海军后勤学研究》1976,23(4):615-621
This paper investigates a class of two-person zero-sum multiple payoff games in which each component is deterministic. The problem of minimizing a player's total underachievement of a fixed set of goals is shown to reduce to a linear programming problem. Applications are discussed and illustrative examples are presented. 相似文献
208.
209.
210.
N. D. Cohen 《海军后勤学研究》1966,13(4):391-402
This paper presents the results and the method of analysis for an attack-defense game involving allocation of resources. Each player is assumed to have several different types of resources to be divided in optimal fashion among a fixed set of targets. The payoff function of the game is convex. The “No Soft-Spot” principle of M. Dresher, and the concept of the generalized inverse of a matrix are used to determine optimal strategies for each player and the value of the game. 相似文献