全文获取类型
收费全文 | 81篇 |
免费 | 42篇 |
国内免费 | 4篇 |
出版年
2023年 | 1篇 |
2022年 | 2篇 |
2021年 | 4篇 |
2020年 | 6篇 |
2019年 | 3篇 |
2018年 | 1篇 |
2017年 | 7篇 |
2016年 | 8篇 |
2015年 | 4篇 |
2014年 | 4篇 |
2013年 | 6篇 |
2012年 | 8篇 |
2011年 | 5篇 |
2010年 | 2篇 |
2009年 | 7篇 |
2008年 | 3篇 |
2007年 | 4篇 |
2006年 | 5篇 |
2005年 | 5篇 |
2004年 | 4篇 |
2003年 | 2篇 |
2002年 | 3篇 |
2001年 | 6篇 |
2000年 | 4篇 |
1999年 | 3篇 |
1998年 | 2篇 |
1997年 | 3篇 |
1996年 | 1篇 |
1994年 | 3篇 |
1993年 | 1篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 4篇 |
1989年 | 2篇 |
排序方式: 共有127条查询结果,搜索用时 406 毫秒
51.
Andreas Schirmer 《海军后勤学研究》2000,47(3):201-222
Most scheduling problems are notoriously intractable, so the majority of algorithms for them are heuristic in nature. Priority rule‐based methods still constitute the most important class of these heuristics. Of these, in turn, parametrized biased random sampling methods have attracted particular interest, due to the fact that they outperform all other priority rule‐based methods known. Yet, even the “best” such algorithms are unable to relate to the full range of instances of a problem: Usually there will exist instances on which other algorithms do better. We maintain that asking for the one best algorithm for a problem may be asking too much. The recently proposed concept of control schemes, which refers to algorithmic schemes allowing to steer parametrized algorithms, opens up ways to refine existing algorithms in this regard and improve their effectiveness considerably. We extend this approach by integrating heuristics and case‐based reasoning (CBR), an approach that has been successfully used in artificial intelligence applications. Using the resource‐constrained project scheduling problem as a vehicle, we describe how to devise such a CBR system, systematically analyzing the effect of several criteria on algorithmic performance. Extensive computational results validate the efficacy of our approach and reveal a performance similar or close to state‐of‐the‐art heuristics. In addition, the analysis undertaken provides new insight into the behaviour of a wide class of scheduling heuristics. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 201–222, 2000 相似文献
52.
提出了将极化阵列应用到反辐射导引头上,导引头利用目标与诱饵的极化差异,采用极化域-空域联合估计方法抗诱偏。首先,利用波达方向矩阵法,估算出雷达与诱饵的空间二维到达角和极化参数,将估算出来的二维到达角信息为反辐射导引头提供导引,极化参数用来鉴别雷达与诱饵,从而达到抗诱偏的目的。然后,结合导弹运动方程及导引方程对反辐射导弹抗三点源诱偏进行了全弹道数字仿真,并且采用Monte-Carlo方法对全弹道仿真进行了多次实验,仿真结果证明了将极化域-空域联合估计应用于反辐射导引头抗诱偏的可行性。 相似文献
53.
54.
针对当前我军车辆装备质量全面技术普查过程中存在的问题,探索一种新的作战准备车辆装备质量评估方法——抽样评估法,综合运用简单随机抽样和分层抽样,提出作战准备车辆装备质量抽样的样本量确定方法和子样本量分配方法,最后示例说明该方法的应用。 相似文献
55.
针对传统欺骗干扰难以对调频斜率极性捷变SAR形成有效干扰的问题,研究了对调频斜率极性捷变SAR进行欠采样转发干扰的方法。通过建立调频斜率极性捷变SAR有限时长欠采样转发干扰信号模型,分析欠采样转发干扰对调频斜率极性捷变SAR的干扰效果。给出假目标数目、位置以及幅度的理论计算公式,在此基础上讨论欠采样周期对干扰效果的影响。利用数字仿真验证了理论分析的正确性。 相似文献
56.
为解决均匀圆阵的相干信源波达方向估计问题,提出一种适用于均匀圆阵的虚拟均匀线阵主特征矢量分析算法.采用模式空间变换将均匀圆阵转换为虚拟均匀线阵,对其数据协方差矩阵进行处理以构造主特征矢量矩阵;引入加权最小二乘法,通过重复迭代得到子空间各元素之间的线性预测系数,从而求得相干信源的波达方向估计值.理论分析和仿真结果表明,该... 相似文献
57.
以通用微机为主控单元进行正弦扫频振动控制的独特之处在于驱动信号的生成、修正,响应信号的采样、分析以及系统传递函数计算等控制功能均主要由微机软件完成。本文主要介绍上述控制功能的软件设计原理,并给出相应的实验结果。 相似文献
58.
We consider the problem of maximizing the number of on‐time jobs on two uniform parallel machines. We show that a straightforward extension of an algorithm developed for the simpler two identical parallel machines problem yields a heuristic with a worst‐case ratio bound of at least . We then show that the infusion of a “look ahead” feature into the aforementioned algorithm results in a heuristic with the tight worst‐case ratio bound of , which, to our knowledge, is the tightest worst‐case ratio bound available for the problem. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
59.
This article studies a firm that procures a product from a supplier. The quality of each product unit is measured by a continuous variable that follows a normal distribution and is correlated within a batch. The firm conducts an inspection and pays the supplier only if the product batch passes the inspection. The inspection not only serves the purpose of preventing a bad batch from reaching customers but also offers the supplier an incentive to improve product quality. The firm determines the acceptance sampling plan, and the supplier determines the quality effort level in either a simultaneous game or a Stackelberg leadership game, in which both parties share inspection cost and recall loss caused by low product quality. In the simultaneous game, we identify the Nash equilibrium form, provide sufficient conditions that guarantee the existence of a pure strategy Nash equilibrium, and find parameter settings under which the decentralized and centralized supply chains achieve the same outcome. By numerical experiments, we show that the firm's acceptance sampling plan and the supplier's quality effort level are sensitive to both the recall loss sharing ratio and the game format (i.e., the precommitment assumption of the inspection policy). © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
60.
Mixed censoring is useful extension of Type I and Type II censoring and combines some advantages of both types of censoring. This paper proposes a general Bayesian framework for designing a variable acceptance sampling scheme with mixed censoring. A general loss function which includes the sampling cost, the time‐consuming cost, the salvage value, and the decision loss is employed to determine the Bayes risk and the corresponding optimal sampling plan. An explicit expression of the Bayes risk is derived. The new model can easily be adapted to create life testing models for different distributions. Specifically, two commonly used distributions including the exponential distribution and the Weibull distribution are considered with a special decision loss function. We demonstrate that the proposed model is superior to models with Type I or Type II censoring. Numerical examples are reported to illustrate the effectiveness of the method proposed. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献