全文获取类型
收费全文 | 684篇 |
免费 | 12篇 |
出版年
2021年 | 8篇 |
2019年 | 15篇 |
2018年 | 10篇 |
2017年 | 15篇 |
2016年 | 12篇 |
2015年 | 13篇 |
2013年 | 134篇 |
2011年 | 6篇 |
2010年 | 8篇 |
2008年 | 6篇 |
2007年 | 9篇 |
2006年 | 9篇 |
2005年 | 15篇 |
2004年 | 10篇 |
2003年 | 8篇 |
2000年 | 11篇 |
1999年 | 8篇 |
1998年 | 5篇 |
1997年 | 9篇 |
1996年 | 16篇 |
1995年 | 9篇 |
1994年 | 15篇 |
1993年 | 8篇 |
1992年 | 10篇 |
1991年 | 18篇 |
1990年 | 10篇 |
1989年 | 17篇 |
1988年 | 11篇 |
1987年 | 15篇 |
1986年 | 16篇 |
1985年 | 14篇 |
1984年 | 10篇 |
1983年 | 10篇 |
1982年 | 14篇 |
1981年 | 9篇 |
1980年 | 14篇 |
1979年 | 9篇 |
1978年 | 10篇 |
1977年 | 10篇 |
1976年 | 10篇 |
1975年 | 9篇 |
1974年 | 15篇 |
1973年 | 13篇 |
1972年 | 14篇 |
1971年 | 19篇 |
1970年 | 6篇 |
1969年 | 10篇 |
1968年 | 7篇 |
1967年 | 5篇 |
1948年 | 5篇 |
排序方式: 共有696条查询结果,搜索用时 62 毫秒
491.
A significant problem in electronic system design is that of partitioning the functional elements of an equipment schematic into subsets which may be regarded as modules. The collection of all such subsets generated by a particular partitioning forms a potential modular design. The specific problem is to determine that partitioning of the schematic that minimizes a cost function defined on the subsets subject to specified hardware, design, packaging, and inventory constraints. This problem is termed the modularization problem. This paper presents a method for obtaining restricted solutions to the modularization problem by employing some recent developments in linear graph theory obtained by one of the coauthors. Numerical results from the solution of several typical problems are presented. 相似文献
492.
493.
494.
We consider the problem of minimizing the sum of production, employment smoothing, and inventory costs over a finite number of time periods where demands are known. The fundamental difference between our model and that treated in [1] is that here we permit the smoothing cost to be nonstationary, thereby admitting a model with discounting. We show that the values of the instrumental variables are nondecreasing in time when demands are nondecreasing. We also derive some asymptotic properties of optimal policies. 相似文献
495.
Charles H. Reilly Clark A. Mount-Campbell Fernando Mata Eric K. Walton Eric A. Aebker Curt A. Levis 《海军后勤学研究》1991,38(6):779-797
We consider the problem of allotting locations in the geostationary orbit to communication satellites, subject to angle of elevation and electromagnetic interference constraints. An optimization framework is used as a means of finding feasible allotment plans. Specifically, we present a two-phase solution procedure for the satellite location problem (SLP). The objective in SLP is to allot geostationary orbital locations to satellites so as to minimize the sum of the absolute differences between the locations prescribed for the satellites and corresponding specified desired locations. We describe two heuristics, an ordering procedure and a k-permutation algorithm, that are used in tandem to find solutions to SLP. Solutions to a worldwide example problem with 183 satellites serving 208 service areas are summarized. 相似文献
496.
497.
G. A. Heuer 《海军后勤学研究》1984,31(2):229-249
A two-parameter class of games on 1,∞)2 is studied. The games may be regarded as analogs of Silverman games, having continuous payoff function in place of a step function of y/x. This change is motivated by a desire to move toward a model for competitive situations where the penalty for overspending increases with the amount of overspending. There are some similarities to games with bell-shaped kernel. For most of the region considered in the plane of the two parameters there are solutions of finite type, which are obtained explicitly. There are, however, pockets in this plane where no optimal strategies have been found and possibly where none of finite type exist. 相似文献
498.
This paper analyses the E/M/c queueing system and shows how to calculate the expected number in the system, both at a random epoch and immediately preceding an arrival. These expectations are expressed in terms of certain initial probabilities which are determined by linear equations. The advantages and disadvantages of this method are also discussed. 相似文献
499.
Robert W. Rosenthal 《海军后勤学研究》1980,27(2):231-232
An example of a network with flow costs depending on congestion is presented for which no system of tolls and subsidies exists which can ensure that all equilibria in the game of route selection are Pareto optimal. 相似文献
500.
A cutting plane method, based on a geometric inequality, is described as a means of solving geometric programs. While the method is applied to the primal geometric program, it is shown to retain the geometric programming duality relationships. Several methods of generating the cutting planes are discussed and illustrated on some example problems. 相似文献