全文获取类型
收费全文 | 150篇 |
免费 | 29篇 |
国内免费 | 34篇 |
出版年
2024年 | 1篇 |
2023年 | 1篇 |
2021年 | 1篇 |
2020年 | 2篇 |
2019年 | 3篇 |
2018年 | 2篇 |
2017年 | 5篇 |
2016年 | 11篇 |
2015年 | 5篇 |
2014年 | 14篇 |
2013年 | 13篇 |
2012年 | 20篇 |
2011年 | 21篇 |
2010年 | 16篇 |
2009年 | 20篇 |
2008年 | 14篇 |
2007年 | 12篇 |
2006年 | 9篇 |
2005年 | 5篇 |
2004年 | 6篇 |
2003年 | 7篇 |
2002年 | 2篇 |
2001年 | 3篇 |
2000年 | 2篇 |
1999年 | 5篇 |
1998年 | 5篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1990年 | 1篇 |
1988年 | 1篇 |
排序方式: 共有213条查询结果,搜索用时 15 毫秒
111.
112.
时序电路测试产生过程中,在进行敏化路径选择时会遇到失败问题.本文针对迭代组合阵列模型测试中产生的这些问题进行了有益的探讨,并提出了改进的时序电路测试产生算法,使之更加完善. 相似文献
113.
We present a stochastic optimization model for planning capacity expansion under capacity deterioration and demand uncertainty. The paper focuses on the electric sector, although the methodology can be used in other applications. The goals of the model are deciding which energy types must be installed, and when. Another goal is providing an initial generation plan for short periods of the planning horizon that might be adequately modified in real time assuming penalties in the operation cost. Uncertainty is modeled under the assumption that the demand is a random vector. The cost of the risk associated with decisions that may need some tuning in the future is included in the objective function. The proposed scheme to solve the nonlinear stochastic optimization model is Generalized Benders' decomposition. We also exploit the Benders' subproblem structure to solve it efficiently. Computational results for moderate‐size problems are presented along with comparison to a general‐purpose nonlinear optimization package. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:662–683, 2001 相似文献
114.
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 相似文献
115.
116.
117.
课程建设需要把握的几个问题 总被引:2,自引:0,他引:2
迟宝山 《装甲兵工程学院学报》2003,17(4):1-2
课程建设是一项系统工程,影响课程建设的因素很多,目前院校的课程建设尚存在一些问题,在一定程度上影响着教学质量的提高。文章主要针对学院新一轮课程建设的有关问题进行探讨。 相似文献
118.
针对武器装备建设过程中需求不够明确、不够准确和不够科学的现状,从联合作战的角度出发,以“基于能力”的武器装备建设思想为指导,对“任务体系→能力体系→装备体系”的装备体系需求生成过程进行了深入研究,并与传统装备体系需求生成过程进行了比较。 相似文献
119.
120.