全文获取类型
收费全文 | 222篇 |
免费 | 71篇 |
国内免费 | 29篇 |
出版年
2024年 | 4篇 |
2023年 | 2篇 |
2022年 | 7篇 |
2021年 | 10篇 |
2020年 | 9篇 |
2019年 | 7篇 |
2018年 | 10篇 |
2017年 | 15篇 |
2016年 | 26篇 |
2015年 | 21篇 |
2014年 | 20篇 |
2013年 | 29篇 |
2012年 | 20篇 |
2011年 | 18篇 |
2010年 | 11篇 |
2009年 | 17篇 |
2008年 | 17篇 |
2007年 | 17篇 |
2006年 | 14篇 |
2005年 | 12篇 |
2004年 | 13篇 |
2003年 | 5篇 |
2002年 | 3篇 |
2001年 | 4篇 |
2000年 | 1篇 |
1999年 | 3篇 |
1998年 | 1篇 |
1997年 | 2篇 |
1992年 | 1篇 |
1990年 | 3篇 |
排序方式: 共有322条查询结果,搜索用时 15 毫秒
161.
在信息化海战场,获取信息优势是保障作战胜利的基础之一,海上编队传感器管理是提升传感器探测整体效能,从而达成信息优势的关键环节.首先分析了海上编队传感器管理需求,包括组成结构、作用以及编队、平台、传感器各层级的管理需求;其次研究了海上编队传感器管理的总体架构,提出采用混合式的体系结构,设计了事前规划与实时调度2个方面的处... 相似文献
162.
调运问题中基于栅格模型的快速路径规划方法 总被引:2,自引:2,他引:0
针对调运路径规划这一问题,采用栅格模型表示环境地图,通过设定路径搜索方向权重,剔除不必要的搜索区域,提高了搜索效率.仿真结果表明,该算法能有效地提高路径搜索效率,并能搜索到最优路径. 相似文献
163.
Logistical planning problems are complicated in practice because planners have to deal with the challenges of demand planning and supply replenishment, while taking into account the issues of (i) inventory perishability and storage charges, (ii) management of backlog and/or lost sales, and (iii) cost saving opportunities due to economies of scale in order replenishment and transportation. It is therefore not surprising that many logistical planning problems are computationally difficult, and finding a good solution to these problems necessitates the development of many ad hoc algorithmic procedures to address various features of the planning problems. In this article, we identify simple conditions and structural properties associated with these logistical planning problems in which the warehouse is managed as a cross‐docking facility. Despite the nonlinear cost structures in the problems, we show that a solution that is within ε‐optimality can be obtained by solving a related piece‐wise linear concave cost multi‐commodity network flow problem. An immediate consequence of this result is that certain classes of logistical planning problems can be approximated by a factor of (1 + ε) in polynomial time. This significantly improves upon the results found in literature for these classes of problems. We also show that the piece‐wise linear concave cost network flow problem can be approximated to within a logarithmic factor via a large scale linear programming relaxation. We use polymatroidal constraints to capture the piece‐wise concavity feature of the cost functions. This gives rise to a unified and generic LP‐based approach for a large class of complicated logistical planning problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
164.
针对虚拟士兵在城市作战仿真领域的需求,重点研究了虚拟士兵在城市环境中路径规划问题。通过对三维城市虚拟环境空间进行分层信息处理,生成虚拟士兵能够感知的虚拟信息层。用A*算法求出虚拟士兵从初始位置到达目标位置的最佳路径,并给出算法的具体设计与实现。 相似文献
165.
166.
167.
168.
Bence Nemeth 《Defense & Security Analysis》2016,32(4):321-335
Hungary, a former communist state, adapted a Western-style defense planning system during the 1990s and 2000s. Although on the surface the elements of this planning system were similar to the planning programming budgeting system (PPBS) developed by the US Department of Defense, strategic guidance for defense planning has not been properly developed until recently. Thus, albeit PPBS-based defense plans were developed in the Hungarian Ministry of Defense (Hungarian MoD) regularly, they lacked both an expression of clear priorities and strategic focus. This article delineates the evolution of strategic guidance in the Hungarian MoD concentrating on current developments, and introduces the newly elaborated analytical concepts and tools, which helped to create needed strategic guidance in Hungary. 相似文献
169.
170.