全文获取类型
收费全文 | 53篇 |
免费 | 31篇 |
国内免费 | 2篇 |
出版年
2023年 | 1篇 |
2022年 | 1篇 |
2021年 | 2篇 |
2020年 | 6篇 |
2019年 | 2篇 |
2018年 | 1篇 |
2017年 | 5篇 |
2016年 | 6篇 |
2015年 | 3篇 |
2014年 | 1篇 |
2013年 | 6篇 |
2012年 | 6篇 |
2011年 | 3篇 |
2009年 | 3篇 |
2008年 | 2篇 |
2007年 | 3篇 |
2006年 | 3篇 |
2005年 | 3篇 |
2004年 | 2篇 |
2003年 | 1篇 |
2002年 | 2篇 |
2001年 | 6篇 |
2000年 | 2篇 |
1998年 | 1篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1994年 | 3篇 |
1993年 | 1篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 3篇 |
1989年 | 2篇 |
排序方式: 共有86条查询结果,搜索用时 15 毫秒
41.
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 相似文献
42.
43.
从多分辨分析思想出发 ,推导出一种计算数值积分的算法 ,通过加强迫函数改善其精度。利用张量扩张的原理 ,将其推广到计算多维数值积分。结果表明 ,它不但与传统的Simpson算法有较好的一致性 ,而且对于震荡积分也有较高的精度。 相似文献
44.
This study investigates a clustered coverage orienteering problem (CCOP), which is a generalization of the classical orienteering problem. The problem is widely motivated by the emerging unmanned techniques (eg, unmanned surface vehicles and drones) applied to environmental monitoring. Specifically, the unmanned surface vehicles (USVs) are used to monitor reservoir water quality by collecting samples. In the CCOP, the water sampling sites (ie, the nodes) are grouped into clusters, and a minimum number of nodes must be visited in each cluster. With each node representing a certain coverage area of the water, the objective of the CCOP is to monitor as much as possible the total coverage area in one tour of the USV, considering that overlapping areas provide no additional information. An integer programming model is first formulated through a linearization procedure that captures the overlapping feature. A two-stage exact algorithm is proposed to obtain an optimal solution to the problem. The efficiency and effectiveness of the two-stage exact algorithm are demonstrated through experiments on randomly generated instances. The algorithm can effectively solve instances with up to 60 sampling sites. 相似文献
45.
46.
47.
We introduce the concept of a sequential double window procedure and compare the resulting acceptance test with both a fixed sample size method as well as with the Wald sequential probability ratio test. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
48.
In the past several decades, many ranking‐and‐selection (R&S) procedures have been developed to select the best simulated system with the largest (or smallest) mean performance measure from a finite number of alternatives. A major issue to address in these R&S problems is to balance the trade‐off between the effectiveness (ie, making a correct selection with a high probability) and the efficiency (ie, using a small total number of observations). In this paper, we take a frequentist's point of view by setting a predetermined probability of correct selection while trying to reduce the total sample size, that is, to improve the efficiency but also maintain the effectiveness. In particular, in order to achieve this goal, we investigate combining various variance reduction techniques into the fully sequential framework, resulting in different R&S procedures with either finite‐time or asymptotic statistical validity. Extensive numerical experiments show great improvement in the efficiency of our proposed procedures as compared with several existing procedures. 相似文献
49.
Augmented nested sampling for stochastic programs with recourse and endogenous uncertainty 下载免费PDF全文
We propose a novel simulation‐based approach for solving two‐stage stochastic programs with recourse and endogenous (decision dependent) uncertainty. The proposed augmented nested sampling approach recasts the stochastic optimization problem as a simulation problem by treating the decision variables as random. The optimal decision is obtained via the mode of the augmented probability model. We illustrate our methodology on a newsvendor problem with stock‐dependent uncertain demand both in single and multi‐item (news‐stand) cases. We provide performance comparisons with Markov chain Monte Carlo and traditional Monte Carlo simulation‐based optimization schemes. Finally, we conclude with directions for future research. 相似文献
50.
建立扩频信号防混叠滤波、采样、量化与解扩输出关系的数学解析模型,推导得到解扩输出信噪比的解析表达式。分析与仿真表明,当量化位数大于等于4 bit,解扩得到总的信噪比损失可以分解为由量化引起的损失和滤波加采样引起损失的乘积,且量化器最优限幅系数只与量化位数相关;当量化位数小于4 bit时,信噪比损失在一定条件下可近似为量化损失和滤波加采样损失的乘积。当量化位数大于4 bit、滤波器带宽大于5倍码率、采样频率大于4倍码率时,再增大上述参数引起的信噪比损失波动小于0.05 dB,对解扩性能提升不明显。该结论可为实用型全球导航卫星系统接收机前端离散化处理优化设计提供理论指导。 相似文献