全文获取类型
收费全文 | 171篇 |
免费 | 77篇 |
国内免费 | 18篇 |
出版年
2024年 | 1篇 |
2022年 | 5篇 |
2020年 | 7篇 |
2019年 | 2篇 |
2018年 | 3篇 |
2017年 | 7篇 |
2016年 | 12篇 |
2015年 | 10篇 |
2014年 | 16篇 |
2013年 | 14篇 |
2012年 | 23篇 |
2011年 | 15篇 |
2010年 | 9篇 |
2009年 | 14篇 |
2008年 | 13篇 |
2007年 | 18篇 |
2006年 | 13篇 |
2005年 | 15篇 |
2004年 | 16篇 |
2003年 | 10篇 |
2002年 | 6篇 |
2001年 | 4篇 |
2000年 | 7篇 |
1999年 | 2篇 |
1998年 | 2篇 |
1997年 | 4篇 |
1996年 | 6篇 |
1995年 | 3篇 |
1993年 | 2篇 |
1992年 | 2篇 |
1991年 | 3篇 |
1990年 | 1篇 |
1989年 | 1篇 |
排序方式: 共有266条查询结果,搜索用时 140 毫秒
221.
基于提升结构的因果化实现及优化在将两带滤波器组转化为单进单出系统时子带系数的叠混模式,提出了一种改进的低内存需求的离散小波变换(Enhanced Low-memory Discrete Wavelet Transform,ELDWT)实现方法.相对于DWT的常规全局实现法,基于ELDWT实现的正、逆离散小波变换均具有与... 相似文献
222.
223.
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 相似文献
224.
In this paper, we present a continuous time optimal control model for studying a dynamic pricing and inventory control problem for a make‐to‐stock manufacturing system. We consider a multiproduct capacitated, dynamic setting. We introduce a demand‐based model where the demand is a linear function of the price, the inventory cost is linear, the production cost is an increasing strictly convex function of the production rate, and all coefficients are time‐dependent. A key part of the model is that no backorders are allowed. We introduce and study an algorithm that computes the optimal production and pricing policy as a function of the time on a finite time horizon, and discuss some insights. Our results illustrate the role of capacity and the effects of the dynamic nature of demand in the model. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
225.
226.
227.
利用集群搜索对策的理论与方法 ,建立了集群对固定目标的一类搜索对策模型 ,给出了集群的ε -最优搜寻策略 ,并考虑了其在搜索过程中的应用 相似文献
228.
James Flynn 《海军后勤学研究》2001,48(5):430-449
Consider an N‐item, periodic review, infinite‐horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. For 1 ≤ j ≤ N, orders for item j can arrive in every period, and the cost of receiving them is negligible (as in a JIT setting). Every Tj periods, one reviews the current stock level of item j and decides on deliveries for each of the next Tj periods, thus incurring an item‐by‐item fixed cost kj. There is also a joint fixed cost whenever any item is reviewed. The problem is to find review periods T1, T2, …, TN and an ordering policy satisfying the average cost criterion. The current article builds on earlier results for the single‐item case. We prove an optimal policy exists, give conditions where it has a simple form, and develop a branch and bound algorithm for its computation. We also provide two heuristic policies with O(N) computational requirements. Computational experiments indicate that the branch and bound algorithm can handle normal demand problems with N ≤ 10 and that both heuristics do well for a wide variety of problems with N ranging from 2 to 200; moreover, the performance of our heuristics seems insensitive to N. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:430–449, 2001 相似文献
229.
针对现代非接触战争的特点,用数学方法研究导弹对抗模型问题,针对作战的不同目的和要求,建立两个导弹对抗的非线性规划数学模型,对模型求解设计了近似方法,该方法把上述非线性规划模型化为多个线性规划模型进行求解.对一类较简单的特殊情况进行了仔细分析,得到了分析解.最后指出该方法如何应用于动态实时优化决策.本文的方法可用来预测和评估导弹对抗的效果,为作战实时优化决策提供参考. 相似文献
230.
Consider a situation where a single shooter engages, sequentially, a cluster of targets that may vary in terms of vulnerability and value or worth. Following the shooting of a round of fire at a certain target, the latter may either be killed or remain alive. We assume neither partial nor cumulative damage. If the target is killed, there is a possibility that the shooter is not aware of that fact and may keep on engaging that target. If the shooter recognizes a killed target as such, then this target is considered to be evidently killed. If the objective is to maximize the weighted expected number of killed targets, where the weight reflects the value of a target, then it is shown that a certain type of a shooting strategy, called a Greedy Strategy, is optimal under the general assumption that the more a target is engaged, but still not evidently killed, the less is the probability that the next round will be effective. If all weights are equal, then the greedy shooting strategy calls to engage, at each round, the least previously engaged target that is not evidently killed. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 613–622, 1997 相似文献