全文获取类型
收费全文 | 134篇 |
免费 | 32篇 |
国内免费 | 5篇 |
出版年
2022年 | 1篇 |
2021年 | 2篇 |
2020年 | 4篇 |
2019年 | 8篇 |
2018年 | 1篇 |
2017年 | 6篇 |
2016年 | 5篇 |
2015年 | 2篇 |
2014年 | 1篇 |
2013年 | 13篇 |
2012年 | 12篇 |
2011年 | 10篇 |
2010年 | 9篇 |
2009年 | 14篇 |
2008年 | 8篇 |
2007年 | 11篇 |
2006年 | 12篇 |
2005年 | 8篇 |
2004年 | 8篇 |
2003年 | 5篇 |
2002年 | 6篇 |
2001年 | 5篇 |
2000年 | 3篇 |
1999年 | 4篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1995年 | 3篇 |
1993年 | 1篇 |
1992年 | 2篇 |
1990年 | 2篇 |
1989年 | 1篇 |
1988年 | 1篇 |
排序方式: 共有171条查询结果,搜索用时 15 毫秒
151.
针对大阵元间距平面阵列方向图综合问题,提出基于粒子群算法的宽带真延时平面阵列方向图综合方法。该方法根据真延时条件下阵列方向图主瓣和栅瓣指向的特点,采用宽带真延时抑制阵列方向图的栅瓣;利用粒子群优化算法优化阵列结构,得到具有较高主副瓣比的平面阵列方向图。通过对8×8的矩形平面阵进行仿真,验证了所提方法的有效性,在此基础上,还仿真研究了该方法对栅瓣的抑制性能与信号带宽之间的关系。 相似文献
152.
In this article, we consider a single machine scheduling problem, in which identical jobs are split into batches of bounded sizes. For each batch, it is allowed to produce less jobs than a given upper bound, that is, some jobs in a batch can be rejected, in which case a penalty is paid for each rejected job. The objective function is the sum of several components, including the sum of the completion times, total delivery cost, and total rejection cost. We reduce this problem to a min‐cost flow problem with a convex quadratic function and adapt Tamir's algorithm for its solution. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 217–224, 2017 相似文献
153.
In recent years military procurement agencies have used “progress payments” in contracting. Although, overall, the adoption of such a policy may well have contributed to a decrease in total costs of procurement, we identify a class of inefficiencies that are likely to have been generated by it. 相似文献
154.
Consider a manufacturer serving a set of retail stores each of which faces deterministic demands in a finite planning horizon. At the beginning of the planning horizon, the production capacity of the manufacturer is built, followed by production, outsourcing to third party manufacturers if necessary and distribution to the retail stores. Because the retail stores are usually managed by different managers who act as independent profit centers, it is desirable that the total cost is divided among the retail stores so that their incentives can be appropriately captured and thus efficient operations can be achieved. Under various conditions, we prove that there is a fair allocation of costs among the retail stores in the sense that no subset of retail stores subsidizes others, or equivalently, the resulting capacity investment game has a nonempty core, that is, the capacity investment game is a balanced game. In addition, our proof provides a mechanism to compute a fair cost allocation. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 512–523, 2013 相似文献
155.
Reliability Economics is a field that can be defined as the collection of all problems in which there is tension between the performance of systems of interest and their cost. Given such a problem, the aim is to resolve the tension through an optimization process that identifies the system which maximizes some appropriate criterion function (e.g. expected lifetime per unit cost). In this paper, we focus on coherent systems of n independent and identically distributed (iid) components and mixtures thereof, and characterize both a system's performance and cost as functions of the system's signature vector (Samaniego, IEEE Trans Reliabil (1985) 69–72). For a given family of criterion functions, a variety of optimality results are obtained for systems of arbitrary order n. Approximations are developed and justified when the underlying component distribution is unknown. Assuming the availability of an auxiliary sample of N component failure times, the asymptotic theory of L‐estimators is adapted for the purpose of establishing the consistency and asymptotic normality of the proposed estimators of the expected ordered failure times of the n components of the systems under study. These results lead to the identification of ε‐optimal systems relative to the chosen criterion function. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
156.
157.
针对装备软件成本估算时面临的历史数据少的小样本难题,提出把机器学习理论运用到装备软件成本估算研究领域,构建了基于相关向量机的小样本装备软件成本估算模型,采用COCOMO模型数据库中的数据对所构建模型进行训练和验证。为进一步验证所构建模型的合理性,在机器学习领域分别运用支持向量机模型和神经网络模型对相同数据进行估算,实验结果证明了基于相关向量机估算模型在小样本装备软件成本估算时比其他两种模型更精确。 相似文献
158.
针对目前对武器装备寿命周期费用估算建模难以实施的情况,以准确预测武器装备寿命周期费用的主要组成部分—装备使用保障费用为出发点,依据装备使用保障费用的特点建立了装备使用保障费用的灰色组合预测模型,指出了用蚁群算法优化组合权系数的不足,并提出了新的优化方法—遗传算法。最后,结合实例验证说明了该模型的预测效果优于蚁群优化的方法,为准确估算武器装备寿命周期费用提供了依据。 相似文献
159.
This paper studies a periodic‐review pricing and inventory control problem for a retailer, which faces stochastic price‐sensitive demand, under quite general modeling assumptions. Any unsatisfied demand is lost, and any leftover inventory at the end of the finite selling horizon has a salvage value. The cost component for the retailer includes holding, shortage, and both variable and fixed ordering costs. The retailer's objective is to maximize its discounted expected profit over the selling horizon by dynamically deciding on the optimal pricing and replenishment policy for each period. We show that, under a mild assumption on the additive demand function, at the beginning of each period an (s,S) policy is optimal for replenishment, and the value of the optimal price depends on the inventory level after the replenishment decision has been done. Our numerical study also suggests that for a sufficiently long selling horizon, the optimal policy is almost stationary. Furthermore, the fixed ordering cost (K) plays a significant role in our modeling framework. Specifically, any increase in K results in lower s and higher S. On the other hand, the profit impact of dynamically changing the retail price, contrasted with a single fixed price throughout the selling horizon, also increases with K. We demonstrate that using the optimal policy values from a model with backordering of unmet demands as approximations in our model might result in significant profit penalty. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
160.