全文获取类型
收费全文 | 509篇 |
免费 | 98篇 |
国内免费 | 24篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 3篇 |
2021年 | 14篇 |
2020年 | 13篇 |
2019年 | 9篇 |
2018年 | 6篇 |
2017年 | 10篇 |
2016年 | 16篇 |
2015年 | 28篇 |
2014年 | 23篇 |
2013年 | 73篇 |
2012年 | 24篇 |
2011年 | 23篇 |
2010年 | 43篇 |
2009年 | 32篇 |
2008年 | 44篇 |
2007年 | 34篇 |
2006年 | 30篇 |
2005年 | 30篇 |
2004年 | 24篇 |
2003年 | 17篇 |
2002年 | 25篇 |
2001年 | 22篇 |
2000年 | 13篇 |
1999年 | 20篇 |
1998年 | 6篇 |
1997年 | 3篇 |
1996年 | 1篇 |
1995年 | 5篇 |
1994年 | 5篇 |
1993年 | 3篇 |
1992年 | 4篇 |
1991年 | 1篇 |
1990年 | 4篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 3篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1979年 | 1篇 |
1978年 | 3篇 |
1973年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有631条查询结果,搜索用时 15 毫秒
41.
仿生机器人运动建模与控制研究进展 总被引:1,自引:0,他引:1
综述了几何方法在仿生机器人运动建模和控制中应用的最新成果,探讨了在统一框架下处理多种机器人运动问题的可行性. 相似文献
42.
简述了弹药在贮存状态下的失效特点,建立了基于成败型试验数据的弹药贮存寿命评估数学模型和统计分析方法,评估了某种弹药在一定置信度下的可靠贮存寿命。 相似文献
43.
基于仿真模型与遗传算法的最优火力分配模型 总被引:3,自引:0,他引:3
李明 《军事运筹与系统工程》2005,19(4):45-47
针对装备了先进舰载防空武器系统的舰艇编队,需要航空兵与水面舰艇联合多批次打击才能取得满意战果,由于毁伤经验公式所限,现有的算法只能解决对舰艇编队一次打击的火力最优分配问题,而不能很好的解决对舰艇编队多次打击的火力最优分配问题。论文将仿真模型加入遗传算法运算过程中,利用仿真得出每次打击目标的毁伤状态,并将其结果作为遗传算法的参数进行寻优。 相似文献
44.
The coordination of production, supply, and distribution is an important issue in logistics and operations management. This paper develops and analyzes a single‐machine scheduling model that incorporates the scheduling of jobs and the pickup and delivery arrangements of the materials and finished jobs. In this model, there is a capacitated pickup and delivery vehicle that travels between the machine and the storage area, and the objective is to minimize the makespan of the schedule. The problem is strongly NP‐hard in general but is solvable in polynomial time when the job processing sequence is predetermined. An efficient heuristic is developed for the general problem. The effectiveness of the heuristic is studied both analytically and computationally. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
45.
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. 相似文献
46.
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. 相似文献
47.
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 相似文献
48.
层次分析法在野战仓库选址中的运用研究 总被引:3,自引:3,他引:0
野战仓库在现代高技术局部战争中发挥着极其重要的作用,其库址的合理选择,是野战仓库建设中至关重要的一步。采用层次分析法(AHP),结合野战仓库的职能,从地形良好、位置恰当、地幅适当、交通方便四个方面出发,科学地分析了野战仓库选址过程中的各种影响因素,并得出它们在野战仓库选址中的重要性排序;采用层次分析法大大简化了野战仓库的选址过程,具有一定的适用性。 相似文献
49.
大型消磁站设计中消磁兼容性分析 总被引:3,自引:2,他引:1
针对大型消磁站的消磁兼容性,基于通电线圈磁场计算,分析大型消磁站补偿线圈安匝组合,提出磁探头的布局问题,为大型消磁站消磁线圈的计算设计方案提供了参考依据. 相似文献
50.