全文获取类型
收费全文 | 603篇 |
免费 | 18篇 |
国内免费 | 1篇 |
出版年
2021年 | 15篇 |
2019年 | 17篇 |
2018年 | 9篇 |
2017年 | 13篇 |
2016年 | 10篇 |
2015年 | 12篇 |
2014年 | 15篇 |
2013年 | 111篇 |
2010年 | 8篇 |
2007年 | 9篇 |
2006年 | 6篇 |
2005年 | 10篇 |
2004年 | 5篇 |
2002年 | 12篇 |
2001年 | 7篇 |
2000年 | 6篇 |
1999年 | 7篇 |
1998年 | 13篇 |
1997年 | 14篇 |
1996年 | 8篇 |
1995年 | 7篇 |
1994年 | 15篇 |
1993年 | 15篇 |
1992年 | 11篇 |
1991年 | 14篇 |
1990年 | 9篇 |
1989年 | 12篇 |
1988年 | 18篇 |
1987年 | 8篇 |
1986年 | 17篇 |
1985年 | 13篇 |
1984年 | 7篇 |
1983年 | 7篇 |
1982年 | 9篇 |
1981年 | 12篇 |
1980年 | 8篇 |
1979年 | 14篇 |
1978年 | 11篇 |
1977年 | 10篇 |
1976年 | 5篇 |
1975年 | 11篇 |
1974年 | 9篇 |
1973年 | 9篇 |
1972年 | 9篇 |
1971年 | 4篇 |
1970年 | 4篇 |
1969年 | 8篇 |
1968年 | 7篇 |
1967年 | 4篇 |
1966年 | 6篇 |
排序方式: 共有622条查询结果,搜索用时 15 毫秒
451.
Hemiter's entropy model for brand purchase behavior has been generalized for Renyi's measure of entropy which is a more general concept than Shannon's measure of entropy used by Herniter and which includes Shannon's measure as a limiting case. The generalized model considered here is more flexible than Herniter's model since it can give different marketing statistics for different products and it can give these statistics even when only some of the brands are considered. 相似文献
452.
S. Christian Albright 《海军后勤学研究》1980,27(1):17-27
We consider a model with M + N identical machines. As many as N of these can be working at any given time and the others act as standby spares. Working machines fail at exponential rate λ, spares fail at exponential rale γ, and failed machines are repaired at exponential rate μ. The control variables are λ. μ, and the number of removable repairman, S, to be operated at any given time. Using the criterion of total expected discounted cost, we show that λ, S, and μ are monotonic functions of the number of failed machines M, N, the discount factor, and for the finite time horizon model, the amount of time remaining. 相似文献
453.
The loading problem we consinder is to assign a set of discrete objects, each having a weight, to a set of boxes, each of which has a capacity limit, in such a way that every object is assigned to a box and the number of boxes used is minimized. A characterization of the assignments is offered and used to develop a set of rules for generating nonredundant assignments. The rules are incorporated into an implicit enumeration algorithm. The algorithm is tested against a very good heuristic. Computational experience shows that the algorithm is highly efficient, solving problems of up to 3600 0-1 variables in a CPU second. 相似文献
454.
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. 相似文献
455.
The 0-1 multiple-knapsack problem is an extension of the well-known 0-1 knapsack problem. It is a problem of assigning m objects, each having a value and a weight, to n knapsacks in such a way that the total weight in each knapsack is less than its capacity limit and the total value in the knapsacks is maximized. A branch-and-bound algorithm for solving the problem is developed and tested. Branching rules that avoid the search of redundant partial solutions are used in the algorithm. Various bounding techniques, including Lagrangean and surrogate relaxations, are investigated and compared. 相似文献
456.
A computationally feasible matrix method is presented to find the first-passage probabilities in a Markov chain where a set of states is taboo during transit. This concept has been used to evaluate the reliability of a system whose changes in strength can be thought of as a Markov chain, while the environment in which it is functioning generates stresses which can also be envisaged as another Markov chain. 相似文献
457.
The notions of minimax paths, trees, and cut sets are defined for undirected graphs; and relationships between these entities are established. Simple solution procedures based on these relationships are presented. 相似文献
458.
459.
This paper represents a continuation of three previous papers [1-.3] in the study of competitive bidding processes. It treats the case where a bidder's knowledge of his competitor's cost i s given by a probability distribution over a certain interval. The results obtained extend the work of Vickrey [4] to the case where the cost intervals a r e not necessarily symmetric. 相似文献
460.
The Tactical Warfare Simulation Program is a procedure by which the major interactions among opposing military units and terrain features can be treated in a tactical limited warfare situation. It is a critical-area, sequence-of-event model and is programmed in SIM-SCRIPT. In this program a military unit is described by such properties as strength, size, location, velocity, and attrition rates. Some of the events which can occur to a military unit are entering/leaving terrain features, becoming engaged/disengaged with opposing units, retreating, reaching an objective, and breaking. Following a discussion of the general features of the program, a study of a hypothetical war is presented. 相似文献