全文获取类型
收费全文 | 144篇 |
免费 | 32篇 |
国内免费 | 12篇 |
出版年
2024年 | 1篇 |
2023年 | 1篇 |
2021年 | 3篇 |
2020年 | 1篇 |
2019年 | 1篇 |
2017年 | 7篇 |
2016年 | 7篇 |
2015年 | 6篇 |
2014年 | 12篇 |
2013年 | 14篇 |
2012年 | 12篇 |
2011年 | 16篇 |
2010年 | 10篇 |
2009年 | 7篇 |
2008年 | 17篇 |
2007年 | 6篇 |
2006年 | 16篇 |
2005年 | 5篇 |
2004年 | 10篇 |
2003年 | 6篇 |
2002年 | 4篇 |
2001年 | 4篇 |
2000年 | 1篇 |
1999年 | 6篇 |
1998年 | 5篇 |
1996年 | 3篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 1篇 |
排序方式: 共有188条查询结果,搜索用时 15 毫秒
91.
IEEE1149.1边界扫描机制是一种新型的VLSI电路测试及可测试性设计的有效方法,为了高效地应用边界扫描机制对电路系统进行测试,必须对其所涉及的理论方法进行深入探讨。本文应用布尔矩阵理论建立起边界扫描测试的数学描述模型,并基于所建立的模型导出了边界扫描测试中的故障检测条件和故障隔离条件。为边界扫描测试生成算法的深入研究奠定了理论基础。 相似文献
92.
介绍超宽带线性调频信号基带的数字产生方法及其实现技术。首先对线性调频信号的两种主要数字产生方法进行了简要阐述和比较,然后根据波形存储直读法提出了一种超宽带线性调频信号产生方案,分析了基带数字产生的主要关键技术,并进行了系统实现和测试。测试结果表明本文所提出的方法是可行的。 相似文献
93.
94.
95.
时序电路测试产生过程中,在进行敏化路径选择时会遇到失败问题.本文针对迭代组合阵列模型测试中产生的这些问题进行了有益的探讨,并提出了改进的时序电路测试产生算法,使之更加完善. 相似文献
96.
目标的规避过程与搜索运动 总被引:1,自引:1,他引:0
应用随机过程的观点,研究了静态目标和动态目标的几种规避方式、运动规律和目标位置的概率分布,导出了在上述几种情况下对规避目标的最优(理论)搜索计划。 相似文献
97.
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 相似文献
98.
罗德春 《装甲兵工程学院学报》2001,15(4):67-72
通过对我院CAI现状和导致该现状原因的分析,提出了我院CAI的发展方向和需要解决的问题,并在此基础上研究开发了通用数字化教案创作系统. 相似文献
99.
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 相似文献
100.