全文获取类型
收费全文 | 261篇 |
免费 | 94篇 |
国内免费 | 18篇 |
出版年
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 7篇 |
2020年 | 9篇 |
2019年 | 8篇 |
2018年 | 3篇 |
2017年 | 15篇 |
2016年 | 20篇 |
2015年 | 24篇 |
2014年 | 15篇 |
2013年 | 12篇 |
2012年 | 20篇 |
2011年 | 33篇 |
2010年 | 17篇 |
2009年 | 20篇 |
2008年 | 16篇 |
2007年 | 21篇 |
2006年 | 21篇 |
2005年 | 18篇 |
2004年 | 10篇 |
2003年 | 8篇 |
2002年 | 11篇 |
2001年 | 16篇 |
2000年 | 10篇 |
1999年 | 10篇 |
1998年 | 10篇 |
1997年 | 4篇 |
1996年 | 3篇 |
1994年 | 1篇 |
1993年 | 3篇 |
1992年 | 1篇 |
1990年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有373条查询结果,搜索用时 15 毫秒
261.
为了研究不确定性能参数对固体推进剂药柱结构分析的影响 ,将非概率凸集合理论模型和粘弹性有限元相结合 ,以增量法处理遗传积分 ,利用摄动法预测其响应量区间 ,发展了一种适合药柱特点的不确定性方法。将其和随机结构分析进行对比 ,表明两种方法之间有一定的联系。 相似文献
262.
态势估计中一种基于贝叶斯估计的统计时间推理方法 总被引:4,自引:0,他引:4
统计时间推理是态势估计中的一个重要组成部分。Kirilov的基于极大似然估计(Maxi-mumLikelihoodEstimation,MLE)的推理方法将未知时间变量看作常数,估计方差较大。文中建立的已知时间信息和未知时间变量之间的关系模型,将未知时间变量扩展为随机变量,将贝叶斯估计(BayesEstimation,BE)引入时间推理。经过对两种推理算法的性能进行分析和比较,发现在一定范围内,基于BE的方法性能优于基于MLE的方法。 相似文献
263.
目标搜索的预测分析及搜索计划的优化逼近 总被引:2,自引:0,他引:2
给出了目标搜索的预测分析公式,提出了最优搜索计划的一种优化逼近方法及有关实例 相似文献
264.
谷建湘 《国防科技大学学报》1990,12(3):45-49
离散时间的有限状态马尔可夫链最优停止的值函数存在的一个充分条件是所对应的线性规划有解,且其最优解等于值函数,本文证明这个条件还是必要的。 相似文献
265.
本文提出了一种求解无约束最优化问题的方法,称之为“恰当共轭方向法”。与通常的共轭方向法(如共轭梯度法)相比,这种方法可以节省大量的一维搜索工作量,并且还能提高收敛速率。 相似文献
266.
David R. Morrison Jason J. Sauppe Wenda Zhang Sheldon H. Jacobson Edward C. Sewell 《海军后勤学研究》2017,64(1):64-82
The cyclic best‐first search (CBFS) strategy is a recent search strategy that has been successfully applied to branch‐and‐bound algorithms in a number of different settings. CBFS is a modification of best‐first search (BFS) that places search tree subproblems into contours which are collections of subproblems grouped in some way, and repeatedly cycles through all non‐empty contours, selecting one subproblem to explore from each. In this article, the theoretical properties of CBFS are analyzed for the first time. CBFS is proved to be a generalization of all other search strategies by using a contour definition that explores the same sequence of subproblems as any other search strategy. Further, a bound is proved between the number of subproblems explored by BFS and the number of children generated by CBFS, given a fixed branching strategy and set of pruning rules. Finally, a discussion of heuristic contour‐labeling functions is provided, and proof‐of‐concept computational results for mixed‐integer programming problems from the MIPLIB 2010 database are shown. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 64–82, 2017 相似文献
267.
We analyze an interdiction scenario where an interceptor attempts to catch an intruder as the intruder moves through the area of interest. A motivating example is the detection and interdiction of drug smuggling vessels in the Eastern Pacific and Caribbean. We study two models in this article. The first considers a nonstrategic target that moves through the area without taking evasive action to avoid the interdictor. We determine the optimal location the interceptor should position itself to best respond when a target arrives. The second model analyzes the strategic interaction between the interceptor and intruder using a Blotto approach. The intruder chooses a route to travel on and the interceptor chooses a route to patrol. We model the interaction as a two‐player game with a bilinear payoff function. We compute the optimal strategy for both players and examine several extensions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 29–40, 2017 相似文献
268.
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. 相似文献
269.
Satellite constellation design for forest fire monitoring via a stochastic programing approach 下载免费PDF全文
There is significant value in the data collected by satellites during and after a natural disaster. The current operating paradigm in practice is for satellites to passively collect data when they happen to fly over a disaster location. Conversely, this article considers the alternative approach of actively maneuvering satellites to fly directly overhead of the disaster site on a routine basis. Toward this end, we seek to compute a satellite constellation design that minimizes the expected maneuver costs for monitoring an unknown forest fire. In this article, we present a 2‐stage stochastic programing model for this problem as well as a accelerated L‐shaped decomposition approach. A comparison between our approach and the current operating paradigm indicates that our solution provides longer duration data collections and a greater number of data collections. Analysis also shows that our proposed solution is robust over a wide array of scenarios. 相似文献
270.