首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   252篇
  免费   9篇
  国内免费   1篇
  2021年   2篇
  2019年   10篇
  2018年   7篇
  2017年   6篇
  2016年   7篇
  2014年   6篇
  2013年   43篇
  2012年   3篇
  2010年   6篇
  2007年   6篇
  2006年   2篇
  2005年   6篇
  2004年   4篇
  2002年   7篇
  2000年   2篇
  1999年   4篇
  1998年   7篇
  1997年   7篇
  1996年   3篇
  1995年   2篇
  1994年   7篇
  1993年   9篇
  1992年   5篇
  1991年   7篇
  1990年   7篇
  1989年   4篇
  1988年   6篇
  1987年   3篇
  1986年   4篇
  1985年   6篇
  1984年   1篇
  1983年   2篇
  1982年   5篇
  1981年   5篇
  1980年   3篇
  1979年   4篇
  1978年   4篇
  1977年   3篇
  1976年   3篇
  1975年   3篇
  1974年   3篇
  1973年   4篇
  1972年   3篇
  1971年   1篇
  1969年   2篇
  1968年   5篇
  1967年   2篇
  1966年   3篇
  1949年   1篇
  1948年   2篇
排序方式: 共有262条查询结果,搜索用时 15 毫秒
131.
The present paper studies the relative magnitudes of expected waiting times in extended machine-repair models, when processing times are of two Erlang types. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 864–870, 1999  相似文献   
132.
This paper uses the holding time model (HTM) method to derive an approximate analytic formula for the calculation of the mean throughput of a K-station production line with no buffers between any two successive stations. Service times follow the two-stage Coxian (C2) distribution at all stations. The paper provides a formula that relates the third moment of the service completion (or virtual service) time with the respective parameters of the service time, the repair time and the time to breakdown (the latter is assumed to follow the exponential distribution). In this way, it concludes that under certain conditions the two-stage Coxian distribution can be used to approximate any general distribution matching the first three moments of the service completion time distribution. The mean holding times (consisting of the service and blocking periods) of all stations of the line are obtained in an analytical form. Numerical results are provided for the mean throughput of lines with up to 20 stations. These results are shown to have a good accuracy compared against results obtained from the Markovian state method (for short lines) and results from simulation (for longer lines). © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 669–685, 1998  相似文献   
133.
This paper considers a combined system composed of multiple stand-by remotely piloted vehicles (RPVs) and a single battery against a single passive enemy target, where the target, if not killed, is allowed to change its location after each attack. The RPV has the duty to report on target acquisition, to confirm a target kill, and to pass information on any change in target location after each battery attack. The battery has the duty to attack the target on the basis of the target location information provided to it by the RPV. We develop a closed-form expression for the time-dependent state probabilities of the system, which can be used to compute several important combat measures of effectiveness, including (a) the time-varying mean and variance of the number of the RPVs being alive and of the surviving enemy target, (b) the mission success, mission failure, and combat draw probabilities, and (c) the mean and variance of the combat duration time. Illustrative numerical examples are solved for these combat measures, and sensitivity analyses are performed with respect to target acquisition time and target kill probability. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 645–667, 1998  相似文献   
134.
Banks have found it advantageous to connect their Automated Teller Machines (ATMs) in networks so that customers of one bank may use the ATMs of any bank in the network. When this occurs, an interchange fee is paid by the customer's bank to the one that owns the ATM. These have been set by historic interbank negotiation. The paper investigates how a model based on n-player game theory concepts of Shapley value and nucleolus could be used as an alternative way of setting such fees. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 407–417, 1998  相似文献   
135.
Facility location problems in the plane are among the most widely used tools of Mathematical Programming in modeling real-world problems. In many of these problems restrictions have to be considered which correspond to regions in which a placement of new locations is forbidden. We consider center and median problems where the forbidden set is a union of pairwise disjoint convex sets. As applications we discuss the assembly of printed circuit boards, obnoxious facility location and the location of emergency facilities. © 1995 John Wiley & Sons, Inc.  相似文献   
136.
137.
Does the United Nations naming and shaming of specific violations of human rights decrease government repression? In this article, we argue that international shaming of specific human rights violations can weaken the target government, bringing new challenges and making the government cessation of repression less feasible. When international naming and shaming campaigns target specific repressive tactics, they increase the costs of some – but not all – means of repression. Using original data on naming and shaming by the United Nations Human Rights Council (HRC), we show that the shaming of one physical integrity violation is jointly associated with decreases in that violation and increases in other violations of human rights.  相似文献   
138.
We study stochastic clearing systems with a discrete-time Markovian input process, and an output mechanism that intermittently and instantaneously clears the system partially or completely. The decision to clear the system depends on both quantities and delays of outstanding inputs. Clearing the system incurs a fixed cost, and outstanding inputs are charged a delay penalty, which is a general increasing function of the quantities and delays of individual inputs. By recording the quantities and delays of outstanding inputs in a sequence, we model the clearing system as a tree-structured Markov decision process over both a finite and infinite horizon. We show that the optimal clearing policies, under realistic conditions, are of the on-off type or the threshold type. Based on the characterization of the optimal policies, we develop efficient algorithms to compute parameters of the optimal policies for such complex clearing systems for the first time. We conduct a numerical analysis on the impact of the nonlinear delay penalty cost function, the comparison of the optimal policy and the classical hybrid policy (ie, quantity and age thresholds), and the impact of the state of the input process. Our experiments demonstrate that (a) the classical linear approximation of the cost function can lead to significant performance differences; (b) the classical hybrid policy may perform poorly (as compared to the optimal policies); and (c) the consideration of the state of the input process makes significant improvement in system performance.  相似文献   
139.
The malaise that the United States, and the West, have experienced in recent campaigns stems in large part from unclear thinking about war, its political essence, and the strategies needed to join the two. Instead, analysis and response are predicated on entrenched theoretical concepts with limited practical utility. The inadequacy of understanding has spawned new, and not so new, terms to capture unanticipated trends, starting with the re-discovery of “insurgency” and “counterinsurgency” and leading to discussion of “hybrid threats” and “gray-zone” operations. New terminology can help, but the change must go deeper. Challenging analytical orthodoxy, this article sets out a unifying approach for the study of political violence, or more accurately: violent politics. It provides a conceptual foundation that helps to make sense of recent shifts in warfare. In effect, it offers sorely needed theoretical insights into the nature of strategy and guides the process of responding to nontraditional threats.  相似文献   
140.
This article presents a recoverable spares model for performance evaluation in a multiechelon inventory environment. This model explicitly incorporates the phenomenon known as multiple failures, in which more than one part can require replacement or repair when an end-item reaches a maintenance base. The model is shown to be computationally intractable, and an approximation scheme is presented to estimate system performance. © 1993 John Wiley & Sons, Inc.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号