全文获取类型
收费全文 | 371篇 |
免费 | 186篇 |
国内免费 | 34篇 |
出版年
2023年 | 5篇 |
2022年 | 7篇 |
2021年 | 6篇 |
2020年 | 11篇 |
2019年 | 13篇 |
2018年 | 5篇 |
2017年 | 28篇 |
2016年 | 31篇 |
2015年 | 24篇 |
2014年 | 31篇 |
2013年 | 23篇 |
2012年 | 23篇 |
2011年 | 23篇 |
2010年 | 19篇 |
2009年 | 43篇 |
2008年 | 29篇 |
2007年 | 31篇 |
2006年 | 41篇 |
2005年 | 30篇 |
2004年 | 25篇 |
2003年 | 16篇 |
2002年 | 11篇 |
2001年 | 17篇 |
2000年 | 15篇 |
1999年 | 11篇 |
1998年 | 10篇 |
1997年 | 10篇 |
1996年 | 6篇 |
1995年 | 5篇 |
1994年 | 3篇 |
1993年 | 9篇 |
1992年 | 5篇 |
1991年 | 8篇 |
1990年 | 10篇 |
1989年 | 6篇 |
1988年 | 1篇 |
排序方式: 共有591条查询结果,搜索用时 15 毫秒
41.
针对一类状态变量具有时滞的非线性系统,研究了其模糊控制器的设计问题。采用线性矩阵不等式(LMI)的方法,设计了与状态变量导数有关的模糊控制器,得到了系统存在模糊控制器的充分条件,并利用线性矩阵不等式的解给出具体的形式,最后通过仿真说明了控制器的有效性。 相似文献
42.
作战仿真系统中高性能随机数发生器研究 总被引:1,自引:0,他引:1
为满足作战仿真系统对随机数发生器随机性、鲁棒性、周期和效率等的苛刻要求,采用组件技术,开发了素数模乘同余组合发生器。该随机数发生器生成的随机数,其分布类型、参数和独立性经检验满足要求;其周期长达10^18,且不受种子的影响。该随机数发生器采用的算法经过优化后,运算速度提高了近40%。研究成果解决了仿真作战过程随机性的难题,为多样本的并行仿真、仿真结果置信区间的得出奠定了基础,有助于提高仿真系统的可信性。 相似文献
43.
线性系统的鲁棒容错控制设计方法 总被引:1,自引:0,他引:1
考虑了线性故障系统的鲁棒容错控制问题。利用状态反馈特征结构配置参数化结果,提出了一种鲁棒容错控制设计方法。该方法将故障系统的鲁棒容错控制问题转化为含有约束的最小化问题。数值算例及其仿真结果验证了所设计方法的简单性和有效性。 相似文献
44.
The nucleolus solution for cooperative games in characteristic function form is usually computed numerically by solving a sequence of linear programing (LP) problems, or by solving a single, but very large‐scale, LP problem. This article proposes an algebraic method to compute the nucleolus solution analytically (i.e., in closed‐form) for a three‐player cooperative game in characteristic function form. We first consider cooperative games with empty core and derive a formula to compute the nucleolus solution. Next, we examine cooperative games with nonempty core and calculate the nucleolus solution analytically for five possible cases arising from the relationship among the value functions of different coalitions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
45.
We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
46.
We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
47.
光顺样条是散乱数据拟合的理想函数,是噪声数据最优平滑的重要工具。因此,光顺样条的数学表示和计算的研究具有重要的意义。本文在一般的线性微分算子和线性泛函的情况下讨论光顺样条函数的构造和计算,通过构造一个适当的再生核Hilbert空间,使得所讨论的微分算子光顺样条成为该空间中的最小范数问题,再利用投影理论建立了光顺样条函数的再生核表示方法,并得到了插值偏差表达式。作为特例,还给出了奇次多项式光顺样条函数新的简洁的计算方法。 相似文献
48.
提出了用小生境遗传模拟退火算法求解带复杂约束的非线性规划问题。首先分析了遗传算法"早熟"收敛以及局部搜索能力弱的不足,由此引入小生境以增加种群多样性,并抑制"早熟"收敛现象,同时引入模拟退火算法以增强局部搜索能力,改进进化后期收敛速度慢的不足,最后结合典型非线性规划算例验证了混合算法的效率、精度和可靠性。 相似文献
49.
50.