全文获取类型
收费全文 | 666篇 |
免费 | 20篇 |
出版年
2019年 | 14篇 |
2018年 | 8篇 |
2017年 | 12篇 |
2016年 | 9篇 |
2015年 | 12篇 |
2014年 | 10篇 |
2013年 | 112篇 |
2010年 | 7篇 |
2009年 | 7篇 |
2008年 | 7篇 |
2007年 | 7篇 |
2004年 | 11篇 |
2003年 | 9篇 |
2002年 | 8篇 |
2001年 | 10篇 |
2000年 | 8篇 |
1999年 | 7篇 |
1998年 | 12篇 |
1997年 | 13篇 |
1996年 | 14篇 |
1995年 | 15篇 |
1994年 | 15篇 |
1993年 | 14篇 |
1992年 | 17篇 |
1991年 | 18篇 |
1990年 | 10篇 |
1989年 | 12篇 |
1988年 | 16篇 |
1987年 | 15篇 |
1986年 | 9篇 |
1985年 | 14篇 |
1984年 | 15篇 |
1983年 | 8篇 |
1982年 | 9篇 |
1981年 | 14篇 |
1980年 | 14篇 |
1979年 | 14篇 |
1978年 | 11篇 |
1977年 | 9篇 |
1976年 | 11篇 |
1975年 | 13篇 |
1974年 | 11篇 |
1973年 | 8篇 |
1972年 | 12篇 |
1971年 | 12篇 |
1970年 | 7篇 |
1969年 | 8篇 |
1968年 | 10篇 |
1967年 | 9篇 |
1966年 | 8篇 |
排序方式: 共有686条查询结果,搜索用时 225 毫秒
551.
This study examines critically the various assumptions, results, and concepts that exist to date in the literature and scientific community concerning the relationships among the Lanchester, stochastic Lanchester, and the general renewal models of combat. Many of the prevailing understandings are shown to be erroneous. 相似文献
552.
A mathematical formulation of an optimization model designed to select projects for inclusion in an R&D portfolio, subject to a wide variety of constraints (e.g., capital, headcount, strategic intent, etc.), is presented. The model is similar to others that have previously appeared in the literature and is in the form of a mixed integer programming (MIP) problem known as the multidimensional knapsack problem. Exact solution of such problems is generally difficult, but can be accomplished in reasonable time using specialized algorithms. The main contribution of this paper is an examination of two important issues related to formulation of project selection models such as the one presented here. If partial funding and implementation of projects is allowed, the resulting formulation is a linear programming (LP) problem which can be solved quite easily. Several plausible assumptions about how partial funding impacts project value are presented. In general, our examples suggest that the problem might best be formulated as a nonlinear programming (NLP) problem, but that there is a need for further research to determine an appropriate expression for the value of a partially funded project. In light of that gap in the current body of knowledge and for practical reasons, the LP relaxation of this model is preferred. The LP relaxation can be implemented in a spreadsheet (even for relatively large problems) and gives reasonable results when applied to a test problem based on GM's R&D project selection process. There has been much discussion in the literature on the topic of assigning a quantitative measure of value to each project. Although many alternatives are suggested, no one way is universally accepted as the preferred way. There does seem to be general agreement that all of the proposed methods are subject to considerable uncertainty. A systematic way to examine the sensitivity of project selection decisions to variations in the measure of value is developed. It is shown that the solution for the illustrative problem is reasonably robust to rather large variations in the measure of value. We cannot, however, conclude that this would be the case in general. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 18–40, 2001 相似文献
553.
T identical exponential lifetime components out of which G are initially functioning (and B are not) are to be allocated to N subsystems, which are connected either in parallel or in series. Subsystem i, i = 1,…, N, functions when at least Ki of its components function and the whole system is maintained by a single repairman. Component repair times are identical independent exponentials and repaired components are as good as new. The problem of the determination of the assembly plan that will maximize the system reliability at any (arbitrary) time instant t is solved when the component failure rate is sufficiently small. For the parallel configuration, the optimal assembly plan allocates as many components as possible to the subsystem with the smallest Ki and allocates functioning components to subsystems in increasing order of the Ki's. For the series configuration, the optimal assembly plan allocates both the surplus and the functioning components equally to all subsystems whenever possible, and when not possible it favors subsystems in decreasing order of the Ki's. The solution is interpreted in the context of the optimal allocation of processors and an initial number of jobs in a problem of routing time consuming jobs to parallel multiprocessor queues. © John Wiley & Sons, Inc. Naval Research Logistics 48: 732–746, 2001 相似文献
554.
An efficient algorithm for determining the optimal arrival schedule for customers in a stochastic service system is developed. All customers arrive exactly when scheduled, and service times are modeled as iid Erlang random variables. Costs are incurred at a fixed rate per unit of time each customer waits for service, and an additional cost is incurred for every unit of time the server operates beyond a scheduled closing time. The objective is to minimize total operating cost. This type of problem arises in many operational contexts including transportation, manufacturing, and appointment‐based services. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 549–559, 1999 相似文献
555.
556.
In clinical circles, the concept of “moral injury” has rapidly gained traction. Yet, from a moral philosophical point of view the concept is less clear than is suggested. That is, in current conceptualizations of moral injury, trauma’s moral dimension seems to be understood in a rather mechanistic and individualized manner. This article makes a start in developing an adequately founded conceptualization of the role of morality in deployment-related distress. It does so by reviewing and synthesizing insights from different disciplines into morality and trauma. This discussion will lead to three positions: (1) values and norms are by definition characterized by conflict, (2) moral conflict may entail important social dimensions, and (3) moral conflict may lead to altered beliefs about previously held values. These insights provide important steps in further developing conceptions of the role of morality in deployment-related suffering. 相似文献
557.
558.
We consider stochastic scheduling models which have the natural character that jobs improve while being processed, but deteriorate (and may possibly leave the system altogether) while processing is diverted elsewhere. Such restless bandit problems are shown to be indexable in the sense of Whittle. A numerical study which elucidates the strong performance of the resulting index policy is complemented by a theoretical study which demonstrates the optimality of the index policy under given conditions and which develops performance guarantees for the index heuristic more generally. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 706–721, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10036 相似文献
559.
560.
Peter C. Fishburn 《海军后勤学研究》1988,35(6):567-574
It is shown that when X is an arbitrary finite subset of an n-factor product set and preference relations on each factor or criterion are assumed only to be asymmetric, efficient (undominated) points always exist in the set P of probability distributions on X when the preference relations are extended to probability distributions on the factors according to SSB utility theory. Thus, arbitrary finite structures and potentially cyclic preferences do not present a problem for the theory of efficiency under the convexification-extension procedure. 相似文献