全文获取类型
收费全文 | 868篇 |
免费 | 191篇 |
国内免费 | 31篇 |
出版年
2023年 | 4篇 |
2022年 | 5篇 |
2021年 | 25篇 |
2020年 | 15篇 |
2019年 | 22篇 |
2018年 | 15篇 |
2017年 | 15篇 |
2016年 | 24篇 |
2015年 | 40篇 |
2014年 | 36篇 |
2013年 | 153篇 |
2012年 | 25篇 |
2011年 | 33篇 |
2010年 | 50篇 |
2009年 | 43篇 |
2008年 | 53篇 |
2007年 | 55篇 |
2006年 | 35篇 |
2005年 | 43篇 |
2004年 | 25篇 |
2003年 | 18篇 |
2002年 | 29篇 |
2001年 | 26篇 |
2000年 | 19篇 |
1999年 | 44篇 |
1998年 | 24篇 |
1997年 | 32篇 |
1996年 | 19篇 |
1995年 | 18篇 |
1994年 | 21篇 |
1993年 | 14篇 |
1992年 | 9篇 |
1991年 | 9篇 |
1990年 | 12篇 |
1989年 | 10篇 |
1988年 | 9篇 |
1987年 | 11篇 |
1986年 | 4篇 |
1985年 | 3篇 |
1983年 | 8篇 |
1982年 | 3篇 |
1981年 | 2篇 |
1979年 | 3篇 |
1978年 | 3篇 |
1975年 | 2篇 |
1973年 | 3篇 |
1972年 | 4篇 |
1971年 | 2篇 |
1970年 | 3篇 |
1968年 | 2篇 |
排序方式: 共有1090条查询结果,搜索用时 31 毫秒
91.
An area defense consists of several groups that act independently, i.e., do not communicate with each other. Each group has a fixed number of defenders and a controller that allocates these defenders optimally against the individual attackers comprising an attack. We analyze the effectiveness of this partially coordinated defense against a simultaneous attack of known size in which all attackers are considered to be equally lethal. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
92.
We consider the problem of finding the Kth shortest path for a time‐schedule network, where each node in the network has a list of prespecified departure times, and departure from the node can take place only at one of these departure times. We develop a polynomial time algorithm independent of K for finding the Kth shortest path. The proposed algorithm constructs a map structure at each node in the network, using which we can directly find the Kth shortest path without having to enumerate the first K − 1 paths. Since the same map structure is used for different K values, it is not necessary to reconstruct the table for additional paths. Consequently, the algorithm is suitable for directly finding multiple shortest paths in the same network. Furthermore, the algorithm is modified slightly for enumerating the first K shortest paths and is shown to have the lowest possible time complexity under a condition that holds for most practical networks. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
93.
We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
94.
95.
层次分析法在野战仓库选址中的运用研究 总被引:3,自引:3,他引:0
野战仓库在现代高技术局部战争中发挥着极其重要的作用,其库址的合理选择,是野战仓库建设中至关重要的一步。采用层次分析法(AHP),结合野战仓库的职能,从地形良好、位置恰当、地幅适当、交通方便四个方面出发,科学地分析了野战仓库选址过程中的各种影响因素,并得出它们在野战仓库选址中的重要性排序;采用层次分析法大大简化了野战仓库的选址过程,具有一定的适用性。 相似文献
96.
大型消磁站设计中消磁兼容性分析 总被引:3,自引:2,他引:1
针对大型消磁站的消磁兼容性,基于通电线圈磁场计算,分析大型消磁站补偿线圈安匝组合,提出磁探头的布局问题,为大型消磁站消磁线圈的计算设计方案提供了参考依据. 相似文献
97.
98.
99.
群众路线是我们党创造性地运用马克思主义的群众观点创立的根本路线,是我们党的优良传统和政治优势.新形势下坚持群众路线,是巩固党的执政地位的必然要求,是推进中国特色社会主义宏伟事业的强大动力,是构建社会主义和谐社会的重要因素,是党的执政能力建设和作风建设的核心所在.当前要结合人民群众的新特点,探索坚持群众路线的新规律;着眼人民群众的新诉求,拓展坚持群众路线的新载体;汲取人民群众的新创见,丰富坚持群众路线的新形式,不断开创坚持群众路线的新局面. 相似文献
100.
阐述电磁防护工作中仿生研究所需要涉及的学科类型和基本内容,对所做工作在整个仿生领域中进行大致的定位;提出生物一电子研究的对等模型、总体构成和实现基础,细化具体研究的方向、设想和防护模式,并从原型实现的工程角度介绍实施策略,使得复杂电磁干扰环境下控制系统板卡及芯片级防护的仿生构想在技术上成为可能。 相似文献