全文获取类型
收费全文 | 1174篇 |
免费 | 22篇 |
出版年
2021年 | 13篇 |
2019年 | 24篇 |
2017年 | 31篇 |
2016年 | 22篇 |
2015年 | 23篇 |
2014年 | 28篇 |
2013年 | 208篇 |
2012年 | 28篇 |
2011年 | 30篇 |
2010年 | 33篇 |
2009年 | 27篇 |
2008年 | 34篇 |
2007年 | 20篇 |
2006年 | 25篇 |
2005年 | 15篇 |
2004年 | 17篇 |
2002年 | 15篇 |
2001年 | 11篇 |
2000年 | 11篇 |
1998年 | 20篇 |
1997年 | 17篇 |
1996年 | 17篇 |
1995年 | 13篇 |
1994年 | 19篇 |
1993年 | 23篇 |
1992年 | 18篇 |
1991年 | 25篇 |
1989年 | 13篇 |
1988年 | 11篇 |
1986年 | 32篇 |
1985年 | 24篇 |
1984年 | 14篇 |
1983年 | 12篇 |
1982年 | 14篇 |
1981年 | 20篇 |
1980年 | 22篇 |
1979年 | 20篇 |
1978年 | 18篇 |
1977年 | 12篇 |
1976年 | 17篇 |
1975年 | 16篇 |
1974年 | 14篇 |
1973年 | 10篇 |
1972年 | 24篇 |
1971年 | 15篇 |
1970年 | 14篇 |
1969年 | 15篇 |
1968年 | 13篇 |
1967年 | 11篇 |
1966年 | 10篇 |
排序方式: 共有1196条查询结果,搜索用时 15 毫秒
111.
112.
113.
Rendezvous search finds the strategies that players should use in order to find one another when they are separated in a region. Previous papers have concentrated on the case where there are two players searching for one another. This paper looks at the problem when there are more than two players and concentrates on what they should do if some but not all of them meet together. It looks at two strategies—the stick together one and the split up and meet again one. This paper shows that the former is optimal among the class of strategies which require no memory and are stationary, and it gives a method of calculating the expected rendezvous time under it. However, simulation results comparing both strategies suggest that in most situations the split up and meet again strategy which requires some memory leads to faster expected rendezvous times. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:710–721, 2001 相似文献
114.
The minimum storage‐time sequencing problem generalizes many well‐known problems in combinatorial optimization, such as the directed linear arrangement and the problem of minimizing the weighted sum of completion times, subject to precedence constraints on a single processor. In this paper we propose a new lower bound, based on a Lagrangian relaxation, which can be computed very efficiently. To improve upon this lower bound, we employ a bundle optimization algorithm. We also show that the best bound obtainable by this approach equals the one obtainable from the linear relaxation computed on a formulation whose first Chvàtal closure equals the convex hull of all the integer solutions of the problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 313–331, 2001 相似文献
115.
对钢丝绳联轴器进行了动刚度性能实验 ,在此基础上建立了数学模型 ,并进行了参数辨识 ,指出钢丝绳联轴器具有强非线性 ,对减小轴系扭转振动具有良好的效果 相似文献
116.
This paper develops and applies a nonparametric bootstrap methodology for setting inventory reorder points and a simple inequality for identifying existing reorder points that are unreasonably high. We demonstrate that an empirically based bootstrap method is both feasible and calculable for large inventories by applying it to the 1st Marine Expeditionary Force General Account, an inventory consisting of $20–30 million of stock for 10–20,000 different types of items. Further, we show that the bootstrap methodology works significantly better than the existing methodology based on mean days of supply. In fact, we demonstrate performance equivalent to the existing system with a reduced inventory at one‐half to one‐third the cost; conversely, we demonstrate significant improvement in fill rates and other inventory performance measures for an inventory of the same cost. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 459–478, 2000 相似文献
117.
We consider a reader—writer system consisting of a single server and a fixed number of jobs (or customers) belonging to two classes. Class one jobs are called readers and any number of them can be processed simultaneously. Class two jobs are called writers and they have to be processed one at a time. When a writer is being processed no other writer or readers can be processed. A fixed number of readers and writers are ready for processing at time 0. Their processing times are independent random variables. Each reader and writer has a fixed waiting cost rate. We find optimal scheduling rules that minimize the expected total waiting cost (expected total weighted flowtime). We consider both nonpreemptive and preemptive scheduling. The optimal nonpreemptive schedule is derived by a variation of the usual interchange argument, while the optimal schedule in the preemptive case is given by a Gittins index policy. These index policies continue to be optimal for systems in which new writers enter the system in a Poisson fashion. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 483–495, 1998 相似文献
118.
Using a system-point (SP) method of level crossings, we derive the stationary distribution of the inventory level (stock on hand) in a continuous-review inventory system with compound Poisson demand, Erlang as well as hyperexponentially distributed lead times, and lost sales. This distribution is then used to formulate long-run average cost functions with/without a service level constraint. Some numerical results are also presented, and compared with the Hadley and Whitin heuristic. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 259–278, 1998 相似文献
119.
武器系统采购费与维修费权衡的依据分析 总被引:4,自引:2,他引:2
根据武器系统寿命周期费用的理论和方法,建立了系统的费用模型,依据数学分析和优化理论,在已知可用武器系统目标数的前提下,建立了费用优化条件,确定了采购费与维修费的比例限值,用以确定武器系统采购费和维修费的最优比例,从而对系统方案确定的权衡分析提供量化依据. 相似文献
120.
The provision of Military Assistance to the Civil Powers (MACP) encapsulates the traditional approach towards countering terrorism on the British mainland, which emphasises minimum force, proportionality, police primacy and the rule of law, with the military retained as a supporting instrument, being employed only as a measure of last resort. Recent terrorist incidents in major urban centres do, however, question the effectiveness of these established methods. This analysis initially codifies the conceptual issues that underscore the tensions between civil policing and military anti-terrorist approaches in the UK, and proceeds to evaluate and compare a number of operations that indicate the nature of the challenges facing the MACP apparatus. In particular, potential shortcomings in the MACP provisions are identified in the form of threat perception and deployment and enforcement gaps. The assessment finds that there are facets of MACP that are of enduring relevance in the current era, yet a continuing need persists to reconcile police and military imperatives toward serious civil disorder contingencies and conditions of emergency. 相似文献