全文获取类型
收费全文 | 74篇 |
免费 | 0篇 |
出版年
2021年 | 1篇 |
2019年 | 1篇 |
2018年 | 1篇 |
2017年 | 1篇 |
2015年 | 1篇 |
2014年 | 2篇 |
2013年 | 21篇 |
2008年 | 1篇 |
2006年 | 2篇 |
2005年 | 1篇 |
2004年 | 2篇 |
2003年 | 2篇 |
2000年 | 1篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1996年 | 2篇 |
1994年 | 1篇 |
1991年 | 1篇 |
1989年 | 2篇 |
1988年 | 4篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1983年 | 2篇 |
1982年 | 3篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1978年 | 1篇 |
1977年 | 5篇 |
1976年 | 1篇 |
1973年 | 1篇 |
1970年 | 1篇 |
1969年 | 1篇 |
1968年 | 1篇 |
排序方式: 共有74条查询结果,搜索用时 46 毫秒
51.
We consider the component testing problem of a system where the main feature is that the component failure rates are not constant parameters, but they change in a dynamic fashion with respect to time. More precisely, each component has a piecewise-constant failure-rate function such that the lifetime distribution is exponential with a constant rate over local intervals of time within the overall mission time. There are several such intervals, and the rates change dynamically from one interval to another. We note that these lifetime distributions can also be used in a more general setting to approximate arbitrary lifetime distributions. The optimal component testing problem is formulated as a semi-infinite linear program. We present an algorithmic procedure to compute optimal test times based on the column-generation technique and illustrate it with a numerical example. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 187–197, 1997 相似文献
52.
We describe a modification of Brown's fictitious play method for solving matrix (zero-sum two-person) games and apply it to both symmetric and general games. If the original game is not symmetric, the basic idea is to transform the given matrix game into an equivalent symmetric game (a game with a skew-symmetric matrix) and use the solution properties of symmetric games (the game value is zero and both players have the same optimal strategies). The fictitious play method is then applied to the enlarged skew-symmetric matrix with a modification that calls for the periodic restarting of the process. At restart, both players' strategies are made equal based on the following considerations: Select the maximizing or minimizing player's strategy that has a game value closest to zero. We show for both symmetric and general games, and for problems of varying sizes, that the modified fictitious play (MFP) procedure approximates the value of the game and optimal strategies in a greatly reduced number of iterations and in less computational time when compared to Brown's regular fictitious play (RFP) method. For example, for a randomly generated 50% dense skew-symmetric 100 × 100 matrix (symmetric game), with coefficients |aij| ≤ 100, it took RFP 2,652,227 iterations to reach a gap of 0.03118 between the lower and upper bounds for the game value in 70.71 s, whereas it took MFP 50,000 iterations to reach a gap of 0.03116 in 1.70 s. Improved results were also obtained for general games in which the MFP solves a much larger equivalent symmetric game. © 1996 John Wiley & Sons, Inc. 相似文献
53.
I.D. Woodward 《海军后勤学研究》2003,50(5):515-529
This article further considers the two‐person continuous ambush game introduced by Ruckle. This article extends the work of Ruckle, Baston and Bostock, and Lee by considering the game for a general number of barriers. By supplanting optimal strategies from a discretized version of the game, we show that there always exists a value for the game, which, furthermore, can be found using linear programming techniques. Further to this, we show that the discrete ambush game considered by Garnaev has the same value as a continuous game, allowing many new results to be obtained in both games. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 515–529, 2003 相似文献
54.
We consider a generalized minmax programming problem, and establish, under certain weaker convexity assumptions, the Fritz John sufficient optimality conditions for such a problem. A dual program is introduced and using those optimality conditions duality theorems are proved relating the dual and the primal. Duality for the generalized fractional programming problem is considered as an application of the results proved. 相似文献
55.
This article studies a maintenance problem that is applicable for multidivision organizations on lessee-lessor relationships. It is assumed that the parties sign a contract for a fixed time period. Within the period, the lessor is allowed to use the equipment supplied by the lessee. The availability of the equipment that may suffer from breakdown depends on the preventive maintenance policy adopted by the lessor. The properties of this policy as well as other features of the problem are analyzed using a one-period model that takes into account the economic value of the contract as perceived by the lessor and the lessee. The optimal contracting arrangements are analyzed from the perspective of efficient risk sharing and incentive provisions. 相似文献
56.
We undertake inference for a stochastic form of the Lanchester combat model. In particular, given battle data, we assess the type of battle that occurred and whether or not it makes any difference to the number of casualties if an army is attacking or defending. Our approach is Bayesian and we use modern computational techniques to fit the model. We illustrate our method using data from the Ardennes campaign. We compare our results with previous analyses of these data by Bracken and Fricker. Our conclusions are somewhat different to those of Bracken. Where he suggests that a linear law is appropriate, we show that the logarithmic or linear‐logarithmic laws fit better. We note however that the basic Lanchester modeling assumptions do not hold for the Ardennes data. Using Fricker's modified data, we show that although his “super‐logarithmic” law fits best, the linear, linear‐logarithmic, and logarithmic laws cannot be ruled out. We suggest that Bayesian methods can be used to make inference for battles in progress. We point out a number of advantages: Prior information from experts or previous battles can be incorporated; predictions of future casualties are easily made; more complex models can be analysed using stochastic simulation techniques. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 541–558, 2000 相似文献
57.
Consider n jobs (J1, …, Jn), m working stations (M1, …, Mm) and λ linear resources (R1, …, Rλ). Job Ji consists of m operations (Oi1, …, Oim). Operation Oij requires Pk(i, j) units of resource Rk to be realized in an Mj. The availability of resource Rk and the ability of the working station Mh to consume resource Rk, vary over time. An operation involving more than one resource consumes them in constant proportions equal to those in which they are required. The order in which operations are realized is immaterial. We seek an allocation of the resources such that the schedule length is minimized. In this paper, polynomial algorithms are developed for several problems, while NP-hardness is demonstrated for several others. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 51–66, 1998 相似文献
58.
An economic sequential screening procedure is considered for limited failure populations in which defective items fail soon after they are put in operation and nondefective ones never fail during the technical life of the items. A cost model is constructed that involves screening test cost and external failure cost. A sequential scheme that minimizes the expected cost is derived from the solution of a dynamic programming formulation and the optimal decision at each stage is obtained in a closed form. © 1994 John Wiley & Sons, Inc. 相似文献
59.
Since the 1st oil crisis in 1973, the economies of sub-Saharan Africa have barely kept pace with their burgeoning populations. Women in Sub-Saharan Africa give birth more often than women in any other region of the world, with an average of more than 6.5 live births each. The region's natural increase average 2.5% a year in the 1960s, 2.7% in the 1970s, and in the mid-1980s, it is 3.1% per annum--a rate that will double the regions population in 22 years. National leaders in Sub-Saharan Africa were slow to consider population policy as a key component of the social and economic development effort. The neglect of population issues is reflected in the limited scope of public or private family planning programs in the sub-continent. Donor countries and institutions play an important role in developing the information base by providing technical training to government staff, supporting research, and disseminating information to a broad spectrum of political actors. Some examples of policy reconsiderations in Nigeria, Zambia, Liberia, and Niger are given. These countries are starting to give active consideration to population policies to reduce fertility and high rates of population growth by expanding family planning services, raising the age of marriage, improving the status of women, providing family-life education, and incorporating economic incentives for smaller families into the provision of social services. The highly centralized nature of African governments dictates that the acquiescence of the governmental elite must be obtained before any policy can take hold. Overall, high population growth rates in combination with a stagnating social and economic development effort throughout the region have provided the catalyst for a new look at Sub-Saharan Africa population policy. The ability of African nations to implement policies that reduce fertility is more open to question; no African nation has as yet done so, and the socioeconomics factors contributing to high fertility remain strong. 相似文献
60.
Charles I. Tiplitz 《海军后勤学研究》1973,20(2):367-375
Calculating the solution for a mixed integer linear programming problem has been problematic for any sizable dimension because of the time required. Accordingly, an improved method for the fixed charge problem is presented here. The method is a modification of a bounding technique first suggested by Balinski, and it exploits fully the ratio of costio-use, first described by Cooper and Drebes. It exploits those local properties which have global application so that enumeration is confined to those relatively few combinations which cannot be evaluated otherwise. 相似文献