全文获取类型
收费全文 | 264篇 |
免费 | 102篇 |
国内免费 | 19篇 |
出版年
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 9篇 |
2020年 | 10篇 |
2019年 | 8篇 |
2018年 | 3篇 |
2017年 | 15篇 |
2016年 | 21篇 |
2015年 | 24篇 |
2014年 | 15篇 |
2013年 | 12篇 |
2012年 | 20篇 |
2011年 | 35篇 |
2010年 | 17篇 |
2009年 | 21篇 |
2008年 | 17篇 |
2007年 | 21篇 |
2006年 | 21篇 |
2005年 | 18篇 |
2004年 | 12篇 |
2003年 | 8篇 |
2002年 | 12篇 |
2001年 | 16篇 |
2000年 | 10篇 |
1999年 | 11篇 |
1998年 | 10篇 |
1997年 | 4篇 |
1996年 | 3篇 |
1994年 | 1篇 |
1993年 | 3篇 |
1992年 | 1篇 |
1990年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有385条查询结果,搜索用时 15 毫秒
141.
This paper addresses optimal power allocation in a wireless communication network under uncertainty. The paper introduces a framework for optimal transmit power allocation in a wireless network where both the useful and interference coefficients are random. The new approach to power control is based on a stochastic programming formulation with probabilistic SIR constraints. This allows to state the power allocation problem as a convex optimization problem assuming normally or log‐normally distributed communication link coefficients. Numerical examples illustrate the performance of the optimal stochastic power allocation. A distributed algorithm for the decentralized solution of the stochastic power allocation problem is discussed. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
142.
143.
针对在强背景噪声中检测微弱舰船轴频电场信号的问题,提出了基于随机共振技术的检测方法.首先,介绍了随机共振利用噪声增强信号能量从而提高信噪比的基本原理,并在此基础上给出了利用随机共振检测微弱周期信号的模型.然后,将低信噪比的船模轴频电场测量数据输入到检测模型并对输出信号作功率谱分析,结果表明:随机共振技术能十分有效地从复杂背景噪声中检测出微弱舰船轴频电场信号,在微弱信号处理领域相比传统方法具有很大的优势.最后,结合检测实例,初步分析了系统参数对随机共振系统输出信号频谱分布的影响,为随机共振技术的进一步工程应用打下了良好的基础. 相似文献
144.
145.
Stochastic dynamic programming models are attractive for multireservoir control problems because they allow non‐linear features to be incorporated and changes in hydrological conditions to be modeled as Markov processes. However, with the exception of the simplest cases, these models are computationally intractable because of the high dimension of the state and action spaces involved. This paper proposes a new method of determining an operating policy for a multireservoir control problem that uses stochastic dynamic programming, but is practical for systems with many reservoirs. Decomposition is first used to reduce the problem to a number of independent subproblems. Each subproblem is formulated as a low‐dimensional stochastic dynamic program and solved to determine the operating policy for one of the reservoirs in the system. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
146.
147.
从工程应用的角度出发 ,在极小现场子样条件下 ,讨论了如何利用验前信息与现场子样来对导弹的命中精度进行评定 ,将随机加权法与BAYES方法结合起来 ,提出了基于随机加权法的BAYES精度评定方法 ,并通过算例证实了方法的正确性 相似文献
148.
This article considers the preventive flow interception problem (FIP) on a network. Given a directed network with known origin‐destination path flows, each generating a certain amount of risk, the preventive FIP consists of optimally locating m facilities on the network in order to maximize the total risk reduction. A greedy search heuristic as well as several variants of an ascent search heuristic and of a tabu search heuristic are presented for the FIP. Computational results indicate that the best versions of the latter heuristics consistently produce optimal or near optimal solutions on test problems. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 287–303, 2000 相似文献
149.
James Flynn 《海军后勤学研究》2000,47(4):329-352
Consider a single‐item, periodic review, infinite‐horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. Orders can arrive in every period, and the cost of receiving them is negligible (as in a JIT setting). Every T periods, one audits the current stock level and decides on deliveries for the next T periods, thus incurring a fixed audit cost and—when one schedules deliveries—a fixed order cost. The problem is to find a review period T and an ordering policy that satisfy the average cost criterion. The current article extends an earlier treatment of this problem, which assumed that the fixed order cost is automatically incurred once every T periods. We characterize an optimal ordering policy when T is fixed, prove that an optimal review period T** exists, and develop a global search algorithm for its computation. We also study the behavior of four approximations to T** based on the assumption that the fixed order cost is incurred during every cycle. Analytic results from a companion article (where μ/σ is large) and extensive computational experiments with normal and gamma demand test problems suggest these approximations and associated heuristic policies perform well when μ/σ ≥ 2. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 329–352, 2000 相似文献
150.
Column generation for stochastic green telecommunication network planning with switchable base stations
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
We present the green telecommunication network planning problem with switchable base stations, where the location and configuration of the base stations are optimized, while taking into account uncertainty and variability of demand. The problem is formulated as a two‐stage stochastic program under demand uncertainty with integers in both stages. Since solving the presented problem is computationally challenging, we develop the corresponding Dantzig‐Wolfe reformulation and propose a solution approach based on column generation. Comprehensive computational results are provided for instances of varying characteristics. The results show that the joint location and dynamic switching of base stations leads to significant savings in terms of energy cost. Up to 30% reduction in power consumption cost is achieved while still serving all users. In certain cases, allowing dynamic configurations leads to more installed base stations and higher user coverage, while having lower total energy consumption. The Dantzig‐Wolfe reformulation provides solutions with a tight LP‐gap eliminating the need for a full branch‐and‐price scheme. Furthermore, the proposed column generation solution approach is computationally efficient and outperforms CPLEX on the majority of the tested instances. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 351–366, 2016 相似文献