首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   74篇
  免费   13篇
  2022年   1篇
  2021年   3篇
  2020年   3篇
  2017年   2篇
  2016年   1篇
  2015年   1篇
  2014年   1篇
  2013年   1篇
  2012年   1篇
  2011年   2篇
  2010年   3篇
  2009年   4篇
  2008年   4篇
  2007年   3篇
  2006年   1篇
  2005年   3篇
  2004年   3篇
  2003年   1篇
  2001年   4篇
  2000年   5篇
  1999年   8篇
  1998年   6篇
  1997年   9篇
  1996年   2篇
  1995年   2篇
  1994年   5篇
  1993年   4篇
  1990年   3篇
  1988年   1篇
排序方式: 共有87条查询结果,搜索用时 15 毫秒
21.
本文研究再入弹道参数的自适应估计。所采用的方法对动力学模型噪声的未知统计特性进行补偿,并对状态参数与测量设备的系统误差交叉进行估计。仿真结果表明,无论是状态参数的估计还是测量系统误差的估计,都具有较高的精度。  相似文献   
22.
采用去耦合法,在未作任何假定的条件下,导出了一个新的点堆中子密度方程.该方程与老的中子密度方程相比,其精度和应用范围都有很大的提高.  相似文献   
23.
本文综述了语音识别领域里的主要技术。首先,系统地介绍了孤立词识别系统中的算法和技术。然后,简要介绍了连续语音识别系统中的主要处理方法。最后,说明了语音理解系统中的特殊问题。  相似文献   
24.
在导弹飞行试验中,遥外测数据是进行精度和可靠性分析的依据。通常假定外测误差服从零均值正态分布,而在实际测量中,外测参数有可能带有系统误差,它的存在对飞行轨道和落点信息的获取都具有不利的影响。在一定的模型假设下,本文获得了外测系统误差的估计,并对一些仿真结果进行了初步分析。  相似文献   
25.
本文在基本的像素处理算法的基础上,提出了一种基于查找表的快速平滑插值算法。该算法不仅运算量小、精度较高,而且易于硬件实现,适合于高速显示处理系统中。  相似文献   
26.
Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well‐known NP‐hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optimality of the sequence within the framework of probabilistic analysis. Our main result is that, when the processing times are randomly and independently drawn from the same uniform distribution, the sequence is asymptotically optimal in the sense that its relative error converges to zero in probability as n increases. Other theoretical results are also derived, including: (i) When the processing times follow a symmetric structure, the problem has 2⌊(n−1)/2⌋ optimal sequences, which include our proposed sequence and other heuristic sequences suggested in the literature; and (ii) when these 2⌊(n−1)/2⌋ sequences are used as approximate solutions for a general problem, our proposed sequence yields the best approximation (in an average sense) while another sequence, which is commonly believed to be a good approximation in the literature, is interestingly the worst. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 373–398, 1999  相似文献   
27.
We consider the problem of scheduling multiprocessor tasks with prespecified processor allocations to minimize the total completion time. The complexity of both preemptive and nonpreemptive cases of the two-processor problem are studied. We show that the preemptive case is solvable in O(n log n) time. In the nonpreemptive case, we prove that the problem is NP-hard in the strong sense, which answers an open question mentioned in Hoogeveen, van de Velde, and Veltman (1994). An efficient heuristic is also developed for this case. The relative error of this heuristic is at most 100%. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 231–242, 1998  相似文献   
28.
We examine the problem of scheduling n jobs with a common due date on a single machine. The processing time of each job is a random variable, which follows an arbitrary distribution with a known mean and a known variance. The machine is not reliable; it is subject to stochastic breakdowns. The objective is to minimize the expected sum of squared deviations of job completion times from the due date. Two versions of the problem are addressed. In the first one the due date is a given constant, whereas in the second one the due date is a decision variable. In each case, a general form of the deterministic equivalent of the stochastic scheduling problem is obtained when the counting process related to the machine uptime distribution is a generalized Poisson process. A sufficient condition is derived under which optimal sequences are V-shaped with respect to mean processing times. Other characterizations of optimal solutions are also established. Based on the optimality properties, algorithms with pseudopolynomial time complexity are proposed to solve both versions of the problem. © 1996 John Wiley & Sons, Inc.  相似文献   
29.
教学行动研究是语言教学研究的一种重要形式,它来源于教学,服务于教学,是一种适合教师从事教学研究的方法。本文简介了教学行动研究的概念和特征,实施教学行动研究的基本步骤和研究方法,以及其在大学英语教学中的应用。  相似文献   
30.
适应加快培养联合作战指挥人才需要,政治院校必须以高度的自觉性和强烈的紧迫感认真搞好联合作战政工指挥人才教育训练;必须紧紧围绕其核心素质能力要求,把握教育训练重点;必须注重教学力量建设,改进组训模式和教学方法,提高教育训练质量效益。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号