全文获取类型
收费全文 | 204篇 |
免费 | 189篇 |
国内免费 | 32篇 |
出版年
2024年 | 2篇 |
2023年 | 6篇 |
2022年 | 4篇 |
2021年 | 2篇 |
2020年 | 11篇 |
2019年 | 4篇 |
2018年 | 2篇 |
2017年 | 12篇 |
2016年 | 15篇 |
2015年 | 18篇 |
2014年 | 20篇 |
2013年 | 17篇 |
2012年 | 26篇 |
2011年 | 22篇 |
2010年 | 9篇 |
2009年 | 28篇 |
2008年 | 17篇 |
2007年 | 13篇 |
2006年 | 14篇 |
2005年 | 15篇 |
2004年 | 21篇 |
2003年 | 14篇 |
2002年 | 14篇 |
2001年 | 15篇 |
2000年 | 15篇 |
1999年 | 15篇 |
1998年 | 15篇 |
1997年 | 11篇 |
1996年 | 9篇 |
1995年 | 5篇 |
1994年 | 9篇 |
1993年 | 8篇 |
1992年 | 4篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 7篇 |
1975年 | 1篇 |
排序方式: 共有425条查询结果,搜索用时 281 毫秒
161.
This paper presents a branch‐and‐price algorithm for scheduling n jobs on m nonhomogeneous parallel machines with multiple time windows. An additional feature of the problem is that each job falls into one of ρ priority classes and may require two operations. The objective is to maximize the weighted number of jobs scheduled, where a job in a higher priority class has “infinitely” more weight or value than a job in a lower priority class. The methodology makes use of a greedy randomized adaptive search procedure (GRASP) to find feasible solutions during implicit enumeration and a two‐cycle elimination heuristic when solving the pricing subproblems. Extensive computational results are presented based on data from an application involving the use of communications relay satellites. Many 100‐job instances that were believed to be beyond the capability of exact methods, were solved within minutes. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
162.
视准式光学系统瞄准具的成像有主像和副像两种情形,主像是对目标瞄准的必要标志,副像则对目标的瞄准产生不良影响,为消除或减弱光学系统所成的副像对瞄准精度的影响,主要分析了光学系统中中心反射镜的反射和有无平行差时产生副像的原因.提出了消除或减弱副像的多项措施,并针对中心反射镜提出了两种截然相反地改进方法.可有效地消除或减弱副像所引起的不良干扰对飞行人员视觉的影响,有效地提高了观察效果和瞄准精度. 相似文献
163.
在故障树近似计算时,探讨通过加权提高计算准确度的简便方法。根据底事件发生概率的不同,利用VisualC 语言进行蒙特卡罗仿真计算,得到了在近似计算故障树顶事件发生概率时,在不同底事件发生概率对应区间内的最优权因子。利用该方法得到的最优权因子可以提高故障树近似计算的准确度,尤其是在当底事件发生概率较大时,其效果更为明显,可较好地满足采用故障树对某些特殊设备进行顶事件发生概率计算时提高计算精度的需求。 相似文献
164.
网格方程组并行计算预条件迭代若干性质及应用 总被引:3,自引:0,他引:3
对网格方程组作区域分裂并行计算 ;分析了预条件迭代谱条件的若干性质及其对算法收敛性的影响 ,为构造预处理提供了理论依据 ,并应用于区域分裂并行计算 相似文献
165.
应用改进的条形传递函数方法 ,建立了弹性薄板的二结线四自由度条形单元模型 ,用于分析系统的静力响应。用结线将矩形区域划分为条形单元 ,将边界结线离散 ,以内部结线和边界结点的位移和转角为未知量 ,采用三次插值 ,得到能够与有限元单元耦合求解的超级单元。利用广义函数给出了一种精确积分方法 ,可以得到有关矩阵的显式表达 ,得到提高了求解精度和效率。 相似文献
166.
167.
介绍了数字化装甲营作战仿真实验室的支撑软件组成、结构和功能.军事指挥人员(建模人员)利用支撑软件按照自己的意图,快速制定作战想定,兵力、兵器部署的系统模型,通过系统模型的运行,实现战斗进程的逼真模拟,实施人在环、部分实装在环的装甲兵分队作战指挥对抗演习和实验,完成装甲兵分队的战术和技术训练任务,为装甲兵部队作战理论研究,人员训练,装备作战效能评估,技术保障研究和院校各专业技术人才培养提供高技术的软件平台,并且快速确定系统模型的可信度指标,为上级机关决策的合理化提供有力的支持. 相似文献
168.
In this article, we study a parallel machine scheduling problem with inclusive processing set restrictions and the option of job rejection. In the problem, each job is compatible to a subset of machines, and machines are linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process (but not conversely). To achieve a tight production due date, some of the jobs might be rejected at certain penalty. We first study the problem of minimizing the makespan of all accepted jobs plus the total penalty cost of all rejected jobs, where we develop a ‐approximation algorithm with a time complexity of . We then study two bicriteria variants of the problem. For the variant problem of minimizing the makespan subject to a given bound on the total rejection cost, we develop a ‐approximation algorithm with a time complexity of . For the variant problem of maximizing the total rejection cost of the accepted jobs subject to a given bound on the makespan, we present a 0.5‐approximation algorithm with a time complexity of . © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 667–681, 2017 相似文献
169.
A model for geographically distributed combat interactions of swarming naval and air forces
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
This article describes the Distributed Interaction Campaign Model (DICM), an exploratory campaign analysis tool and asset allocation decision‐aid for managing geographically distributed and swarming naval and air forces. The model is capable of fast operation, while accounting for uncertainty in an opponent's plan. It is intended for use by commanders and analysts who have limited time for model runs, or a finite budget. The model is purpose‐built for the Pentagon's Office of Net Assessment, and supports analysis of the following questions: What happens when swarms of geographically distributed naval and air forces engage each other and what are the key elements of the opponents’ force to attack? Are there changes to force structure that make a force more effective, and what impacts will disruptions in enemy command and control and wide‐area surveillance have? Which insights are to be gained by fast exploratory mathematical/computational campaign analysis to augment and replace expensive and time‐consuming simulations? An illustrative example of model use is described in a simple test scenario. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 562–576, 2016 相似文献
170.