全文获取类型
收费全文 | 172篇 |
免费 | 79篇 |
国内免费 | 6篇 |
出版年
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 5篇 |
2020年 | 9篇 |
2019年 | 3篇 |
2018年 | 4篇 |
2017年 | 9篇 |
2016年 | 12篇 |
2015年 | 12篇 |
2014年 | 13篇 |
2013年 | 12篇 |
2012年 | 15篇 |
2011年 | 18篇 |
2010年 | 6篇 |
2009年 | 14篇 |
2008年 | 10篇 |
2007年 | 9篇 |
2006年 | 18篇 |
2005年 | 18篇 |
2004年 | 14篇 |
2003年 | 7篇 |
2002年 | 6篇 |
2001年 | 6篇 |
2000年 | 12篇 |
1999年 | 7篇 |
1998年 | 10篇 |
1997年 | 1篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1991年 | 1篇 |
排序方式: 共有257条查询结果,搜索用时 15 毫秒
231.
科学合理地调度预警卫星传感器资源是提高弹道导弹预警作战效能的重要手段.在预警卫星传感器资源(主要是凝视探测器)有限而进攻弹道导弹目标数量较多时,利用最小信息损失准则,将传感器调度问题转化为最优访问路径问题进行建模研究,满足了导弹预警资源调度的需要,仿真结果验证了模型的可靠性和可用性. 相似文献
232.
合理安排导航卫星与地面上注站星地链路构建与导航电文上注,对保证星上导航电文的准确性和精确性有着重要意义。对卫星导航系统上行注入过程进行了分析,构建了上行注入任务调度问题的多目标混合整数规划模型,设计了基于规则的启发式求解算法。基于北斗二代和美国的GPS卫星导航系统构建仿真场景,仿真结果验证了模型和算法的正确性、可行性;通过分析仿真结果,得到影响卫星导航系统上行注入任务完成的关键因素。 相似文献
233.
根据舰艇防空武器拦截过程的时间连续性和拦截效果的不确定性特点,提出了智能规划和优化调度相结合的舰艇防空计划生成方法。在规划阶段,先用智能规划描述语言PDDL对舰艇防空问题进行建模;针对新的来袭目标或观察的拦截结果,利用智能规划的高效行动推理能力,快速生成可能的备选行动方案;在优化调度阶段,对已生成的备选方案的行动系列进行时间、资源冲突处理,并计算选择出当前最佳拦截方案。与现有的采用离散化处理的武器-目标分配方法相比,该规划与调度过程充分体现了拦截过程的连续性,拦截效果的不确定性,拦截过程中的武器协同,以及最佳拦截时机的选择等,更好地描述了舰艇防空的实际过程。最后,通过蒙特卡罗仿真试验,验证了算法的有效性,为舰艇的自动化防空提供了一种新的解决办法。 相似文献
234.
针对当前装甲车辆综合电子系统节点消息传输不公平、紧急消息传输不及时等缺点,结合某型车辆消息紧急度和截止期,按照分层处理原则对总线协议进行了改进,提出了"分级决策动态均衡"的混合调度算法,并通过试验验证了算法的可行性和有效性。 相似文献
235.
We study new models of scheduled maintenance management for modular systems, consisting of multiple components with respective cycle limits. The cycle limit of each component specifies the time interval in which this component must be repaired or replaced. The goal is to compute a feasible maintenance schedule that minimizes the cost associated with component maintenance. Applications of these models arise in Air Force aircraft maintenance as well as in other arenas with required preventive maintenance. The typical cost structures that arise in practical settings are submodular, which make the resulting models computationally challenging. We develop two efficient and operationally tenable approximation algorithms. We prove constant factor worst‐case guarantees for both algorithms, and present computational experiments showing that these algorithms perform within a few percent of optimality on operationally relevant instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 472–488, 2014 相似文献
236.
This article introduces the twin robots scheduling problem (TRSP), in which two robots positioned at the opposite ends of a rail are required to deliver items to positions along the rail, and the objective is to minimize the makespan. A proof of ‐hardness of the TRSP is presented, along with exact and heuristic algorithms. Computational results on challenging instances are provided.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 119–130, 2014 相似文献
237.
Frank Meisel 《海军后勤学研究》2011,58(7):619-636
The quay crane scheduling problem consists of scheduling tasks for loading and unloading containers on cranes that are assigned to a vessel for its service. This article introduces a new approach for quay crane scheduling, where the availability of cranes at a vessel is restricted to certain time windows. The problem is of practical relevance, because container terminal operators frequently redeploy cranes among vessels to speed up the service of high‐priority vessels while serving low‐priority vessels casually. This article provides a mathematical formulation of the problem and a tree‐search‐based heuristic solution method. A computational investigation on a large set of test instances is used to evaluate the performance of the heuristic and to identify the impact of differently structured crane time windows on the achievable vessel handling time. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
238.
许多嵌入式实时任务的实际执行时间往往小于最坏情况执行时间,因此可以产生大量的动态松弛时间.针对时限等于周期的偶发任务集,提出一种基于动态松弛时间回收的多核系统节能实时调度算法LRE-DVFS-ALL.该算法基于最优在线调度算法LRE-TL,利用TL面内节能实时调度思想,在每个TL面的提前完成时刻实现动态松弛时间回收,降... 相似文献
239.
通过分析航天测控调度问题的测控需求,建立了航天测控调度0-1整数规划模型,运用拉格朗日松弛方法对模型中的设备约束和卫星约束进行了松弛,运用次梯度优化算法求得了拉格朗日对偶问题的上界.最后,通过对两个场景的试验分析,证明了运用次梯度优化算法求得的上界的有效性. 相似文献
240.
The quay crane scheduling problem consists of determining a sequence of unloading and loading movements for cranes assigned to a vessel in order to minimize the vessel completion time as well as the crane idle times. Idle times originate from interferences between cranes since these roll on the same rails and a minimum safety distance must be maintained between them. The productivity of container terminals is often measured in terms of the time necessary to load and unload vessels by quay cranes, which are the most important and expensive equipment used in ports. We formulate the quay crane scheduling problem as a vehicle routing problem with side constraints, including precedence relationships between vertices. For small size instances our formulation can be solved by CPLEX. For larger ones we have developed a branch‐and‐cut algorithm incorporating several families of valid inequalities, which exploit the precedence constraints between vertices. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献