全文获取类型
收费全文 | 558篇 |
免费 | 17篇 |
专业分类
575篇 |
出版年
2021年 | 13篇 |
2019年 | 13篇 |
2018年 | 7篇 |
2017年 | 12篇 |
2016年 | 10篇 |
2015年 | 12篇 |
2014年 | 13篇 |
2013年 | 96篇 |
2010年 | 5篇 |
2008年 | 6篇 |
2006年 | 7篇 |
2005年 | 7篇 |
2004年 | 4篇 |
2003年 | 4篇 |
2002年 | 10篇 |
2001年 | 9篇 |
2000年 | 6篇 |
1999年 | 6篇 |
1998年 | 9篇 |
1997年 | 13篇 |
1996年 | 6篇 |
1995年 | 8篇 |
1994年 | 10篇 |
1993年 | 15篇 |
1992年 | 10篇 |
1991年 | 10篇 |
1989年 | 10篇 |
1988年 | 23篇 |
1987年 | 9篇 |
1986年 | 19篇 |
1985年 | 17篇 |
1984年 | 13篇 |
1983年 | 6篇 |
1982年 | 6篇 |
1981年 | 9篇 |
1980年 | 10篇 |
1979年 | 13篇 |
1978年 | 10篇 |
1977年 | 12篇 |
1976年 | 4篇 |
1975年 | 9篇 |
1974年 | 12篇 |
1973年 | 6篇 |
1972年 | 8篇 |
1971年 | 10篇 |
1970年 | 7篇 |
1969年 | 9篇 |
1968年 | 4篇 |
1967年 | 4篇 |
1966年 | 4篇 |
排序方式: 共有575条查询结果,搜索用时 6 毫秒
221.
Alex S. Wilner 《战略研究杂志》2013,36(1):3-37
This article argues that deterrence theory can be applied to counterterrorism. Doing so requires broadening the traditional concept of deterrence by punishment, expanding deterrence by denial to include defense, mitigation, and strategic hindrance, and developing deterrence by delegitimization to influence the political, ideological, and religious rationales informing terrorist behavior. In practice, deterring terrorism requires tailoring threats against state and individual facilitators, diffusing the intended consequences of terrorism, and manipulating terrorist self–restraints. When these and other deterrent leverages are applied simultaneously against various actors and processes involved in terrorism, coercion can be achieved. 相似文献
222.
Harold P. Benson 《海军后勤学研究》2006,53(4):309-317
The purpose of this article is to present an algorithm for globally maximizing the ratio of two convex functions f and g over a convex set X. To our knowledge, this is the first algorithm to be proposed for globally solving this problem. The algorithm uses a branch and bound search to guarantee that a global optimal solution is found. While it does not require the functions f and g to be differentiable, it does require that subgradients of g can be calculated efficiently. The main computational effort of the algorithm involves solving a sequence of subproblems that can be solved by convex programming methods. When X is polyhedral, these subproblems can be solved by linear programming procedures. Because of these properties, the algorithm offers a potentially attractive means for globally maximizing ratios of convex functions over convex sets. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
223.
This paper is a state-of-the-art review of the literature related to optimal maintenance models of systems subject to failure. The emphasis is on work appearing since the 1976 survey, “A Survey of Maintenance Models: The Control and Surveillance of Deteriorating Systems,” by W.P. Pierskalla and J.A. Voelker, published in this journal. 相似文献
224.
In this paper, we consider the problem of minimizing the mean flow time of jobs to be processed on two machines. The jobs have a predetermined order, perhaps reflecting the order of arrival, and each job has a known processing time. We wish to assign the jobs to machines so as to minimize the mean flow time, with the constraint that the original order must be preserved within the subset of jobs assigned to each machine. An efficient algorithm based on dynamic programming is developed. 相似文献
225.
The problem of determining the optimal inspection epoch is studied for reliability systems in which N components operate in parallel. Lifetime distribution is arbitrary, but known. The optimization is carried with respect to two cost factors: the cost of inspecting a component and the cost of failure. The inspection epochs are determined so that the expected cost of the whole system per time unit per cycle will be minimized. The optimization process depends in the general case on the whole failure history of the system. This dependence is characterized. The cases of Weibull lifetime distributions are elaborated and illustrated numerically. The characteristics of the optimal inspection intervals are studied theoretically. 相似文献
226.
Adaptive forecasting procedures are developed for predicting the size of a work force which is subject to random withdrawals. The procedures are illustrated using Marine Corps data in which four stages of service for incoming cohorts are distinguished. Using these data, three forecasting procedures—conditional maximum likelihood estimation of prediction intervals; tolerance intervals; and Bayes prediction intervals—are compared. 相似文献
227.
The most vital link in a single commodity flow network is that are whose removal results in the greatest reduction in the value of the maximal flow in the network between a source node and a sink node. This paper develops an iterative labeling algorithm to determine the most vital link in the network. A necessary condition for an are to be the most vital link is established and is employed to decrease the number of ares which must be considered. 相似文献
228.
The two inventory echelons under consideration are the depot, D, and k tender ships E1, …, Ek. The tender ships supply the demand for certain parts of operational boats (the customers). The statistical model assumes that the total monthly demands at the k tenders are stationary independent Poisson random variables, with unknown means λ1, …, λk. The stock levels on the tenders, at the heginning of each month, can be adjusted either by ordering more units from the depot, or by shipping bach to the depot an excess stock. There is no traffic of stock between tenders which is not via the depot. The lead time from the depot to the tenders is at most 1 month. The lead time for orders of the depot from the manufacturer is L months. The loss function due to erroneous decision js comprised of linear functions of the extra monthly stocks, and linear functions of shortages at the tenders and at the depot over the N months. A Bayes sequential decision process is set up for the optimal adjustment levels and orders of the two echelons. The Dynamic Programming recursive functions are given for a planning horizon of N months. 相似文献
229.
A linear programming formulation is described that will permit the optimal assignment of transportation resources (vehicles) and movement requirements to a network consisting of a set of designated origins, ports of embarkation, enroute bases, ports of debarkation, and destinations to achieve a prescribed schedule of arrivals. 相似文献
230.
Harold P. Benson 《海军后勤学研究》1985,32(1):165-177
We present a new algorithm for solving the problem of minimizing a nonseparable concave function over a polyhedron. The algorithm is of the branch-and-bound type. It finds a globally optimal extreme point solution for this problem in a finite number of steps. One of the major advantages of the algorithm is that the linear programming subproblems solved during the branch-and-bound search each have the same feasible region. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some preliminary computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several bilinear programming problems with the code. 相似文献