首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   638篇
  免费   13篇
  2021年   11篇
  2020年   6篇
  2019年   25篇
  2018年   18篇
  2017年   16篇
  2016年   16篇
  2015年   15篇
  2014年   12篇
  2013年   153篇
  2009年   6篇
  2008年   7篇
  2007年   6篇
  2006年   7篇
  2005年   10篇
  2004年   8篇
  2003年   6篇
  2002年   6篇
  2001年   6篇
  2000年   8篇
  1999年   6篇
  1998年   12篇
  1997年   19篇
  1996年   11篇
  1994年   13篇
  1992年   7篇
  1991年   16篇
  1990年   7篇
  1989年   9篇
  1988年   10篇
  1987年   15篇
  1986年   12篇
  1985年   7篇
  1984年   7篇
  1983年   8篇
  1982年   11篇
  1981年   5篇
  1980年   8篇
  1979年   11篇
  1978年   7篇
  1977年   8篇
  1976年   7篇
  1975年   9篇
  1974年   7篇
  1973年   13篇
  1972年   7篇
  1971年   7篇
  1970年   7篇
  1969年   6篇
  1968年   7篇
  1967年   5篇
排序方式: 共有651条查询结果,搜索用时 15 毫秒
511.
512.
Each year, more than $3 billion is wagered on the NCAA Division 1 men's basketball tournament. Most of that money is wagered in pools where the object is to correctly predict winners of each game, with emphasis on the last four teams remaining (the Final Four). In this paper, we present a combined logistic regression/Markov chain model for predicting the outcome of NCAA tournament games given only basic input data. Over the past 6 years, our model has been significantly more successful than the other common methods such as tournament seedings, the AP and ESPN/USA Today polls, the RPI, and the Sagarin and Massey ratings. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006.  相似文献   
513.
The focus of this paper is on determining the requirements of different component options of a modular end‐product in an uncertain environment. We explicitly model two distinct sources of uncertainty: stochastic end‐product demand and unknown market proportions for the different product options available. Our cost minimizing model focuses on determining the optimal requirements policies for component options that meet a pre‐set service level. We show that simple common‐sense requirements policies are not generally optimal; there is a non‐linear connection between service level and component requirements that is hard to characterize without a detailed analysis. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   
514.
515.
516.
Military operations and maritime preponderance by Charles E. Callwell, Edinburgh: William Blackwood & Sons, 1905.  相似文献   
517.
The standard issue bayonet of the British Army immediately preceding and during the First World War was the Pattern 1907. This was manufactured at different times and in varying numbers during that period by one official body, the Royal Small Arms Factory at Enfield, and by five private contractors. These bayonets were made according to published official specifications issued by the War Department and based on a ‘pattern example’ provided by the Royal Small Arms Factory. The specifications indicate, inter alia, the quality of metal used in making the bayonets, methods of inspection and proofing, and the required maximum and minimum weight range of the completed bayonet. However, examination of a series of these bayonets in a private collection suggested that their weights varied considerably from the mid-point values of the allowed weight ranges in the original and amended specifications (16.5 oz. and 17 oz., respectively). To establish if this was a common feature among this class of bayonet as opposed to a chance factor, the weights of other surviving Pattern 1907 bayonets were determined and compared to establish the degree of variance from the official specifications as originally set out by the Royal Small Arms Factory. Seventy-six percent of the 142 bayonets surveyed were found to be above the mid-point of the allowed weight range given in the amended manufacturing specifications, with many being at the upper end of the allowed range. This is a statistically unusual result. It is speculated that the target weight may have been deliberately set higher by the individual manufacturers to eliminate the possibility of rejection of any underweight bayonets by the Royal Small Arms Factory inspectors and so a refusal of acceptance and payment for the work.  相似文献   
518.
Clausewitz was much preoccupied with the apparent contradiction between real and absolute war. Why did war in history so rarely exhibit the extremes of violence and energy implied in the pure concept of war? Clausewitz’s commentators have usually followed him in thinking that this was a genuine problem in need of a solution, but I want to question that view. I will argue that Clausewitz did not have a coherent philosophy of absolute war, and therefore the contradiction he posited between real and absolute war was equally meaningless – as, too, was his effort to resolve it by claiming that some real wars approached or even attained the absolute form of war. The real problem was not the opposition of real and absolute war, but the self-contradictory theory of absolute war.  相似文献   
519.
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  相似文献   
520.
When solving location problems in practice it is quite common to aggregate demand points into centroids. Solving a location problem with aggregated demand data is computationally easier, but the aggregation process introduces error. We develop theory and algorithms for certain types of centroid aggregations for rectilinear 1‐median problems. The objective is to construct an aggregation that minimizes the maximum aggregation error. We focus on row‐column aggregations, and make use of aggregation results for 1‐median problems on the line to do aggregation for 1‐median problems in the plane. The aggregations developed for the 1‐median problem are then used to construct approximate n‐median problems. We test the theory computationally on n‐median problems (n ≥ 1) using both randomly generated, as well as real, data. Every error measure we consider can be well approximated by some power function in the number of aggregate demand points. Each such function exhibits decreasing returns to scale. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 614–637, 2003.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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