首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   389篇
  免费   0篇
  389篇
  2021年   3篇
  2019年   15篇
  2018年   14篇
  2017年   9篇
  2016年   8篇
  2015年   4篇
  2014年   10篇
  2013年   87篇
  2012年   3篇
  2010年   6篇
  2007年   8篇
  2006年   5篇
  2005年   11篇
  2004年   7篇
  2003年   4篇
  2002年   8篇
  2000年   2篇
  1999年   4篇
  1998年   8篇
  1997年   8篇
  1996年   4篇
  1995年   5篇
  1994年   9篇
  1993年   11篇
  1992年   7篇
  1991年   8篇
  1990年   7篇
  1989年   7篇
  1988年   8篇
  1987年   4篇
  1986年   5篇
  1985年   8篇
  1984年   4篇
  1983年   2篇
  1982年   5篇
  1981年   5篇
  1980年   4篇
  1979年   4篇
  1978年   4篇
  1977年   4篇
  1976年   4篇
  1975年   3篇
  1974年   5篇
  1973年   7篇
  1972年   4篇
  1969年   3篇
  1968年   5篇
  1967年   2篇
  1966年   4篇
  1948年   2篇
排序方式: 共有389条查询结果,搜索用时 0 毫秒
351.
A unified treatment is given for a class of discrete distributions derived by compounding a bivariate Poisson with a bivariate discrete or continuous distribution. Using generating functions a number of interesting results are obtained for probabilities, moments, cumulants, factorial moments, and factorial cumulants. Conditional distributions and regression functions are also examined. Five illustrative examples are presented in detail. © 1994 John Wiley & Sons, Inc.  相似文献   
352.
We consider a class of facility location problems with a time dimension, which requires assigning every customer to a supply facility in each of a finite number of periods. Each facility must meet all assigned customer demand in every period at a minimum cost via its production and inventory decisions. We provide exact branch‐and‐price algorithms for this class of problems and several important variants. The corresponding pricing problem takes the form of an interesting class of production planning and order selection problems. This problem class requires selecting a set of orders that maximizes profit, defined as the revenue from selected orders minus production‐planning‐related costs incurred in fulfilling the selected orders. We provide polynomial‐time dynamic programming algorithms for this class of pricing problems, as well as for generalizations thereof. Computational testing indicates the advantage of our branch‐and‐price algorithm over various approaches that use commercial software packages. These tests also highlight the significant cost savings possible from integrating location with production and inventory decisions and demonstrate that the problem is rather insensitive to forecast errors associated with the demand streams. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011  相似文献   
353.
How do we understand combat effectiveness – soldiers’ performance in battle? Despite the broad consensus that understanding combat effectiveness is important both for scholars and policymakers, there is widespread disagreement about what combat effectiveness is. More specifically, studies of effectiveness tend to focus on either the skill of soldiers in battle, or their will to fight. Yet both skill and will are essential components of an effective fighting force. This article argues that understanding combat effectiveness requires understanding both of these key components of effectiveness. In other words, combat effectiveness requires both the skill and will to engage the enemy in an organized manner. It then demonstrates the usefulness of this conceptualization by applying it to the cases of British, Indian, and Australian forces fighting the Japanese during the Second World War. Only when scholars are talking about the same concept will our understanding of the conditions under which militaries are effective in battle progress. By comparing different units fighting the same opponent under the same material conditions, I demonstrate that units vary both in their combat skill and their will to fight, and that understanding their effectiveness in battle requires analyzing both of these key factors.  相似文献   
354.
There are multiple damage functions in the literature to estimate the probability that a single weapon detonation destroys a point target. This paper addresses differences in the tails of four of the more popular damage functions. These four cover the asymptotic tail behaviors of all monotonically decreasing damage functions with well‐behaved hazard functions. The differences in estimates of probability of kill are quite dramatic for large aim‐point offsets. This is particularly important when balancing the number of threats that can be engaged with the chances of fratricide and collateral damage. In general, analysts substituting one damage function for another may badly estimate kill probabilities in offset‐aiming, which could result in poor doctrine. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 306–321, 2003.  相似文献   
355.
对海战场综合态势进行态势评估和威胁分析是信息融合系统的最高层级,态势评估结果将对指挥员的指挥决策起到非常重要的作用。根据海军作战理论分析了海战场态势的表示方法,并基于模板方法设计了一种战场当前态势与模板数据库中态势进行匹配的算法。该算法特别适用于高层推理如态势或威胁评估。  相似文献   
356.
    
The purpose of this paper is to provide a better conceptualization of insurgent strategies. Specifically, I shall examine Che Guevara's ‘Foco’ theory of insurgency, as it is one of the most theoretically popular and most pervasive strategies of insurgency currently practiced throughout the world. After briefly examining the origins, objectives, and theoretical strengths of the Foco theory (also known as the Vanguard Theory), I will argue that Guevara's theory suffers from an internal tension that I term the ‘Vanguard's Dilemma’. The significance of this dilemma creates a tension within the Vanguard Theory that can be fatal for insurgents if properly exploited by counterinsurgent operations. This paper will examine in detail this dilemma and show how it can be exploited. Given that several insurgent groups within Iraq and Afghanistan currently adhere to the Vanguard Theory of insurgency, a proper understanding of this insurgent strategy is an essential first step in the long road towards confronting and winning asymmetrical conflicts.  相似文献   
357.
    
Diagnostic clinics are among healthcare facilities that suffer from long waiting times which can worsen medical outcomes and increase patient no-shows. Reducing waiting times without significant capital investments is a challenging task. We tackle this challenge by proposing a new appointment scheduling policy that does not require significant investments for diagnostic clinics. The clinic in our study serves outpatients, inpatients, and emergency patients. Emergency patients must be seen on arrival, and inpatients must be given next day appointments. Outpatients, however, can be given later appointments. The proposed policy takes advantage of this by allowing the postponement of the acceptance of appointment requests from outpatients. The appointment scheduling process is modeled as a two-stage stochastic programming problem where a portion of the clinic capacity is allocated to inpatients and emergency patients in the first stage. In the second stage, outpatients are scheduled based on their priority classes. After a detailed analysis of the solutions obtained from the two-stage stochastic model, we develop a simple, non-anticipative policy for patient scheduling. We evaluate the performance of this proposed, easy-to-implement policy in a simulation study which shows significant improvements in outpatient indirect waiting times.  相似文献   
358.
    
In the mid-2000s, the United States Army was embroiled in counterinsurgency missions in Iraq and Afghanistan that required deeper understanding of local social systems. The Army turned to systems thinking and design thinking to model and understand the world, define problems, and develop approaches to strategic and operational challenges. However, the Army’s approach as expressed in publications and doctrine encourages the development of complicated, unsupported, and unfalsifiable hypotheses. The risk is that the Army will act on incorrect assumptions and develop plans that are fragile.  相似文献   
359.
    
The United States has returned to Iraq, this time to combat the Islamic State. President Barack Obama’s strategy to ‘degrade, and ultimately destroy the terrorist group’ faces serious problems due to political obstacles in obtaining Congressional Authorization for the Use of Military Force (AUMF) and more importantly because of neglect of the crucial role of private contractors. Although the narrative has changed, and there is no public mention of contractors, they remain central to all that the Department of Defense does in the US and abroad. Suggestions are offered on how their performance can be improved to support President Obama’s strategy.  相似文献   
360.
    
This article introduces the Doubly Stochastic Sequential Assignment Problem (DSSAP), an extension of the Sequential Stochastic Assignment Problem (SSAP), where sequentially arriving tasks are assigned to workers with random success rates. A given number of tasks arrive sequentially, each with a random value coming from a known distribution. On a task arrival, it must be assigned to one of the available workers, each with a random success rate coming from a known distribution. Optimal assignment policies are proposed for DSSAP under various assumptions on the random success rates. The optimal assignment algorithm for the general case of DSSAP, where workers have distinct success rate distribution, has an exponential running time. An approximation algorithm that achieves a fraction of the maximum total expected reward in a polynomial time is proposed. The results are illustrated by several numerical experiments. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 124–137, 2016  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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