全文获取类型
收费全文 | 341篇 |
免费 | 16篇 |
出版年
2021年 | 11篇 |
2020年 | 3篇 |
2019年 | 10篇 |
2018年 | 5篇 |
2017年 | 6篇 |
2016年 | 8篇 |
2015年 | 7篇 |
2014年 | 6篇 |
2013年 | 48篇 |
2011年 | 6篇 |
2010年 | 3篇 |
2009年 | 9篇 |
2007年 | 8篇 |
2006年 | 3篇 |
2005年 | 5篇 |
2004年 | 9篇 |
2003年 | 5篇 |
2002年 | 9篇 |
2001年 | 8篇 |
2000年 | 5篇 |
1999年 | 10篇 |
1998年 | 5篇 |
1997年 | 4篇 |
1996年 | 3篇 |
1995年 | 8篇 |
1994年 | 5篇 |
1993年 | 5篇 |
1992年 | 8篇 |
1991年 | 12篇 |
1990年 | 6篇 |
1989年 | 6篇 |
1988年 | 10篇 |
1987年 | 8篇 |
1986年 | 8篇 |
1984年 | 7篇 |
1983年 | 3篇 |
1981年 | 7篇 |
1980年 | 3篇 |
1979年 | 6篇 |
1978年 | 5篇 |
1977年 | 7篇 |
1975年 | 3篇 |
1974年 | 5篇 |
1973年 | 4篇 |
1972年 | 3篇 |
1971年 | 6篇 |
1969年 | 4篇 |
1968年 | 5篇 |
1966年 | 2篇 |
1948年 | 2篇 |
排序方式: 共有357条查询结果,搜索用时 46 毫秒
11.
In the temporarily isolated situation in which a warship finds itself during a mission. not only spare parts, but also “spare” crewmen in various categories of specialization must he on board. Mathematical models for the probabilities of mission survival for personnel and for personnel and materiel jointly are proposed. A practical example is worked out: the optimal allocation of spare crewmen to different categories of specialization is calculated. 相似文献
12.
Sufficient conditions are given for stochastic comparison of two alternating renewal processes based on the concept of uniformization. The result is used to compare component and system performance processes in maintained reliability systems. 相似文献
13.
M. K. Rajaraman 《海军后勤学研究》1977,24(3):473-481
The problem of sequencing jobs on parallel processors when jobs have different available times, due dates, penalty costs and waiting costs is considered. The processors are identical and are available when the earliest job becomes available and continuously thereafter. There is a processor cost during the period when the processor is available for processing jobs. The proposed algorithm finds the sequence (or sequences) with minimum total cost (sum of waiting, penalty and processor costs.). A proof of the algorithm and numerical results are given. 相似文献
14.
This article analyzes a one-to-one ordering perishable inventory model with renewal demands and exponential lifetimes. The leadtimes are independently and exponentially distributed and the demands that occur during stock out periods are lost. Although the items are assumed to decay at a constant rate, the output process is not renewal and the Markov renewal techniques are successfully employed to obtain the operating characteristics. The problem of minimizing the long run expected cost rate is discussed and numerical values of optimal stock level are also provided. © 1996 John Wiley & Sons, Inc. 相似文献
15.
This article develops a robust, exact algorithm for the maximal covering problem (MCP) using dual-based solution methods and greedy heuristics in branch and bound. Based on tests using randomly generated problems with problem parameters similar to those in the existing literature, the hybrid approach developed in this work appears to be effective over a wide range of MCP model parameters. The method is further validated on problems constructed from three real-world data sets. The extensive computational study compares the new method with other existing exact methods using problems that are as big, or larger than, those used in previous work on MCP. The results show that the proposed method is effective in most instances of MCP. In particular, it is shown that bounding schemes using Lagrangian relaxation are effective on MCP as a method of obtaining both exact and heuristic solutions. © 1996 John Wiley & Sons, Inc. 相似文献
16.
We consider a one-machine scheduling problem with earliness and tardiness penalties. All jobs are assigned a common due date and the objective is to minimize the total penalty due to job earliness and tardiness. We are interested in finding the optimal combination of the common due-date value and the job sequence. Despite the fact that this problem in general is very hard to solve, we prove that there exists at least a common property for all optimal solutions: The first job in an optimal sequence is one of the longest jobs. We also prove that this property holds for a general class of unimodal penalty functions. 相似文献
17.
Boland, Proschan, and Tong [2] used the notion of criticality of nodes in a coherent system to study the optimal component arrangement of reliability structures. They also provided a sufficient minimal cut (path) based criterion for verifying the criticality ordering of two nodes. We develop a necessary and sufficient condition for two nodes to be comparable and provide specific examples illustrating our result's applicability. As a corollary, certain optimal arrangement properties of well-known systems are derived. © 1994 John Wiley & Sons, Inc. 相似文献
18.
Let Yi ∽ N(θi, σ), i = 1, …, p, be independently distributed, where θi and σ are unknown. A Bayesian approach is used to estimate the first two moments of the minimum order statistic, W = min (Y1, …, Yp). In order to compute the Bayes estimates, one has to evaluate the predictive densities of the Yi's conditional on past data. Although the required predictive densities are complicated in form, an efficient algorithm to calculate them has been developed and given in the article. An application of the Bayesian method in a continuous-review control model with multiple suppliers is discussed. © 1994 John Wiley & Sons, Inc. 相似文献
19.
20.
Let p(⩾0.5) denote the probability that team A beats B in a single game. The series continues until either A or B wins n games. Assuming that these games are independent replications, we study some features of the distribution of Xn, the number of games played in the series. It is shown that Xn is unimodal, has an IFRA distribution, and is stochastically decreasing in p. Close approximations to its mode, mean, and variance are given. Finally, it is shown that the maximum-likelihood estimator of p based on Xn is unique. 相似文献