全文获取类型
收费全文 | 525篇 |
免费 | 279篇 |
国内免费 | 81篇 |
出版年
2024年 | 8篇 |
2023年 | 10篇 |
2022年 | 13篇 |
2021年 | 13篇 |
2020年 | 19篇 |
2019年 | 20篇 |
2018年 | 20篇 |
2017年 | 49篇 |
2016年 | 59篇 |
2015年 | 36篇 |
2014年 | 62篇 |
2013年 | 37篇 |
2012年 | 65篇 |
2011年 | 55篇 |
2010年 | 36篇 |
2009年 | 62篇 |
2008年 | 34篇 |
2007年 | 41篇 |
2006年 | 61篇 |
2005年 | 32篇 |
2004年 | 24篇 |
2003年 | 16篇 |
2002年 | 18篇 |
2001年 | 12篇 |
2000年 | 11篇 |
1999年 | 12篇 |
1998年 | 8篇 |
1997年 | 4篇 |
1996年 | 9篇 |
1995年 | 6篇 |
1994年 | 4篇 |
1993年 | 4篇 |
1992年 | 7篇 |
1991年 | 4篇 |
1990年 | 6篇 |
1989年 | 8篇 |
排序方式: 共有885条查询结果,搜索用时 15 毫秒
181.
防空监视网络传感器资源分配的最优化 总被引:1,自引:0,他引:1
针对防空监视网络的传感器管理问题,讨论了传感器资源分配的最优化方法。提出了把传感器资源分配问题映射为多代理系统分布约束最优化问题的解决策略,设计了基于约束代价下界搜索的异步分枝定界最优化算法,实现了传感器资源分配问题最优解的异步并行搜索,给出的仿真实例说明了传感器资源分配最优化方法的有效性。 相似文献
182.
183.
基于火灾风险分析的消防力量优化布局 总被引:2,自引:0,他引:2
分析了我国目前消防力量布局存在的问题,从当前有限消防经费和现有的城市布局出发,提出了依据风险来优化消防力量布局的观点和方法,以最大限度的提高消防部队的灭火和抢险救援能力。 相似文献
184.
185.
随着计算机体系结构的发展,高速缓存(cache)的引入,分块方法成为矩阵计算中性能优化的主要方法,而矩阵主维对分块算法的性能影响很大。本文分析了矩阵主维影响性能的原因以及如何选取主维来改善性能,并与拷贝方法进行了比较。最后用矩阵乘法和LU分解进行了试算,取得了满意的结果 相似文献
186.
应用牛顿迭代法实现了弹道导弹基本诸元的快速装订。推导了根据落点偏差求飞行程序角和发射方位角的牛顿迭代公式,设计了迭代算法,并给出了实际算例。考虑到迭代算法收敛速度与所给的迭代初值有一定的关系,提出了预先准备简易射表采用反插值算法为牛顿迭代法准备初值的方法,经计算表明可以大大减少迭代次数,从而实现标准弹道的快速设计。 相似文献
187.
毕小平 《装甲兵工程学院学报》1994,(3)
采用数学规化的方法优化汽油机的工作过程,可以在限制发动机热负荷、机械负荷、氧化氮排放和不爆震的条件下,使发动机在运行过程中经济性最好.但是要求得比较精确的优化解,一般要进行大量计算,花费较多机时.本文提出了一种分段、分层、分级的递进优化方法,应用于汽油机工作过程的优化计算中,取得了较好的效果. 相似文献
188.
In this paper, we develop efficient deterministic algorithms for globally minimizing the sum and the product of several linear fractional functions over a polytope. We will show that an elaborate implementation of an outer approximation algorithm applied to the master problem generated by a parametric transformation of the objective function serves as an efficient method for calculating global minima of these nonconvex minimization problems if the number of linear fractional terms in the objective function is less than four or five. It will be shown that the Charnes–Cooper transformation plays an essential role in solving these problems. Also a simple bounding technique using linear multiplicative programming techniques has remarkable effects on structured problems. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 583–596, 1999 相似文献
189.
In this study we present an integer programming model for determining an optimal inbound consolidation strategy for a purchasing manager who receives items from several suppliers. The model considers multiple suppliers with limited capacity, transportation economies, and quantity discounts. We propose an integrated branch and bound procedure for solving the model. This procedure, applied to a Lagrangean dual at every node of the search tree, combines the subgradient method with a primal heuristic that interact to change the Lagrangean multipliers and tighten the upper and lower bounds. An enhancement to the branch and bound procedure is developed using surrogate constraints, which is found to be beneficial for solving large problems. We report computational results for a variety of problems, with as many as 70,200 variables and 3665 constraints. Computational testing indicates that our procedure is significantly faster than the general purpose integer programming code OSL. A regression analysis is performed to determine the most significant parameters of our model. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 579–598, 1998 相似文献
190.
Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well‐known NP‐hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optimality of the sequence within the framework of probabilistic analysis. Our main result is that, when the processing times are randomly and independently drawn from the same uniform distribution, the sequence is asymptotically optimal in the sense that its relative error converges to zero in probability as n increases. Other theoretical results are also derived, including: (i) When the processing times follow a symmetric structure, the problem has 2⌊(n−1)/2⌋ optimal sequences, which include our proposed sequence and other heuristic sequences suggested in the literature; and (ii) when these 2⌊(n−1)/2⌋ sequences are used as approximate solutions for a general problem, our proposed sequence yields the best approximation (in an average sense) while another sequence, which is commonly believed to be a good approximation in the literature, is interestingly the worst. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 373–398, 1999 相似文献