全文获取类型
收费全文 | 232篇 |
免费 | 81篇 |
国内免费 | 23篇 |
出版年
2023年 | 2篇 |
2022年 | 3篇 |
2021年 | 3篇 |
2020年 | 7篇 |
2019年 | 2篇 |
2018年 | 1篇 |
2017年 | 9篇 |
2016年 | 20篇 |
2015年 | 14篇 |
2014年 | 15篇 |
2013年 | 13篇 |
2012年 | 14篇 |
2011年 | 33篇 |
2010年 | 15篇 |
2009年 | 24篇 |
2008年 | 17篇 |
2007年 | 21篇 |
2006年 | 16篇 |
2005年 | 11篇 |
2004年 | 15篇 |
2003年 | 8篇 |
2002年 | 9篇 |
2001年 | 10篇 |
2000年 | 8篇 |
1999年 | 13篇 |
1998年 | 6篇 |
1997年 | 6篇 |
1996年 | 3篇 |
1995年 | 2篇 |
1994年 | 4篇 |
1993年 | 3篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 6篇 |
1988年 | 1篇 |
排序方式: 共有336条查询结果,搜索用时 15 毫秒
171.
准最优增量搜索效率分析 总被引:1,自引:0,他引:1
在对极限搜索圆进行特殊分割的条件下,导出准最优增量搜索和准最优总量搜索发现目标概率的计算公式,并通过对搜索力变化时两种发现概率的比较,得出了准最优增量搜索优于准最优总量搜索的重要结论. 相似文献
172.
非线性控制在磁悬浮系统中的应用 总被引:1,自引:0,他引:1
用滑模变结构控制原理设计磁悬浮系统非线性控制器,并在磁悬浮球装置上进行了试验,结果证实这种控制器具有完全的鲁棒性、良好的参数适应性,设计方法也有广泛的适用性。悬浮系统的刚度有显著的提高。 相似文献
173.
174.
This article deals with a two‐person zero‐sum game in which player I chooses in integer interval [1, N] two integer intervals consisting of p and q points where p + q < N, and player II chooses an integer point in [1, N]. The payoff to player I equals 1 if the point chosen by player II is at least in one of the intervals chosen by player II and 0 otherwise. This paper complements the results obtained by Ruckle, Baston and Bostock, Lee, Garnaev, and Zoroa, Zoroa and Fernández‐Sáez. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 98–106, 2001 相似文献
175.
176.
Leaving marks at the starting points in a rendezvous search problem may provide the players with important information. Many of the standard rendezvous search problems are investigated under this new framework which we call markstart rendezvous search. Somewhat surprisingly, the relative difficulties of analysing problems in the two scenarios differ from problem to problem. Symmetric rendezvous on the line seems to be more tractable in the new setting whereas asymmetric rendezvous on the line when the initial distance is chosen by means of a convex distribution appears easier to analyse in the original setting. Results are also obtained for markstart rendezvous on complete graphs and on the line when the players' initial distance is given by an unknown probability distribution. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 722–731, 2001 相似文献
177.
We consider a stochastic counterpart of the well-known earliness-tardiness scheduling problem with a common due date, in which n stochastic jobs are to be processed on a single machine. The processing times of the jobs are independent and normally distributed random variables with known means and known variances that are proportional to the means. The due dates of the jobs are random variables following a common probability distribution. The objective is to minimize the expectation of a weighted combination of the earliness penalty, the tardiness penalty, and the flow-time penalty. One of our main results is that an optimal sequence for the problem must be V-shaped with respect to the mean processing times. Other characterizations of the optimal solution are also established. Two algorithms are proposed, which can generate optimal or near-optimal solutions in pseudopolynomial time. The proposed algorithms are also extended to problems where processing times do not satisfy the assumption in the model above, and are evaluated when processing times follow different probability distributions, including general normal (without the proportional relation between variances and means), uniform, Laplace, and exponential. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44, 531–557, 1997. 相似文献
178.
179.
离散搜索力的最优配置模型及增量搜索计划 总被引:4,自引:0,他引:4
目前,离散搜索正越来越普遍地应用于各种搜索实践。为了优化搜索过程,提高离散搜索的效率,应用最优搜索理论,导出了待搜目标服从均匀分布、正态分布时离散搜索力的最优配置模型、目标的踪迹预测方法和最优增量搜索计划的求法,并通过实例作了演示,上述结论和方法为离散搜索力如何实施最优搜索提供了一定的理论依据。 相似文献
180.
为了降低“相似性漂移”问题的影响,提出一种基于“邻域传播”的匹配策略,将待查询项的模态内近邻映射到目标空间中,并将它们在目标空间中的最近邻作为查询项的跨模态近邻。基于邻域传播的匹配策略在不改变跨模态映射函数的条件下,可以有效地降低“相似性漂移”带来的误匹配现象。理论和实验分析证明,跨模态映射函数的“相似性漂移”问题广泛存在,而基于“邻域传播”的匹配策略可以有效降低其影响,提高匹配的准确率。 相似文献