全文获取类型
收费全文 | 329篇 |
免费 | 200篇 |
国内免费 | 16篇 |
出版年
2024年 | 3篇 |
2023年 | 9篇 |
2022年 | 6篇 |
2021年 | 8篇 |
2020年 | 11篇 |
2019年 | 6篇 |
2018年 | 11篇 |
2017年 | 18篇 |
2016年 | 26篇 |
2015年 | 24篇 |
2014年 | 22篇 |
2013年 | 22篇 |
2012年 | 39篇 |
2011年 | 28篇 |
2010年 | 18篇 |
2009年 | 27篇 |
2008年 | 22篇 |
2007年 | 23篇 |
2006年 | 33篇 |
2005年 | 30篇 |
2004年 | 24篇 |
2003年 | 14篇 |
2002年 | 16篇 |
2001年 | 17篇 |
2000年 | 22篇 |
1999年 | 16篇 |
1998年 | 12篇 |
1997年 | 3篇 |
1996年 | 6篇 |
1995年 | 4篇 |
1994年 | 4篇 |
1993年 | 5篇 |
1992年 | 2篇 |
1991年 | 5篇 |
1990年 | 6篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有545条查询结果,搜索用时 906 毫秒
71.
72.
采用空间二阶精度的交替方向隐式分解的NND格式求解完全气体假定下的非定常薄层近似Navier Stokes方程 ,并采用抛物化的椭圆型方程生成复杂带翼外形的空间网格。最后给出了类升力体外形在M∞ =8 0 ,α =2 0°下的流场计算结果。 相似文献
73.
This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000 相似文献
74.
In this short note we study a two‐machine flowshop scheduling problem with the additional no‐idle feasibility constraint and the total completion time criterion function. We show that one of the few papers which deal with this special problem contains incorrect claims and suggest a way how these claims can be rectified. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47:353–358, 2000 相似文献
75.
Kenneth R. Baker 《海军后勤学研究》1999,46(8):978-991
This paper examines heuristic solution procedures for scheduling jobs on a single machine to minimize the maximum lateness in the presence of setup times between different job families. It reviews the state of knowledge about the solution of this problem, which is known to be difficult to solve in general, and examines natural solution approaches derived from some of the underlying theory. The emphasis is on the design and computational evaluation of new heuristic procedures. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 978–991, 1999 相似文献
76.
对抗模拟是作战模拟中的一种重要方法,文章就其基本原理作了系统深入的探讨.通过中外专家的论述,阐述了对抗模拟概念的关键要素.通过对信息流动的分析,进一步剖析了对抗模拟的内涵.对抗模拟这种作战模拟形式具有仿真性、拟剧性、博弈性和不可重复性等特征.按照层次、信息提供的方式、结果评价的方式、实施的方式、运用的工具以及地域等区分了不同类型的对抗模拟.对抗模拟需要的关键仿真技术包括分布交互仿真、人工智能、虚拟现实以及信息网格等方面. 相似文献
77.
在分析基于格理论的信息流控制军用安全模型在实际应用中存在的不足的基础上,从安全类定义和信息流控制策略两个方面对原模型进行了理论扩展和安全性分析.扩展模型安全类在作为对象和主体时具有相同的表达方式,以及在保持原模型信息流关系情况下,允许同职权等级用户交流他们共知的信息,以及高职权等级用户访问低职权等级用户他们之间共知的信息.以数字文档安全管理系统为例对扩展模型应用进行了描述.实例表明扩展模型更适合实际系统对信息流控制的要求. 相似文献
78.
In this paper we consider the discrete time/resource trade-off problem in project networks. Given a project network consisting of nodes (activities) and arcs (technological precedence relations), in which the duration of the activities is a discrete, nonincreasing function of the amount of a single renewable resource committed to it, the discrete time/resource trade-off problem minimizes the project makespan subject to precedence constraints and a single renewable resource constraint. For each activity, a work content is specified such that all execution modes (duration/resource requirement pairs) for performing the activity are allowed as long as the product of the duration and the resource requirement is at least as large as the specified work content. We present a tabu search procedure which is based on a decomposition of the problem into a mode assignment phase and a resource-constrained project scheduling phase with fixed mode assignments. Extensive computational experience, including a comparison with other local search methods, is reported. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 553–578, 1998 相似文献
79.
We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998 相似文献
80.
采用粒子仿真方法直接跟踪颗粒相运动轨迹,采用NND格式求解NS方程,数值模拟了气-固两相自由射流流场.计算结果表明,将粒子仿真与CFD方法相结合是研究气-固两相流动问题的有效途径.颗粒相参数变化将对气体流场产生一定影响. 相似文献