首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   403篇
  免费   15篇
  国内免费   2篇
  2021年   12篇
  2020年   4篇
  2019年   7篇
  2017年   8篇
  2016年   6篇
  2015年   12篇
  2014年   8篇
  2013年   70篇
  2012年   4篇
  2011年   11篇
  2010年   8篇
  2008年   5篇
  2007年   4篇
  2006年   7篇
  2005年   5篇
  2002年   5篇
  2001年   7篇
  2000年   4篇
  1999年   4篇
  1998年   8篇
  1997年   8篇
  1996年   5篇
  1995年   6篇
  1994年   9篇
  1993年   8篇
  1992年   7篇
  1991年   8篇
  1989年   7篇
  1988年   14篇
  1987年   6篇
  1986年   15篇
  1985年   9篇
  1984年   6篇
  1983年   5篇
  1982年   4篇
  1981年   8篇
  1980年   5篇
  1979年   11篇
  1978年   7篇
  1977年   7篇
  1975年   9篇
  1974年   7篇
  1973年   5篇
  1972年   7篇
  1971年   4篇
  1970年   4篇
  1969年   6篇
  1968年   3篇
  1967年   2篇
  1966年   3篇
排序方式: 共有420条查询结果,搜索用时 15 毫秒
51.
…Rapid indigenisation is the cornerstone of our policy of self-reliance

India MoD Annual Report 1978–9
  相似文献   
52.
We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time pj and a size sj. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015  相似文献   
53.
Whether or not Colombia has improved is a controversial topic. If improvement has occurred, what, if any, lessons from the Colombian model can be learned? The first lesson is that Colombia's problems were caused more by a weak state than by drugs. The second lesson is that improving state capacity requires more than just increased security. The state must also provide the basic social services that citizens require to gain and maintain their support. Additionally, government institutions need to improve their professionalism, protect human rights, and root out impunity and corruption. The alternative is to suffer from new cycles of violence as old foes are vanquished, but new ones emerge.  相似文献   
54.
55.
In this paper we study higher‐order Markov chain models for analyzing categorical data sequences. We propose an efficient estimation method for the model parameters. Data sequences such as DNA and sales demand are used to illustrate the predicting power of our proposed models. In particular, we apply the developed higher‐order Markov chain model to the server logs data. The objective here is to model the users' behavior in accessing information and to predict their behavior in the future. Our tests are based on a realistic web log and our model shows an improvement in prediction. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004  相似文献   
56.
抢险救灾非战争军事行动包括道路抢修和物资运输等任务,而这两类任务在灾后应急资源调度中存在关联性的影响,且面临路网结构可变及需求随机模糊等挑战,对此,提出了一种非确定性应急资源调度网络双层规划模型,设计了基于蒙特卡洛方法与遗传算法耦合的智能启发式求解策略.通过对典型情境下应急资源调度案例进行分析建模和数值求解,说明了该模型和算法的合理性和有效性.  相似文献   
57.
The present paper provides a proof that the Bayes prediction ordering policy developed in [3] is an optimal policy, in the sense that it minimizes the total expected discounted cost of ordering for any finite planning horizon.  相似文献   
58.
The general solution process of the Hitchcock transportation problem resulting from the application of the method of reduced matrices may give solutions with some negative xij values. This paper is devoted to a review of the reduced matrices method, an examination of suitable interpretation of sets of xij which include some negative values, and ways of interpreting these values in useful modifications of the Hitchcock problem. Such modifications include a) the reshipment problem, b) the overshipment problem, and c) the transshipment problem. Techniques are developed for determining and eliminating cij which are not optimal. These techniques and results are useful in solving the problems indicated above. The natural applicability of the simple and general method of reduced matrices is emphasized.  相似文献   
59.
In this study we interpret the exterior penalty function method as a generalized lagrangian metliod which fills duality gaps in nonconvex problems. Geometry and resolution of these gaps from a duality point of view are highlighted.  相似文献   
60.
This paper describes a linear programming model used to perform cost-effectiveness analysis to determine the requirements for military strategic mobility resources. Expenditures for three classes of economic alternatives are considered: purchase of transportation resources; prepositioning of material; and augmentation of port facilities. The mix of economic alternatives that maximizes the effectiveness of the resultant transportation system is determined for a given investment level. By repeating the analysis for several levels of investment, a cost-effectiveness tradeoff curve can be developed.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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