全文获取类型
收费全文 | 658篇 |
免费 | 150篇 |
国内免费 | 20篇 |
出版年
2024年 | 1篇 |
2023年 | 4篇 |
2022年 | 6篇 |
2021年 | 11篇 |
2020年 | 14篇 |
2019年 | 32篇 |
2018年 | 17篇 |
2017年 | 53篇 |
2016年 | 50篇 |
2015年 | 38篇 |
2014年 | 44篇 |
2013年 | 107篇 |
2012年 | 37篇 |
2011年 | 43篇 |
2010年 | 40篇 |
2009年 | 41篇 |
2008年 | 33篇 |
2007年 | 48篇 |
2006年 | 34篇 |
2005年 | 29篇 |
2004年 | 33篇 |
2003年 | 19篇 |
2002年 | 22篇 |
2001年 | 20篇 |
2000年 | 21篇 |
1999年 | 7篇 |
1998年 | 5篇 |
1997年 | 4篇 |
1996年 | 4篇 |
1995年 | 4篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1992年 | 1篇 |
1990年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有828条查询结果,搜索用时 312 毫秒
771.
In this paper the problem of minimizing makespan in a two‐machine openshop is examined. A heuristic algorithm is proposed, and its worst case performance ratio and complexity are analyzed. The average case performance is evaluated using an empirical study. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 129–145, 1999 相似文献
772.
Typically weapon systems have an inherent systematic error and a random error for each round, centered around its mean point of impact. The systematic error is common to all aimings. Assume such a system for which there is a preassigned amount of ammunition of n rounds to engage a given target simultaneously, and which is capable of administering their fire with individual aiming points (allowing “offsets”). The objective is to determine the best aiming points for the system so as to maximize the probability of hitting the target by at least one of the n rounds. In this paper we focus on the special case where the target is linear (one‐dimensional) and there are no random errors. We prove that as long as the aiming error is symmetrically distributed and possesses one mode at zero, the optimal aiming is independent of the particular error distribution, and we specify the optimal aiming points. Possible extensions are further discussed, as well as civilian applications in manufacturing, radio‐electronics, and detection. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 323–333, 1999 相似文献
773.
Consider a situation where a single shooter engages, sequentially, a cluster of targets that may vary in terms of vulnerability and value or worth. Following the shooting of a round of fire at a certain target, the latter may either be killed or remain alive. We assume neither partial nor cumulative damage. If the target is killed, there is a possibility that the shooter is not aware of that fact and may keep on engaging that target. If the shooter recognizes a killed target as such, then this target is considered to be evidently killed. If the objective is to maximize the weighted expected number of killed targets, where the weight reflects the value of a target, then it is shown that a certain type of a shooting strategy, called a Greedy Strategy, is optimal under the general assumption that the more a target is engaged, but still not evidently killed, the less is the probability that the next round will be effective. If all weights are equal, then the greedy shooting strategy calls to engage, at each round, the least previously engaged target that is not evidently killed. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 613–622, 1997 相似文献
774.
Andrew J. Gawthorpe 《战略研究杂志》2018,41(1-2):301-325
Harvard professor Samuel P. Huntington has frequently been considered a Vietnam War hawk. His observation that ‘forced-draft urbanization’ might help the United States win the war has come to define his engagement in contemporary strategic debates. This essay argues that both Huntington’s academic work and his private policy advice to the U.S. Government in fact urged a political settlement to the conflict. It argues that in spite of this, Huntington refused to break publicly with the U.S. policy because of his wider concern over what he saw as a crisis of authority in the U.S. foreign policy and governing institutions in the era. 相似文献
775.
After 15 years of war in Afghanistan and Iraq, many now see ‘small-footprint’ security force assistance (SFA) – training, advising and equipping allied militaries – as an alternative to large US ground-force commitments. Yet, its actual military efficacy has been little studied. This paper seeks to fill this gap. We find important limitations on SFA’s military utility, stemming from agency problems arising from systematic interest misalignment between the US and its typical partners. SFA’s achievable upper bound is modest and attainable only if US policy is intrusive and conditional, which it rarely is. For SFA, small footprints will usually mean small payoffs. 相似文献
776.
Ilmari Käihkö 《Defence Studies》2018,18(2):147-166
At the core of waging war and strategy is the creation, control and use of force. This article investigates the volunteer battalions that mobilized in Ukraine during the spring of 2014. It contextualizes the volunteer phenomenon and focuses on the state strategies to establish control over these militias. As ambiguous entities arising from a situation characterized by rapid social change – revolution and war – the volunteer battalions threatened existing hierarchies and questioned state authority. The situation was exacerbated by the war, which deviated from the expectations of Ukrainian combatants and Western military observers alike. The state nevertheless enjoyed a modicum of success in reining in the militias through four strategies of undermining, co-option, incorporation and coercion. While predominantly integrated into a more rigid category of paramilitary forces, the volunteers continue to play a role in both the Ukrainian society and security sector to the unforeseeable future. 相似文献
777.
Various indices of component importance with respect to system reliability have been proposed. The most popular one is the Birnbaum importance. In particular, a special case called uniform Birnbaum importance in which all components have the same reliability p has been widely studied for the consecutive‐k system. Since it is not easy to compare uniform Birnbaum importance, the literature has looked into the case p = ½, p → 1, or p ≥ ½. In this paper, we look into the case p → 0 to complete the spectrum of examining Birnbaum importance over the whole range of p. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 159–166, 2002; DOI 10.1002/nav.10001 相似文献
778.
This paper considers a three‐person rendezvous problem on the line which was introduced earlier by the authors. Three agents are placed at three consecutive integer value points on the real line, say 1, 2, and 3. Each agent is randomly faced towards the right or left. Agents are blind and have a maximum speed of 1. Their common aim is to gather at a common location as quickly as possible. The main result is the proof that a strategy given by V. Baston is the unique minimax strategy. Baston's strategy ensures a three way rendezvous in time at most 3.5 for any of the 3!23 = 48 possible initial configurations corresponding to positions and directions of each agent. A connection is established between the above rendezvous problem and a search problem of L. Thomas in which two parents search separately to find their lost child and then meet again. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 244–255, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10005 相似文献
779.
In this paper a case study dealing with the maintenance problem of jib cranes is presented. A jib crane is viewed as a complex system whose performance is observed as a single realization over period of time. After pointing out limitations of existing stochastic models to analyze the observed realization a new family of bivariate stochastic processes is introduced. The data of jib crane is analyzed using new model and cross‐validated using part of the data set. It is noted that the new family of stochastic processes is useful to analyze bivariate data where one of the variables is finitely valued and the other is nonnegative and continuous. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 231–243, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10006 相似文献
780.
We consider the ??p‐norm multi‐facility minisum location problem with linear and distance constraints, and develop the Lagrangian dual formulation for this problem. The model that we consider represents the most general location model in which the dual formulation is not found in the literature. We find that, because of its linear objective function and less number of variables, the Lagrangian dual is more useful. Additionally, the dual formulation eliminates the differentiability problem in the primal formulation. We also provide the Lagrangian dual formulation of the multi‐facility minisum location problem with the ??pb‐norm. Finally, we provide a numerical example for solving the Lagrangian dual formulation and obtaining the optimum facility locations from the solution of the dual formulation. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 410–421, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10010 相似文献