全文获取类型
收费全文 | 326篇 |
免费 | 98篇 |
国内免费 | 27篇 |
出版年
2024年 | 1篇 |
2023年 | 2篇 |
2022年 | 5篇 |
2021年 | 2篇 |
2020年 | 14篇 |
2019年 | 3篇 |
2018年 | 7篇 |
2017年 | 26篇 |
2016年 | 31篇 |
2015年 | 8篇 |
2014年 | 33篇 |
2013年 | 19篇 |
2012年 | 22篇 |
2011年 | 31篇 |
2010年 | 20篇 |
2009年 | 25篇 |
2008年 | 29篇 |
2007年 | 20篇 |
2006年 | 15篇 |
2005年 | 21篇 |
2004年 | 15篇 |
2003年 | 11篇 |
2002年 | 18篇 |
2001年 | 14篇 |
2000年 | 10篇 |
1999年 | 8篇 |
1998年 | 5篇 |
1997年 | 6篇 |
1996年 | 4篇 |
1995年 | 5篇 |
1994年 | 4篇 |
1993年 | 5篇 |
1992年 | 4篇 |
1991年 | 1篇 |
1990年 | 6篇 |
1988年 | 1篇 |
排序方式: 共有451条查询结果,搜索用时 31 毫秒
291.
This article is a sequel to a recent article that appeared in this journal, “An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations” [ 17 ], in which an integer programming formulation to the problem of rescheduling in‐flight assets due to changes in battlespace conditions was presented. The purpose of this article is to present an improved branch‐and‐bound procedure to solve the dynamic resource management problem in a timely fashion, as in‐flight assets must be quickly re‐tasked to respond to the changing environment. To facilitate the rapid generation of attractive updated mission plans, this procedure uses a technique for reducing the solution space, supports branching on multiple decision variables simultaneously, incorporates additional valid cuts to strengthen the minimal network constraints of the original mathematical model, and includes improved objective function bounds. An extensive numerical analysis indicates that the proposed approach significantly outperforms traditional branch‐and‐bound methodologies and is capable of providing improved feasible solutions in a limited time. Although inspired by the dynamic resource management problem in particular, this approach promises to be an effective tool for solving other general types of vehicle routing problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
292.
In the Post-Bipolar Era the growing complexity of the military operations requires a new approach for the resolution of international crises. Since the end of the Cold War, peace support operations (PSO) have become the mainstay and principal occupation of most Western armies. At the same time, Italy has been one of the most important actors in such an area. The article focuses on the cooperation between military and civil components (a process called CIMIC) as a key variable in the Italian PSOs. We will analyse in detail the main lessons learned from past military interventions as well as the general context in which new tendencies are taking place. The maintaining of a minimum security frame becomes essential to fulfil activities ‘collateral’ to the mission: reconstructing services and infrastructure, food distribution, water and medication, law and order, de-mining, training of local forces, and supporting local institutions. These are the main tasks to obtain thrust and support from the population. 相似文献
293.
李晨光 《兵团教育学院学报》2013,(5):78-80
本着共同促进英语写作教学的目的,本文对现在普遍存在的英语写作教学困境及其原因进行分析,提出要使英语写作成为一种情感和思想交流,并试从提供创造性的写作话题、营造良好安全的写作氛围和创造真实的写作意境等三个方面提出建议。 相似文献
294.
针对通信电台的测试诊断问题,通过建立“故障一测试”相关性矩阵,提出了一种GADPSO算法与最大诊断信息量准则结合进行通信电台故障诊断的方法.GADPSO算法收敛速度快、计算精度高,既避免了陷入局部最优和早熟收敛,又提高了优化效率;最大诊断信息量准则能全面评判测试点,快速有效地获得测试顺序.该方法为通信电台故障诊断提供了一种高效诊断策略. 相似文献
295.
296.
等离子体对于高功率微波的攻击具有独特的防护效果。基于等离子体流体近似方法,利用COMSOL软件研究了高功率微波与柱状等离子体阵列相互作用过程中入射电场随时间的演变过程,分析了等离子体防护高功率微波的物理过程和作用机理。研究结果表明,入射的高功率微波会使等离子体参数发生剧烈变化,特别是其电子密度将急剧增加,从而使等离子体对入射的高功率微波表现出类似金属的电磁特性,最终实现对入射高功率微波的有效防护。此外,利用高频辉光放电产生柱状等离子体阵列,通过实验验证了等离子体对高功率微波的防护作用。最后,总结了基于等离子体的高功率微波防护技术需解决的主要问题。 相似文献
297.
We investigate the problem of scheduling a fleet of vehicles to visit the customers located on a path to minimize some regular function of the visiting times of the customers. For the single‐vehicle problem, we prove that it is pseudopolynomially solvable for any minsum objective and polynomially solvable for any minmax objective. Also, we establish the NP‐hardness of minimizing the weighted number of tardy customers and the total weighted tardiness, and present polynomial algorithms for their special cases with a common due date. For the multivehicle problem involving n customers, we show that an optimal solution can be found by solving or O(n) single‐vehicle problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 34–43, 2014 相似文献
298.
为解决星际网络场景下的数据传输问题,提出了一种星际容延迟网络路由协议:利用节点的历史连接信息来预测该节点与其各个邻居节点的连接恢复时间;当两个位于同一个域的节点互相连接时,交换彼此的连接时间预测表,并据此决定是否需要使用对方作为中继节点;深空节点的存储资源常常受限,在进行路由选择时将节点的存储区消耗情况也纳入决策。使用NS2进行地-火通信场景仿真,使用一种改进的泛洪路由和一种仅选择网关节点作为下一跳选择的路由策略作对比。仿真结果表明相比其他两种协议,提高了14%的投递成功率并减少了50%的平均传输延迟,并更有效的利用了节点存储资源。 相似文献
299.
300.