全文获取类型
收费全文 | 582篇 |
免费 | 14篇 |
出版年
2021年 | 11篇 |
2019年 | 24篇 |
2018年 | 12篇 |
2017年 | 16篇 |
2016年 | 12篇 |
2015年 | 12篇 |
2014年 | 14篇 |
2013年 | 137篇 |
2009年 | 6篇 |
2008年 | 5篇 |
2007年 | 6篇 |
2006年 | 5篇 |
2005年 | 9篇 |
2004年 | 8篇 |
2003年 | 6篇 |
2002年 | 7篇 |
2001年 | 5篇 |
2000年 | 9篇 |
1998年 | 11篇 |
1997年 | 16篇 |
1996年 | 9篇 |
1995年 | 5篇 |
1994年 | 11篇 |
1993年 | 4篇 |
1992年 | 7篇 |
1991年 | 13篇 |
1990年 | 5篇 |
1989年 | 9篇 |
1988年 | 9篇 |
1987年 | 16篇 |
1986年 | 10篇 |
1985年 | 8篇 |
1984年 | 5篇 |
1983年 | 8篇 |
1982年 | 9篇 |
1981年 | 5篇 |
1980年 | 7篇 |
1979年 | 11篇 |
1978年 | 7篇 |
1977年 | 9篇 |
1976年 | 8篇 |
1975年 | 7篇 |
1974年 | 7篇 |
1973年 | 12篇 |
1972年 | 6篇 |
1971年 | 7篇 |
1970年 | 8篇 |
1969年 | 7篇 |
1968年 | 6篇 |
1967年 | 8篇 |
排序方式: 共有596条查询结果,搜索用时 15 毫秒
581.
M. J. Fischer 《海军后勤学研究》1978,25(4):667-679
In this paper, we consider the analysis of two M/G/1 queueing systems sharing the same finite waiting room. An exact analysis is given for several special cases, and then an algorithm is developed which approximates the system behavior for the general problem. Comparisons are made between the special cases and the algorithm. 相似文献
582.
A new approach is presented for analyzing multiple-attribute decision problems in which the set of actions is finite and the utility function is additive. The problem can be resolved if the decision makers (or group of decision makers) specifies a set of nonnegative weights for the various attributes or criteria, but we here assume that the decision maker(s) cannot provide a numerical value for each such weight. Ordinal information about these weights is therefore obtained from the decision maker(s), and this information is translated into a set of linear constraints which restrict the values of the weights. These constraints are then used to construct a polytope W of feasible weight vectors, and the subsets Hi (polytopes) of W over which each action ai has the greatest utility are determined. With the Comparative Hypervolume Criterion we calculate for each action the ratio of the hypervolume of Hi to the hypervolume of W and suggest the choice of an action with the largest such ratio. Justification of this choice criterion is given, and a computational method for accurately approximating the hypervolume ratios is described. A simple example is provided to evaluate the efficiency of a computer code developed to implement the method. 相似文献
583.
Peter J. Kolesar 《海军后勤学研究》1967,14(3):317-327
Several problems in the assignment of parallel redundant components to systems composed of elements subject to failure are considered. In each case the problem is to make an assignment which maximizes the system reliability subject to system constraints. Three distinct problems; are treated. The first is the classical problem of maximizing system reliability under total cost or weight constraints when components are subject to a single type of failure. The second problem deals with components which are subject to two types of failure and minimizes the probability of one mode of system failure subject to a constraint on the probability of the other mode of system failure. The third problem deals with components which may either fail to operate or may operate prematurely. System reliability is maximized subject to a constraint ori system safety. In each case the problem is formulated as an integer linear program. This has an advantage over alternative dynamic programming formulations in that standard algorithms may be employed to obtain numerical results. 相似文献
584.
Sean M. Evans 《Low Intensity Conflict & Law Enforcement》2005,13(3):262-279
This paper underscores the theory that efficacious law enforcement intelligence addresses current problems of criminal insurgency including acts of terrorism, asymmetric warfare and low intensity conflict, and suggests possible solutions. By introducing the notion of crime as insurgency, a new paradigm may be developed that could assist practitioners and academics alike in analyzing, solving and managing crime. By shifting the perspective for both military and civilian forces from their traditionally reactive stance, to a proactive posture, and merging national security with homeland defense on the most perplexing issues and threats facing US security, this work may provide a base upon which new and actionable policies can be designed. Public administrators must take seriously the lessons from past failures. The single most important supposition being, sound policy is reliant upon good intelligence. 相似文献
585.
This paper addresses a two‐machine open shop scheduling problem, in which the machines are not continuously available for processing. The processing of an operation affected by a non‐availability interval can be interrupted and resumed later. The objective is to minimize the makespan. We present two polynomial‐time approximation schemes, one of which handles the problem with one non‐availability interval on each machine and the other for the problem with several non‐availability intervals on one of the machines. Problems with a more general structure of the non‐availability intervals are not approximable in polynomial time within a constant factor, unless . © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
586.
We apply dynamic proximity calculations (density and clustering) from dynamic computational geometry to a military application. The derived proximity information serves as an abstract view of a current situation in the battlefield that can help a military commander achieve situation awareness. We employ Delaunay triangulation as a computational tool in our framework, and study its dynamic update in depth. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
587.
588.
589.
590.