全文获取类型
收费全文 | 84篇 |
免费 | 31篇 |
国内免费 | 10篇 |
专业分类
125篇 |
出版年
2024年 | 1篇 |
2023年 | 1篇 |
2022年 | 1篇 |
2021年 | 2篇 |
2020年 | 1篇 |
2019年 | 3篇 |
2018年 | 2篇 |
2017年 | 4篇 |
2016年 | 5篇 |
2015年 | 2篇 |
2014年 | 10篇 |
2013年 | 7篇 |
2012年 | 9篇 |
2011年 | 8篇 |
2010年 | 8篇 |
2009年 | 5篇 |
2008年 | 10篇 |
2007年 | 5篇 |
2006年 | 7篇 |
2005年 | 4篇 |
2004年 | 6篇 |
2003年 | 4篇 |
2002年 | 2篇 |
2001年 | 1篇 |
2000年 | 1篇 |
1999年 | 4篇 |
1998年 | 4篇 |
1996年 | 3篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1990年 | 1篇 |
1988年 | 1篇 |
排序方式: 共有125条查询结果,搜索用时 0 毫秒
51.
提出一种基于视觉的星箭分离相对位姿测量方法。在相机内参数已知的情况下,将相机安装于运载火箭,并在卫星上固连不少于6个合作标志,利用相机对合作标志实时成像;基于单目位姿估计的基本原理,采用高效n点渗透与正交迭代结合的方式解算卫星与火箭之间的相对位姿关系。仿真实验结果、半实物仿真实验结果证明了所提测量方法的可行性和准确性。 相似文献
52.
高性能计算机的快速发展为数值模拟提供了必需的硬件环境,数值模拟领域对网格的需求已高达数十亿到数百亿量级,而网格生成作为数值模拟的重要一环,其发展则相对滞后,很难满足并行数值模拟求解器对大规模网格的需求.本文面向复杂几何模型提出一种多级并行四面体网格生成算法,该算法首先基于模型的几何特征建立网格的尺寸场,并基于尺寸场和几... 相似文献
53.
针对C4ISR需求生成的系统性问题,提出基于武器装备演化规律的C4ISR需求生成模式。根据武器装备在作战、系统、技术三个层面的演变规律,从任务模糊性、结构复杂性、技术不确定性三个维度划分目标武器装备,提出与演变规律对应的、逐层递进的C4ISR需求研究模式——复制、发现和创造,提供了解决C4ISR需求精确性问题、正确性问题和前瞻性问题的途径。实例表明,采用该模式能够系统地生成C4ISR需求。 相似文献
54.
55.
56.
针对武器装备建设过程中需求不够明确、不够准确和不够科学的现状,从联合作战的角度出发,以“基于能力”的武器装备建设思想为指导,对“任务体系→能力体系→装备体系”的装备体系需求生成过程进行了深入研究,并与传统装备体系需求生成过程进行了比较。 相似文献
57.
58.
Most machine scheduling models assume that the machines are available all of the time. However, in most realistic situations, machines need to be maintained and hence may become unavailable during certain periods. In this paper, we study the problem of processing a set of n jobs on m parallel machines where each machine must be maintained once during the planning horizon. Our objective is to schedule jobs and maintenance activities so that the total weighted completion time of jobs is minimized. Two cases are studied in this paper. In the first case, there are sufficient resources so that different machines can be maintained simultaneously if necessary. In the second case, only one machine can be maintained at any given time. In this paper, we first show that, even when all jobs have the same weight, both cases of the problem are NP-hard. We then propose branch and bound algorithms based on the column generation approach for solving both cases of the problem. Our algorithms are capable of optimally solving medium sized problems within a reasonable computational time. We note that the general problem where at most j machines, 1 ≤ j ≤ m, can be maintained simultaneously, can be solved similarly by the column generation approach proposed in this paper. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 145–165, 2000 相似文献
59.
We consider the multitasking scheduling problem on unrelated parallel machines to minimize the total weighted completion time. In this problem, each machine processes a set of jobs, while the processing of a selected job on a machine may be interrupted by other available jobs scheduled on the same machine but unfinished. To solve this problem, we propose an exact branch‐and‐price algorithm, where the master problem at each search node is solved by a novel column generation scheme, called in‐out column generation, to maintain the stability of the dual variables. We use a greedy heuristic to obtain a set of initial columns to start the in‐out column generation, and a hybrid strategy combining a genetic algorithm and an exact dynamic programming algorithm to solve the pricing subproblems approximately and exactly, respectively. Using randomly generated data, we conduct numerical studies to evaluate the performance of the proposed solution approach. We also examine the effects of multitasking on the scheduling outcomes, with which the decision maker can justify making investments to adopt or avoid multitasking. 相似文献
60.