全文获取类型
收费全文 | 563篇 |
免费 | 18篇 |
出版年
2021年 | 11篇 |
2019年 | 10篇 |
2018年 | 7篇 |
2017年 | 16篇 |
2016年 | 10篇 |
2015年 | 16篇 |
2014年 | 13篇 |
2013年 | 136篇 |
2011年 | 7篇 |
2009年 | 4篇 |
2008年 | 8篇 |
2007年 | 6篇 |
2006年 | 8篇 |
2005年 | 11篇 |
2004年 | 4篇 |
2003年 | 4篇 |
2002年 | 7篇 |
2001年 | 6篇 |
2000年 | 6篇 |
1999年 | 7篇 |
1998年 | 10篇 |
1997年 | 10篇 |
1996年 | 8篇 |
1995年 | 10篇 |
1994年 | 12篇 |
1993年 | 11篇 |
1992年 | 12篇 |
1991年 | 12篇 |
1990年 | 4篇 |
1989年 | 10篇 |
1988年 | 18篇 |
1987年 | 10篇 |
1986年 | 16篇 |
1985年 | 11篇 |
1984年 | 6篇 |
1983年 | 7篇 |
1982年 | 4篇 |
1981年 | 11篇 |
1980年 | 6篇 |
1979年 | 12篇 |
1978年 | 7篇 |
1977年 | 7篇 |
1975年 | 12篇 |
1974年 | 7篇 |
1973年 | 6篇 |
1972年 | 7篇 |
1971年 | 5篇 |
1970年 | 6篇 |
1969年 | 6篇 |
1966年 | 4篇 |
排序方式: 共有581条查询结果,搜索用时 0 毫秒
511.
This article presents models for determining the optimum number of Red weapons required to win a heterogeneous combat in which m(m> 1) types of Red weapons face a single type of Blue weapon under a newly defined termination policy. Red aims at either minimizing the total cost or maximizing the aggregated remaining force strength. Kuhn-Tucker and simulated annealing techniques are used for obtaining the optimal solution. The methodology is illustrated by analysing heterogeneous combat to determine (i) the feasibility of introducing new types of weapons and (ii) the number of weapons required to win if a specific type of weapon, say infantry, dominates. © 1995 John Wiley & Sons, Inc. 相似文献
512.
We introduce an algorithm, called TMO (Two-Machine Optimal Scheduling) which minimizes the makespan for two identical processors. TMO employs lexicographic search in conjunction with the longest-processing time sequence to derive an optimal schedule. For the m identical parallel processors problem, we propose an improvement algorithm, which improves the seed solution obtained by any existing heuristic. The improvement algorithm, called Extended TMO, breaks the original m-machine problem into a set of two-machine problems and solves them repeatedly by the TMO. A simulation study is performed to evaluate the effectiveness of the proposed algorithms by comparing it against three existing heuristics: LPT (Graham, [11]), MULTIFIT (Coffman, Garey, and Johnson, [6]), and RMG (Lee and Massey, [17]). The simulation results show that: for the two processors case, the TMO performs significantly better than LPT, MULTIFIT, and RMG, and it generally takes considerably less CPU time than MULTIFIT and RMG. For the general parallel processors case, the Extended TMO algorithm is shown to be capable of greatly improving any seed solution. © 1995 John Wiley & Sons, Inc. 相似文献
513.
Michael A. Trick 《海军后勤学研究》1992,39(2):137-151
We examine the basis structure of the linear relaxation of the generalized assignment problem. The basis gives a surprising amount of information. This leads to a very simple heuristic that uses only generalized network optimization codes. Lower bounds can be generated by cut generation, where the violated inequalities are found directly from the relaxation basis. An improvement heuristic with the same flavor is also presented. 相似文献
514.
We consider a device that deteriorates over time according to a Markov process so that the failure rate at each state is constant. The reliability of the device is characterized by a Markov renewal equation, and an IFRA (increasing failure rate on average) property of the lifetime is obtained. The optimal replacement and repair problems are analyzed under various cost structures. Furthermore, intuitive and counterintuitive characterizations of the optimal policies and results on some interesting special problems are presented. © 1992 John Wiley & Sons, Inc. 相似文献
515.
We present an algorithm called the exact ceiling point algorithm (XCPA) for solving the pure, general integer linear programming problem (P). A recent report by the authors demonstrates that, if the set of feasible integer solutions for (P) is nonempty and bounded, all optimal solutions for (P) are “feasible 1-ceiling points,” roughly, feasible integer solutions lying on or near the boundary of the feasible region for the LP-relaxation associated with (P). Consequently, the XCPA solves (P) by implicitly enumerating only feasible 1-ceiling points, making use of conditional bounds and “double backtracking.” We discuss the results of computational testing on a set of 48 problems taken from the literature. 相似文献
516.
The bivariate negative binomial distribution of Mitchell and Paulson [17] for the case b = c = 0 is shown to be equivalent to the accident proneness model of Edwards and Gurland [4] and Subrahmaniam [19,20]. The diagonal series expansion of its joint probability function is then derived. Two other formulations of this distribution are also considered: (i) as a mixture model, which showed how it arises as the discrete analogue to the Wicksell-Kibble bivariate gamma distribution, and (ii) as a consequence of the linear birth-and-death process with immigration. 相似文献
517.
This article generalizes the classical dichotomic reliability model to include states of partial operation. The generalized model can be considered as a special case of a general jump process. Both continuous and discrete state spaces are included. The relationship to cumulative damage shock models is discussed. Properties of the model are investigated and these are illustrated via examples. The equivalence of three forms of component independence is proved, but this equivalence does not generalize to the property of zero covariance. Alternative forms of series and parallel connections and the effect of component replacement are discussed. 相似文献
518.
519.
520.
Consider the following situation: Each of N different combat units is presented with a number of requirements to satisfy, each requirement being classified into one of K mutually exclusive categories. For each unit and each category, an estimate of the probability of that unit satisfying any requirement in that category is desired. The problem can be generally stated as that of estimating N different K-dimensional vectors of probabilities based upon a corresponding set of K-dimensional vectors of sample proportions. An empirical Bayes model is formulated and applied to an example from the Marine Corps Combat Readiness Evaluation System (MCCRES). The EM algorithm provides a convenient method of estimating the prior parameters. The Bayes estimates are compared to the ordinary estimates, i.e., the sample proportions, by means of cross validation, and the Bayes estimates are shown to provide considerable improvement. 相似文献