全文获取类型
收费全文 | 1113篇 |
免费 | 315篇 |
国内免费 | 41篇 |
出版年
2023年 | 2篇 |
2022年 | 10篇 |
2021年 | 56篇 |
2020年 | 15篇 |
2019年 | 5篇 |
2018年 | 7篇 |
2017年 | 14篇 |
2016年 | 9篇 |
2015年 | 36篇 |
2014年 | 40篇 |
2013年 | 40篇 |
2012年 | 27篇 |
2011年 | 25篇 |
2010年 | 59篇 |
2009年 | 87篇 |
2008年 | 67篇 |
2007年 | 74篇 |
2006年 | 36篇 |
2005年 | 39篇 |
2004年 | 12篇 |
2003年 | 2篇 |
2002年 | 2篇 |
2001年 | 5篇 |
2000年 | 39篇 |
1999年 | 136篇 |
1998年 | 99篇 |
1997年 | 84篇 |
1996年 | 74篇 |
1995年 | 60篇 |
1994年 | 56篇 |
1993年 | 46篇 |
1992年 | 45篇 |
1991年 | 42篇 |
1990年 | 51篇 |
1989年 | 12篇 |
1988年 | 7篇 |
1987年 | 13篇 |
1986年 | 8篇 |
1985年 | 10篇 |
1983年 | 13篇 |
1982年 | 4篇 |
1978年 | 1篇 |
排序方式: 共有1469条查询结果,搜索用时 0 毫秒
131.
132.
133.
王华剑 《武警工程学院学报》2010,(1):53-55
模拟演练是突出岗位任职教育特点的手段和方法。对开展模拟演练进行思考,提出应把握的三个问题,并进行思考总结。 相似文献
134.
This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
135.
We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
136.
137.
138.
139.
本文介绍了用虚拟仪器设计语言LabVIEW构建冲击测量分析系统的程序设计方法。对于高速数据采集和曲线显示,LabVIEW设计语言有其他程序设计语言无法比拟的技术优势。通过针对专用系统的优化设计,程序运行可靠、使用方便、修改快捷。本文涉及的程序经过简单修改,可以应用到其他类似的测试系统,具备很强的可扩展性。 相似文献
140.
本文详细介绍了微机环境下,处理大地形、多地物、海量的三维视景数据时,所采取的多种模型优化和软件算法,来保证训练模拟器三维视景系统的实时运行。 相似文献