全文获取类型
收费全文 | 197篇 |
免费 | 81篇 |
国内免费 | 14篇 |
出版年
2023年 | 1篇 |
2022年 | 3篇 |
2021年 | 3篇 |
2020年 | 6篇 |
2019年 | 2篇 |
2018年 | 4篇 |
2017年 | 3篇 |
2016年 | 17篇 |
2015年 | 12篇 |
2014年 | 17篇 |
2013年 | 11篇 |
2012年 | 13篇 |
2011年 | 24篇 |
2010年 | 7篇 |
2009年 | 19篇 |
2008年 | 15篇 |
2007年 | 12篇 |
2006年 | 18篇 |
2005年 | 12篇 |
2004年 | 16篇 |
2003年 | 12篇 |
2002年 | 6篇 |
2001年 | 5篇 |
2000年 | 10篇 |
1999年 | 11篇 |
1998年 | 6篇 |
1997年 | 4篇 |
1996年 | 2篇 |
1995年 | 3篇 |
1994年 | 4篇 |
1993年 | 4篇 |
1992年 | 1篇 |
1991年 | 3篇 |
1990年 | 6篇 |
排序方式: 共有292条查询结果,搜索用时 32 毫秒
281.
系统研究了模糊离散变结构控制的设计方法,提出了几种具体设计方案.对于变结构控制而言,模糊逻辑的引入可以使滑模(变结构)控制具备推理和学习能力,控制信号得以柔化,能够减轻或避免一般滑模控制的抖振现象;对于模糊控制而言,滑模控制思想的引入可以大大简化控制结构,保证控制系统的鲁棒稳定性,对模糊控制系统的设计和性能分析提供了一种工具. 相似文献
282.
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 相似文献
283.
284.
AbstractWhile not always a concern for the general economic growth literature, the debate over the effects of military spending on growth continues to develop, with no consensus, but a deepening understanding of the limitations of previous work. One important issue that has not been adequately dealt with is the endogeneity of military spending in the growth equation, mainly because of the difficulty of finding any variables that would make adequate instruments. This paper considers this issue, using an endogenous growth model estimated on a large sample of 109 non-high-income countries for the period 1998–2012. The empirical analysis is framed within an instrumental variable setting that exploits the increase in military spending that occurs when unrest in a country escalates to turmoil. The estimation results show that endogeneity arising from reverse causality is a crucial issue, with the instrumental variable estimates providing a larger significant negative effect of military spending on growth than OLS would. This result is found to be robust to different sources of heterogeneity and different time periods. 相似文献
285.
286.
无刷直流电动机具有诸多优点,但运行中仍然存在转矩脉动问题.分析了六相无刷直流电动机的工作原理,推导了六相无刷直流电动机的状态方程,采用状态变量法对电机转矩产生的关键量--反电势波形和电流波形进行了仿真和试验研究,对六相无刷直流电动机的谐波转矩进行了分析和推导,得出了通过减小电流滞后角可控制甚至消除正弦谐波脉动转矩的结论. 相似文献
287.
288.
记录可寻址随机访问文件是一种新型FORTRAN文件,它集中了顺序与直接文件两者的优点,为用户随机访问文件中不等长记录提供了更为有效的手段。本文不仅介绍了其使用方法,而且还讨论了实现中的有关问题。 相似文献
289.
We present two frameworks for designing random search methods for discrete simulation optimization. One of our frameworks is very broad (in that it includes many random search methods), whereas the other one considers a special class of random search methods called point‐based methods, that move iteratively between points within the feasible region. Our frameworks involve averaging, in that all decisions that require estimates of the objective function values at various feasible solutions are based on the averages of all observations collected at these solutions so far. Also, the methods are adaptive in that they can use information gathered in previous iterations to decide how simulation effort is expended in the current iteration. We show that the methods within our frameworks are almost surely globally convergent under mild conditions. Thus, the generality of our frameworks and associated convergence guarantees makes the frameworks useful to algorithm developers wishing to design efficient and rigorous procedures for simulation optimization. We also present two variants of the simulated annealing (SA) algorithm and provide their convergence analysis as example application of our point‐based framework. Finally, we provide numerical results that demonstrate the empirical effectiveness of averaging and adaptivity in the context of SA. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
290.