全文获取类型
收费全文 | 516篇 |
免费 | 153篇 |
国内免费 | 42篇 |
出版年
2024年 | 5篇 |
2023年 | 4篇 |
2022年 | 20篇 |
2021年 | 31篇 |
2020年 | 23篇 |
2019年 | 10篇 |
2018年 | 15篇 |
2017年 | 11篇 |
2016年 | 9篇 |
2015年 | 28篇 |
2014年 | 27篇 |
2013年 | 33篇 |
2012年 | 36篇 |
2011年 | 51篇 |
2010年 | 53篇 |
2009年 | 55篇 |
2008年 | 45篇 |
2007年 | 37篇 |
2006年 | 31篇 |
2005年 | 25篇 |
2004年 | 16篇 |
2003年 | 12篇 |
2002年 | 8篇 |
2001年 | 9篇 |
2000年 | 13篇 |
1999年 | 22篇 |
1998年 | 16篇 |
1997年 | 10篇 |
1996年 | 8篇 |
1995年 | 10篇 |
1994年 | 8篇 |
1993年 | 5篇 |
1992年 | 3篇 |
1991年 | 9篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1987年 | 2篇 |
1986年 | 2篇 |
1985年 | 1篇 |
1982年 | 1篇 |
排序方式: 共有711条查询结果,搜索用时 46 毫秒
41.
42.
43.
王冬 《中国人民武装警察部队学院学报》2010,26(8):12-13
近年来,政府对消防投入水平较低。通过建立数学模型,从消防部门与政府的相互关系进行理论论证,抛砖引玉,提出消防工作的建议。 相似文献
44.
董生 《武警工程学院学报》2010,(1):19-21
在最新颁布实施的《中华人民共和国人民武装警察法》中,共有3条6处规定了武警部队在执行国内安全保卫任务时对其他机关的“协助”,但是这些协助性任务的性质并不是很明确。本文通过对行政协助构成关键点的剖析,探究该法律中的“协助”是否是真正意义上的行政协助。 相似文献
45.
46.
As a complex system with multiple components usually deteriorates with age, preventive maintenance (PM) is often performed to keep the system functioning in a good state to prolong its effective age. In this study, a nonhomogeneous Poisson process with a power law failure intensity is used to describe the deterioration of a repairable system, and the optimal nonperiodic PM schedule can be determined to minimize the expected total cost per unit time. However, since the determination of such optimal PM policies may involve numerous uncertainties, which typically make the analyses difficult to perform because of the scarcity of data, a Bayesian decision model, which utilizes all available information effectively, is also proposed for determining the optimal PM strategies. A numerical example with a real failure data set is used to illustrate the effectiveness of the proposed approach. The results show that the optimal schedules derived by Bayesian approach are relatively more conservative than that for non‐Bayesian approach because of the uncertainty of the intensity function, and if the intensity function are updated using the collected data set, which indicates more severe deterioration than the prior belief, replacing the entire system instead of frequent PM activities before serious deterioration is suggested. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
47.
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 相似文献
48.
49.
50.