全文获取类型
收费全文 | 50篇 |
免费 | 34篇 |
国内免费 | 3篇 |
出版年
2023年 | 1篇 |
2022年 | 1篇 |
2020年 | 1篇 |
2019年 | 2篇 |
2018年 | 1篇 |
2017年 | 4篇 |
2016年 | 5篇 |
2015年 | 4篇 |
2014年 | 5篇 |
2013年 | 3篇 |
2012年 | 9篇 |
2011年 | 3篇 |
2010年 | 3篇 |
2009年 | 4篇 |
2008年 | 3篇 |
2007年 | 4篇 |
2006年 | 4篇 |
2005年 | 2篇 |
2004年 | 2篇 |
2003年 | 1篇 |
2002年 | 1篇 |
2001年 | 6篇 |
2000年 | 4篇 |
1999年 | 1篇 |
1997年 | 2篇 |
1996年 | 3篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1991年 | 2篇 |
1990年 | 3篇 |
1989年 | 1篇 |
排序方式: 共有87条查询结果,搜索用时 15 毫秒
51.
应用广义偏离原则对黑体辐射问题进行了反演的研究,给出了正则参数的选择方法,由计算机仿真结果知,该方法计算精度高,有良好的应用前景。 相似文献
52.
The well‐known generalized assignment problem (GAP) involves the identification of a minimum‐cost assignment of tasks to agents when each agent is constrained by a resource in limited supply. The multi‐resource generalized assignment problem (MRGAP) is the generalization of the GAP in which there are a number of different potentially constraining resources associated with each agent. This paper explores heuristic procedures for the MRGAP. We first define a three‐phase heuristic which seeks to construct a feasible solution to MRGAP and then systematically attempts to improve the solution. We then propose a modification of the heuristic for the MRGAP defined previously by Gavish and Pirkul. The third procedure is a hybrid heuristic that combines the first two heuristics, thus capturing their relative strengths. We discuss extensive computational experience with the heuristics. The hybrid procedure is seen to be extremely effective in solving MRGAPs, generating feasible solutions to more than 99% of the test problems and consistently producing near‐optimal solutions. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 468–483, 2001 相似文献
53.
Consider a binary, monotone system of n components. The assessment of the parameter vector, θ, of the joint distribution of the lifetimes of the components and hence of the reliability of the system is often difficult due to scarcity of data. It is therefore important to make use of all information in an efficient way. For instance, prior knowledge is often of importance and can indeed conveniently be incorporated by the Bayesian approach. It may also be important to continuously extract information from a system currently in operation. This may be useful both for decisions concerning the system in operation as well as for decisions improving the components or changing the design of similar new systems. As in Meilijson [12], life‐monitoring of some components and conditional life‐monitoring of some others is considered. In addition to data arising from this monitoring scheme, so‐called autopsy data are observed, if not censored. The probabilistic structure underlying this kind of data is described, and basic likelihood formulae are arrived at. A thorough discussion of an important aspect of this probabilistic structure, the inspection strategy, is given. Based on a version of this strategy a procedure for preventive system maintenance is developed and a detailed application to a network system presented. All the way a Bayesian approach to estimation of θ is applied. For the special case where components are conditionally independent given θ with exponentially distributed lifetimes it is shown that the weighted sum of products of generalized gamma distributions, as introduced in Gåsemyr and Natvig [7], is the conjugate prior for θ. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 551–577, 2001. 相似文献
54.
We present a stochastic optimization model for planning capacity expansion under capacity deterioration and demand uncertainty. The paper focuses on the electric sector, although the methodology can be used in other applications. The goals of the model are deciding which energy types must be installed, and when. Another goal is providing an initial generation plan for short periods of the planning horizon that might be adequately modified in real time assuming penalties in the operation cost. Uncertainty is modeled under the assumption that the demand is a random vector. The cost of the risk associated with decisions that may need some tuning in the future is included in the objective function. The proposed scheme to solve the nonlinear stochastic optimization model is Generalized Benders' decomposition. We also exploit the Benders' subproblem structure to solve it efficiently. Computational results for moderate‐size problems are presented along with comparison to a general‐purpose nonlinear optimization package. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:662–683, 2001 相似文献
55.
Elsie Sterbin Gottlieb 《海军后勤学研究》2002,49(7):666-685
This paper investigates certain issues of coefficient sensitivity in generalized network problems when such problems have small gains or losses. In these instances, it might be computationally advantageous to temporarily ignore these gains or losses and solve the resultant “pure” network problem. Subsequently, the optimal solution to the pure problem could be used to derive the optimal solution to the original generalized network problem. In this paper we focus on generalized transportation problems and consider the following question: Given an optimal solution to the pure transportation problem, under what conditions will the optimal solution to the original generalized transportation problem have the same basic variables? We study special cases of the generalized transportation problem in terms of convexity with respect to a basis. For the special case when all gains or losses are identical, we show that convexity holds. We use this result to determine conditions on the magnitude of the gains or losses such that the optimal solutions to both the generalized transportation problem and the associated pure transportation problem have the same basic variables. For more general cases, we establish sufficient conditions for convexity and feasibility. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 666–685, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10034 相似文献
56.
依据舵减摇状态空间模型,推导舵减横摇广义预测控制律,在舵角舵速约束的条件下,采用二次型规划计算控制量进行减横摇控制.对某一船舶在典型航行工况下进行了系统仿真,仿真结果表明,该方法不但可取得35%~45%的减摇效果,而且对横摇角速度与横摇角加速度也有40%左右的减小效果. 相似文献
57.
非线性系统的神经网络广义预测控制 总被引:2,自引:0,他引:2
研究了神经网络广义预测控制方法在非线性系统中的应用,基于BP网络构造神经网络预测器,利用非线性系统的开环输入输出数据离线训练神经网络,根据拟牛顿BFGS优化算法使得二次型性能指标函数达到最小,得到了最优的控制序列。同时给出了神经网络广义预测控制算法的步骤,讨论了提高系统鲁棒性的措施。仿真结果表明,这种神经网络预测控制算法具有响应速度快、控制效果好和跟踪精度高等特点。 相似文献
58.
59.
60.