全文获取类型
收费全文 | 277篇 |
免费 | 48篇 |
国内免费 | 56篇 |
出版年
2023年 | 2篇 |
2022年 | 3篇 |
2021年 | 2篇 |
2020年 | 4篇 |
2019年 | 1篇 |
2018年 | 2篇 |
2017年 | 14篇 |
2016年 | 19篇 |
2015年 | 13篇 |
2014年 | 25篇 |
2013年 | 18篇 |
2012年 | 30篇 |
2011年 | 20篇 |
2010年 | 15篇 |
2009年 | 40篇 |
2008年 | 16篇 |
2007年 | 26篇 |
2006年 | 20篇 |
2005年 | 15篇 |
2004年 | 13篇 |
2003年 | 11篇 |
2002年 | 7篇 |
2001年 | 16篇 |
2000年 | 10篇 |
1999年 | 4篇 |
1998年 | 5篇 |
1997年 | 7篇 |
1996年 | 3篇 |
1995年 | 1篇 |
1994年 | 3篇 |
1993年 | 4篇 |
1992年 | 7篇 |
1991年 | 2篇 |
1990年 | 2篇 |
1989年 | 1篇 |
排序方式: 共有381条查询结果,搜索用时 62 毫秒
321.
We present, analyze, and compare three random search methods for solving stochastic optimization problems with uncountable feasible regions. Our adaptive search with resampling (ASR) approach is a framework for designing provably convergent algorithms that are adaptive and may consequently involve local search. The deterministic and stochastic shrinking ball (DSB and SSB) approaches are also convergent, but they are based on pure random search with the only difference being the estimator of the optimal solution [the DSB method was originally proposed and analyzed by Baumert and Smith]. The three methods use different techniques to reduce the effects of noise in the estimated objective function values. Our ASR method achieves this goal through resampling of already sampled points, whereas the DSB and SSB approaches address it by averaging observations in balls that shrink with time. We present conditions under which the three methods are convergent, both in probability and almost surely, and provide a limited computational study aimed at comparing the methods. Although further investigation is needed, our numerical results suggest that the ASR approach is promising, especially for difficult problems where the probability of identifying good solutions using pure random search is small. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
322.
323.
324.
325.
Statistical analysis of exponential lifetimes under an adaptive Type‐II progressive censoring scheme
In this article, a mixture of Type‐I censoring and Type‐II progressive censoring schemes, called an adaptive Type‐II progressive censoring scheme, is introduced for life testing or reliability experiments. For this censoring scheme, the effective sample size m is fixed in advance, and the progressive censoring scheme is provided but the number of items progressively removed from the experiment upon failure may change during the experiment. If the experimental time exceeds a prefixed time T but the number of observed failures does not reach m, we terminate the experiment as soon as possible by adjusting the number of items progressively removed from the experiment upon failure. Computational formulae for the expected total test time are provided. Point and interval estimation of the failure rate for exponentially distributed failure times are discussed for this censoring scheme. The various methods are compared using Monte Carlo simulation. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
326.
跑道直线参数的准确提取,是机载视觉完成自主着陆过程的重要条件.首先在边缘图像的基础上利用相位编组算法,得到当前边缘图像中大量的线段,根据线段之间的角度,端点距离,以及线段两边的灰度均值,设计了一套规则来定量描述线段之间的亲近性,根据亲近值,将处于同一直线上的短线段首尾连接成长线段.取最长的若干条线段待选,再利用跑道区域的先验知识,主要是跑道内外的灰度对比信息,将位于同一条跑道的两条边缘上的线段识别出来.大量的实际图像结果验证了算法的有效性. 相似文献
327.
328.
329.
330.
针对常规跳频通信抗跟踪干扰能力差的问题,分析跟踪干扰原理,提出变速跳频通信。建立数学模型,在干扰容限、压制比和追踪概率方面进行理论分析,分析变速跳频通信抗跟踪干扰对误码率的性能,并用MATLAB进行仿真验证。 相似文献