全文获取类型
收费全文 | 557篇 |
免费 | 13篇 |
出版年
2021年 | 8篇 |
2020年 | 5篇 |
2019年 | 20篇 |
2018年 | 12篇 |
2017年 | 6篇 |
2016年 | 15篇 |
2015年 | 9篇 |
2014年 | 11篇 |
2013年 | 128篇 |
2011年 | 9篇 |
2009年 | 7篇 |
2008年 | 5篇 |
2007年 | 15篇 |
2005年 | 7篇 |
2004年 | 5篇 |
2003年 | 10篇 |
2002年 | 10篇 |
2001年 | 5篇 |
1999年 | 8篇 |
1998年 | 8篇 |
1997年 | 11篇 |
1996年 | 11篇 |
1995年 | 6篇 |
1994年 | 12篇 |
1993年 | 12篇 |
1992年 | 10篇 |
1990年 | 9篇 |
1989年 | 11篇 |
1988年 | 5篇 |
1987年 | 6篇 |
1986年 | 14篇 |
1985年 | 9篇 |
1984年 | 5篇 |
1983年 | 6篇 |
1982年 | 10篇 |
1981年 | 7篇 |
1980年 | 7篇 |
1979年 | 11篇 |
1978年 | 9篇 |
1977年 | 5篇 |
1976年 | 6篇 |
1975年 | 6篇 |
1974年 | 9篇 |
1973年 | 7篇 |
1972年 | 7篇 |
1971年 | 9篇 |
1970年 | 9篇 |
1969年 | 5篇 |
1967年 | 6篇 |
1948年 | 4篇 |
排序方式: 共有570条查询结果,搜索用时 46 毫秒
91.
Marc R. DeVore 《Defence and Peace Economics》2014,25(4):415-443
Budgetary pressures have driven a steady expansion of armaments collaboration projects internationally. This has also been the case in Europe where it is estimated that currently one-fifth of European procurement budgets are spent on collaborative weapons systems and the European Defence Agency has the long-term objective of increasing this figure by over 50%. The purpose of this article is to assess whether collaborative armaments projects can offer the benefits frequently attributed to them. To this end, the study examines the five combat aircraft projects that European states have collaboratively undertaken since the 1950s. 相似文献
92.
A critical element in implementing a compensation scheme including nonmonetary incentives (NMIs) is recognizing that preferences vary widely across Service members. There are at least three sources of variability: across different population classes, across individuals within a population class, and across NMI packages for a particular individual. Surveys across different military communities, ranks, and years of Service show the difficulty of identifying any NMI that has significant value for even 50% of the active duty force. At the same time, approximately 80% of the surveyed Service members expressed a significant positive value for at least one NMI. Therefore, one-size-fits-all incentive packages will not be nearly as effective as more personalized incentive packages. The authors discuss variability in Service member NMI preferences and outline an approach to implementing personalized NMI packages in military compensation through a sealed-bid reverse auction, where Service members select individual NMIs from a “cafeteria-style” menu of options. 相似文献
93.
A generalization of the equi-partitioning problem, termed the 2D-Partition Problem, is formulated. The motivation is an aircraft maintenance scheduling problem with the following characteristics. The complete maintenance overhaul of a single aircraft requires the completion of some 350 tasks. These tasks require a varying number of technicians working at the same time. For large subsets of these 350 tasks, the constraining resource is physical space—tasks must be completed in a physical space of limited size such as the cockpit. Furthermore, there is no precedence relationship among the tasks. For each subset, the problem is to schedule the tasks to minimize makespan. Let m denote the maximum number of technicians that can work at the same time in the physical area under consideration. We present optimization algorithms for m = 2 and 3. © 1996 John Wiley & Sons, Inc. 相似文献
94.
In an endeavor to broaden the application of scheduling models to decisions involving the use of a manager's time we use simulation to investigate the performance of a number of simple algorithms (including eight priority rules and a construction heuristic) in a dynamic setting with tasks arriving (randomly) and scheduling decisions being made, over time. We compare these simple methods relative to a bound that uses an adjacent pairwise interchange algorithm. We model uncertainty in task durations, and costs being incurred for early and tardy task completion (representative of JIT settings). In addition to evaluating the efficacy of the scheduling rules and various preemption strategies (using ANOVA), we highlight the managerial implications of the effects of eight environmental parameters. © 1996 John Wiley & Sons, Inc. 相似文献
95.
In statistical analysis of stationary time series or in steady-state simulation output analysis, it is desired to find consistent estimates of the process variance parameter. Here, we consider variants of the area estimator of standardized time series, namely, the weighted area and the Cramér-von Mises area estimators, and provide their consistency, in the strong sense and mean-square sense. A sharp bound for the (asymptotic) variance of these estimators is obtained. We also present a central limit theorem for the weighted area estimator: this gives a rate of convergence of this estimator, as well as a confidence interval for the variance parameter. © 1995 John Wiley & Sons, Inc. 相似文献
96.
Many Markov chain models have very large state spaces, making the computation of stationary probabilities very difficult. Often the structure and numerical properties of the Markov chain allows for more efficient computation through state aggregation and disaggregation. In this article we develop an efficient exact single pass aggregation/disaggregation algorithm which exploits structural properties of large finite irreducible mandatory set decomposable Markov chains. The required property of being of mandatory set decomposable structure is a generalization of several other Markov chain structures for which exact aggregation/disaggregation algorithms exist. © 1995 John Wiley & Sons, Inc. 相似文献
97.
David Simchi-Levi 《海军后勤学研究》1994,41(4):579-585
In this note we consider the familiar bin-packing problem and provide new worst-case results for a number of classical heuristics. We show that the first-fit and best-fit heuristics have an absolute performance ratio of no more than 1.75, and first-fit decreasing and best-fit decreasing heuristics have an absolute performance ratio of 1.5. The latter is the best possible absolute performance ratio for the bin-packing problem, unless P = NP. © 1994 John Wiley & Sons, Inc. 相似文献
98.
Gary R. Waissi 《海军后勤学研究》1993,40(3):393-414
A new algorithm is presented for finding maximal and maximum value flows in directed single-commodity networks. Commonly algorithms developed for this problem find a maximal flow by gradually augmenting (increasing) a feasible flow to a maximal flow. In the presented algorithm, at the beginning of each step or iteration, the flow on arcs is assigned to flow capacity. This may lead to an infeasible flow violating flow conservation at some nodes. During two passes of a MAIN step, consisting of a forward pass and a backward pass, the flow is reduced on some arcs to regain feasibility. The network is then pruned by omitting saturated arcs, and the process is repeated. The parallel implementation of the algorithm applies the two main steps at the same time to the same network. The outputs of the two steps are compared and the processing continues with the higher feasible flow. The algorithm is simple, intuitive, and efficient. © 1993 John Wiley & Sons, Inc. 相似文献
99.
This article examines the historical impact of foreign fighters and how the international community has sought to counter this threat. It argues that foreign fighters have contributed significantly to the metastasis of Salafi-jihadism over the past 30 years. They have globalized local conflicts. They have brought advanced skills to battlefields. Further, the logistics infrastructure built by foreign fighters has allowed Salafi-jihadism to expand rapidly. The challenge for security officials today is how to prevent the foreign fighters in Syria and Iraq from expanding the threat of Salafi-jihadism further. To inform this effort, this article derives lessons learned from past efforts against Arab Afghans in Bosnia (1992–1995) and Abu Musab al-Zarqawi’s foreign volunteers in Iraq (2003–2008). 相似文献
100.
In this paper we study a machine repair problem in which a single unreliable server maintains N identical machines. The breakdown times of the machines are assumed to follow an exponential distribution. The server is subject to failure and the failure times are exponentially distributed. The repair times of the machine and the service times of the repairman are assumed to be of phase type. Using matrix‐analytic methods, we perform steady state analysis of this model. The time spent by a failed machine in service and the total time in the repair facility are shown to be of phase type. Several performance measures are evaluated. An optimization problem to determine the number of machines to be assigned to the server that will maximize the expected total profit per unit time is discussed. An illustrative numerical example is presented. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 462–480, 2003 相似文献