全文获取类型
收费全文 | 741篇 |
免费 | 18篇 |
出版年
2021年 | 11篇 |
2019年 | 15篇 |
2018年 | 8篇 |
2017年 | 19篇 |
2016年 | 13篇 |
2015年 | 14篇 |
2014年 | 18篇 |
2013年 | 134篇 |
2012年 | 7篇 |
2010年 | 10篇 |
2009年 | 17篇 |
2007年 | 11篇 |
2006年 | 10篇 |
2005年 | 11篇 |
2004年 | 16篇 |
2002年 | 17篇 |
2001年 | 9篇 |
2000年 | 11篇 |
1999年 | 7篇 |
1998年 | 15篇 |
1997年 | 9篇 |
1996年 | 9篇 |
1995年 | 11篇 |
1994年 | 17篇 |
1993年 | 16篇 |
1992年 | 11篇 |
1991年 | 18篇 |
1990年 | 12篇 |
1989年 | 19篇 |
1988年 | 20篇 |
1987年 | 20篇 |
1986年 | 20篇 |
1985年 | 12篇 |
1984年 | 13篇 |
1983年 | 9篇 |
1982年 | 8篇 |
1981年 | 11篇 |
1980年 | 7篇 |
1979年 | 11篇 |
1978年 | 15篇 |
1977年 | 6篇 |
1976年 | 8篇 |
1975年 | 8篇 |
1974年 | 10篇 |
1973年 | 11篇 |
1972年 | 11篇 |
1971年 | 6篇 |
1970年 | 11篇 |
1969年 | 8篇 |
1967年 | 6篇 |
排序方式: 共有759条查询结果,搜索用时 15 毫秒
711.
This paper models a k-unit service system (e.g., a repair, maintenance, or rental facility) with Poisson arrivals, exponential service times, and no queue. If we denote the number of units that are busy as the state of the system, the state-dependent pricing model formalizes the intuitive notion that when most units are idle, the price (i.e., the service charge per unit time) should be low, and when most units are busy, the price should be higher than the average. A computationally efficient algorithm based on a nonlinear programming formulation of the problem is provided for determination of the optimal state-dependent prices. The procedure ultimately reduces to the search on a single variable in an interval to determine the unique intersection point of a concave increasing function and a linear decreasing function. The algorithm takes, on the average, only about 1/2 second per problem on the IBM 360/65 (FORTRAN G Compiler). A discrete optimal-control approach to the problem is shown to result in essentially the same procedure as the nonlinear-programming formulation. Several properties of the optimal state-dependent prices are given. Comparisons of the optimal values of the objective function for the state-dependent and state-independent pricing policies show that the former is on the average, only about 0.7% better than the latter, which may explain partly why state-dependent pricing is not prevalent in many service systems. Potential generalizations of the model are discussed. 相似文献
712.
713.
K. M. Mjelde 《海军后勤学研究》1977,24(4):639-650
The paper describes an approach to the evaluation of the effectiveness of a minefield in terms of the number of mines that are detonated by a convoy of sweepers and ships and the corresponding number of vessels that are immobilized. The positions of the mines and the tracks of the vessels are assumed to be known, which means that the evaluation measures are dependent on a large number of disjoint events, each event being the immobilization of particular vessels by particular mines. This may render combinatorial methods computationally infeasible, but by introducing approximations in the assumptions, the difficulty can be overcome, specifically by modelling the arrival of each individual vessel in the neighborhood of a mine by an inhomogeneous Poisson stream for which the arrival rate is nonzero only over a short time interval. The plausibility of the approach is supported by results of a critical-event simulation model. 相似文献
714.
This paper presents a simple algorithm for finding the number of restricted k-partitions of a natural number n. The unrestricted k-partitions of n are expressed as the sum of these restricted k-partitions, called inadmissible, and the admissible k-partitions. The simplicity of the algorithm is striking, though all the implications are unclear. 相似文献
715.
The stochastic duel is extended to include the possibility of a near-miss on each round fired, which causes the opponent to displace. During displacement, the displacing contestant cannot return the fire but is still a target for his opponent. An alternative interpretation of this model is to consider the displacement time as the time a contestant's fire is suppressed by his opponent's fire and that he does not move, but merely ceases fire temporarily. All times are exponentially distributed. 相似文献
716.
An important class of network flow problems is that class for which the objective is to minimize the cost of the most expensive unit of flow while obtaining a desired total flow through the network. Two special cases of this problem have been solved, namely, the bottleneck assignment problem and time-minimizing transportation problem. This paper addresses the more general case which we shall refer to as the time-minimizing network flow problem. Associated with each arc is an arc capacity (static) and a transferral time. The objective is to find a maximal flow for which the length (in time) of the longest path carrying flow is minimized. The character of the problem is discussed and a solution algorithm is presented. 相似文献
717.
This paper discusses situations in which the distribution of a lifetime response variable T is taken to depend upon a vector x of regressor variables. We specifically consider the case in which T, given x , has an exponential distribution, and in which x represents levels of fixed factors in an experimental design. Methods of analyzing data under this type of model are discussed, with maximum likelihood and least squares methods being presented and compared. 相似文献
718.
An efficient auxiliary algorithm for solving transportation problems, based on a necessary but not sufficient condition for optimum, is presented. 相似文献
719.
Behram J. Hansotia 《海军后勤学研究》1980,27(2):257-272
We consider here stochastic linear programs with simple recourse when all the elements of the technology matrix and the resource vector have certain specific distributions. The distributions considered are the Normal, Exponential and Erlang. For the first two instances we extend the equivalent deterministic program to include the variance of the recourse. Finally, a simple example is given to illustrate the application of the formulas for the Erlang case. 相似文献
720.
During basis reinversion of either a product form or elimination form linear programming system, it may become necessary to swap spike columns to effect the reinversion and maintain the desired sparsity characteristics. This note shows that the only spikes which need be examined when an interchange is required are those not yet processed in the current external bump. 相似文献