全文获取类型
收费全文 | 438篇 |
免费 | 12篇 |
国内免费 | 5篇 |
专业分类
455篇 |
出版年
2025年 | 2篇 |
2024年 | 1篇 |
2023年 | 13篇 |
2022年 | 5篇 |
2021年 | 4篇 |
2020年 | 8篇 |
2019年 | 9篇 |
2018年 | 1篇 |
2017年 | 20篇 |
2016年 | 27篇 |
2015年 | 22篇 |
2014年 | 25篇 |
2013年 | 20篇 |
2012年 | 23篇 |
2011年 | 21篇 |
2010年 | 16篇 |
2009年 | 32篇 |
2008年 | 21篇 |
2007年 | 24篇 |
2006年 | 32篇 |
2005年 | 15篇 |
2004年 | 20篇 |
2003年 | 9篇 |
2002年 | 7篇 |
2001年 | 12篇 |
2000年 | 10篇 |
1999年 | 4篇 |
1998年 | 5篇 |
1997年 | 7篇 |
1996年 | 5篇 |
1995年 | 4篇 |
1994年 | 3篇 |
1993年 | 6篇 |
1992年 | 5篇 |
1991年 | 5篇 |
1990年 | 9篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有455条查询结果,搜索用时 0 毫秒
101.
一种基于知识的作战计划系统设计 总被引:1,自引:1,他引:0
作战计划系统是复杂的问题求解系统,在军事领域的各个方面发挥着重要的作用。介绍了当前一些主要的作战计划辅助生成系统及其特点,分析比较和归纳整理了当前军用计划系统所采用的一些常见规划技术和优缺点,重点分析了作战计划系统中的智能规划技术。在此基础上,提出了一种基于知识的作战计划辅助生成系统的开发设想,构建了系统知识库,系统采用层级任务网络规划技术,给出了这种规划技术的理论框架和算法过程,并且把这种技术与多主体规划技术相结合,辅助实现军事作战任务的逐层分解与规划优化,进而生成完整的行动序列,较好地解决了作战计划辅助生成问题。 相似文献
102.
103.
We present a tactical decision model for order acceptance and capacity planning that maximizes the expected profits from accepted orders, allowing for aggregate regular as well as nonregular capacity. The stream of incoming order arrivals is the main source of uncertainty in dynamic order acceptance and the company only has forecasts of the main properties of the future incoming projects. Project proposals arrive sequentially with deterministic interarrival times and a decision on order acceptance and capacity planning needs to be made each time a proposal arrives and its project characteristics are revealed. We apply stochastic dynamic programming to determine a profit threshold for the accept/reject decision as well as to deterministically allocate a single bottleneck resource to the accepted projects, both with an eye on maximizing the expected revenues within the problem horizon. We derive a number of managerial insights based on an analysis of the influence of project and environmental characteristics on optimal project selection and aggregate capacity usage. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
104.
We consider a system that depends on a single vital component. If this component fails, the system life will terminate. If the component is replaced before its failure then the system life may be extended; however, there are only a finite number of spare components. In addition, the lifetimes of these spare components are not necessarily identically distributed. We propose a model for scheduling component replacements so as to maximize the expected system survival. We find the counterintuitive result that when comparing components' general lifetime distributions based on stochastic orderings, not even the strongest ordering provides an a priori guarantee of the optimal sequencing of components. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
105.
空天协同对地观测是对地观测领域的新趋势。为解决现有空天资源规划调度系统相对独立、协同困难的问题,分析总结了SWE(Sensor Web Enablement)标准,并在此基础上提出了空天资源对地观测协同任务规划服务模型。在此模型中,为实现观测资源共享,建立了空天观测资源传感器描述模型,能够描述典型空天资源的载荷平台、观测机理、定位信息、使用约束和工作特性等信息;为简化观测请求交互流程,基于SOA技术对SWE标准操作进行封装及简化,用户可以在不了解观测平台细节信息的情况下提交观测数据请求。为验证模型有效性,构建了空天资源对地观测协同任务规划实验平台,结果表明该模型具有较强的可实现性和适应性。 相似文献
106.
提出了一种基于M u lti-A gen t的虚拟维修训练系统(VM TS)结构框架,整个系统分别由主控A gen t、仿真A gen t、和接口A gen t3个具有交互作用的A gen t组成,从而将虚拟维修训练系统的开发转化为一个多A gen t系统的设计与开发。基于多A gen t的框架结构可实现受训者的智能模型及虚拟训练场景中虚拟物体的行为模型,从而可以提高VM TS的健壮性和可重用性。基于A gen t的概念模型实现了A gen t之间的交互和协作,并介绍了主控A gen t和仿真A gen t的具体实现方法。 相似文献
107.
用非线性规划求解有限推力最优交会 总被引:8,自引:0,他引:8
利用非线性规划方法研究了航天器的有限推力最优交会问题。这种方法利用了近年来发展起来的直接优化技术,用分段多项式来表示整个轨道的状态和控制向量,将最优控制问题转化为非线性规划问题。在应用这种方法时,先将整个轨道分为若干推力段和无推力段,然后利用配置方法产生推力段的约束段,利用状态转移矩阵来产生无推力段的约束。最后,对共面轨道情况下的交会进行了数值仿真,验证了方法的有效性和鲁棒性。 相似文献
108.
109.
Joni Driessen;Joost de Kruijff;Joachim Arts;Geert-Jan van Houtum; 《海军后勤学研究》2024,71(2):189-209
A line replaceable unit (LRU) is a collection of connected parts in a system that is replaced when any part of the LRU fails. Companies use LRUs as a mechanism to reduce downtime of systems following a failure. The design of LRUs determines how fast a replacement is performed, so a smart design reduces replacement and downtime cost. A firm must purchase/repair a LRU upon failure, and large LRUs are more expensive to purchase/repair. Hence, a firm seeks to design LRUs such that the average costs per time unit are minimized. We formalize this problem in a new model that captures how parts in a system are connected, and how they are disassembled from the system. Our model optimizes the design of LRUs such that the replacement (and downtime) costs and LRU purchase/repair costs are minimized. We present a set partitioning formulation for which we prove a rare result: the optimal solution is integer, despite a nonintegral feasible polyhedron. Second, we formulate our problem as a binary linear program (BLP). The article concludes by numerically comparing the computation times of both formulations and illustrates the effects of various parameters on the model's outcome. 相似文献
110.
Dimitri P. Bertsekas 《海军后勤学研究》2019,66(1):15-37
In this article, we consider shortest path problems in a directed graph where the transitions between nodes are subject to uncertainty. We use a minimax formulation, where the objective is to guarantee that a special destination state is reached with a minimum cost path under the worst possible instance of the uncertainty. Problems of this type arise, among others, in planning and pursuit‐evasion contexts, and in model predictive control. Our analysis makes use of the recently developed theory of abstract semicontractive dynamic programming models. We investigate questions of existence and uniqueness of solution of the optimality equation, existence of optimal paths, and the validity of various algorithms patterned after the classical methods of value and policy iteration, as well as a Dijkstra‐like algorithm for problems with nonnegative arc lengths.© 2016 Wiley Periodicals, Inc. Naval Research Logistics 66:15–37, 2019 相似文献