全文获取类型
收费全文 | 411篇 |
免费 | 9篇 |
出版年
2021年 | 4篇 |
2019年 | 7篇 |
2018年 | 11篇 |
2017年 | 8篇 |
2016年 | 11篇 |
2014年 | 7篇 |
2013年 | 105篇 |
2011年 | 3篇 |
2010年 | 6篇 |
2009年 | 5篇 |
2008年 | 4篇 |
2006年 | 4篇 |
2005年 | 8篇 |
2004年 | 4篇 |
2003年 | 6篇 |
2002年 | 9篇 |
2001年 | 4篇 |
2000年 | 6篇 |
1999年 | 5篇 |
1998年 | 3篇 |
1997年 | 8篇 |
1996年 | 4篇 |
1995年 | 4篇 |
1994年 | 6篇 |
1993年 | 12篇 |
1992年 | 6篇 |
1991年 | 7篇 |
1990年 | 3篇 |
1989年 | 6篇 |
1988年 | 11篇 |
1987年 | 9篇 |
1986年 | 9篇 |
1985年 | 10篇 |
1984年 | 10篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 3篇 |
1980年 | 5篇 |
1979年 | 6篇 |
1978年 | 9篇 |
1977年 | 6篇 |
1976年 | 4篇 |
1974年 | 9篇 |
1972年 | 5篇 |
1971年 | 10篇 |
1970年 | 5篇 |
1969年 | 7篇 |
1968年 | 3篇 |
1967年 | 3篇 |
1966年 | 2篇 |
排序方式: 共有420条查询结果,搜索用时 15 毫秒
161.
162.
Finite Markov processes are considered, with bidimensional state space, such that transitions from state (n, i) to state (m, j) are possible only if m ≤ n + 1. The analysis leads to efficient computational algorithms, to determine the stationary probability distribution, and moments of first passage times. 相似文献
163.
164.
The joint problems of determining the optimal plant location and optimal input mix and plant size are addressed. The interrelationship between input substitutability and plant location is stressed. Conditions under which the location problem can be separated from the determination of the optimal input mix are developed for a number of problem variations. The stability of the optimal location in the face of changes in problem parameters is also discussed. It is demonstrated that consideration of input substitutability often makes the resulting problem no more difficult to solve than problem formulations in which the inherent input substitutability is ignored. 相似文献
165.
166.
167.
A model is developed taking into consideration all the costs (namely cost of sampling, cost of not detecting a change in the process, cost of a false indication of change, and the cost of readjusting detected changes) incurred when a production process, using an unscheduled setup policy, utilizes fraction-defective control charts to control current production. The model is based on the concept of the expected time between detection of changes calling for setups. It is shown that the combination of unscheduled setups and control charts can be utilized in an optimal way if those combinations of sample size, sampling interval, and extent of control limits from process average are used that provide the minimum expected total cost per unit of time. The costs of a production process that uses unscheduled setups in conjunction with the appropriate optimal control charts are compared to the costs of a production process that uses scheduled setups at optimum intervals in conjunction with its appropriate control charts. This comparison indicates the criteria for selecting production processes with scheduled setups using optimal setup intervals over unscheduled setups. Suggestions are made to evaluate the optimal process setup strategy and the accompanying optimal decision parameters, for any specific cost data, by use of computer enumeration. A numerical example for assumed cost and process data is provided. 相似文献
168.
The minimum-cost formulation of the problem of determining multicommodity flows over a capacitated network subject to resource constraints has been treated in previobs papers. In those treatments only capacitated arcs were assumed and a uniform unit of measure like short tons was used for all commodities. This paper treats the effect of constraints on the nodes of the network, allows the commodities to be measured in their “natural” units and allows the network capacities to be expressed in vehicles per time period-in some cases giving a more accurate representation of the capacities of the network. This paper describes the solution procedure which uses the column generation technique; it also discusses computational experience. 相似文献
169.
Much work has been done in search theory; however, very little effort has occurred where an object's presence at a location can be accepted when no object is present there. The case analyzed is of this type. The number of locations is finite, a single object is stationary at one location, and only one location is observed each step of the search. The object's location has a known prior probability distribution. Also known are the conditional probability of acceptance given the object's absence (small) and the conditional probability of rejection given the object's presence (not too large); these Probabilities remain fixed for all searching and locations. The class of sequential search policies which terminate the search at the first acceptance is assumed. A single two-part optimization criterion is considered. The search sequence is found which (i) minimizes the probability of obtaining n rejections in the first n steps for all n, and (ii) maximizes the probability that the first acceptance occurs within the first n steps and occurs at the object's location for all n. The optimum sequential search policy specifies that the next location observed is one with the largest posterior probability of the object's presence (evaluated after each step from Bayes Rule) and that the object is at the first location where acceptance occurs. Placement at the first acceptance seems appropriate when the conditional probability of acceptance given the object's absence is sufficiently small. Search always terminates (with probability one). Optimum truncated sequential policies are also considered. Methods are given for evaluating some pertinent properties and for investigating the possibility that no object occurs at any location. 相似文献
170.