全文获取类型
收费全文 | 723篇 |
免费 | 276篇 |
国内免费 | 72篇 |
出版年
2023年 | 8篇 |
2022年 | 8篇 |
2021年 | 22篇 |
2020年 | 23篇 |
2019年 | 17篇 |
2018年 | 14篇 |
2017年 | 33篇 |
2016年 | 50篇 |
2015年 | 28篇 |
2014年 | 51篇 |
2013年 | 62篇 |
2012年 | 58篇 |
2011年 | 60篇 |
2010年 | 29篇 |
2009年 | 64篇 |
2008年 | 47篇 |
2007年 | 50篇 |
2006年 | 64篇 |
2005年 | 57篇 |
2004年 | 49篇 |
2003年 | 43篇 |
2002年 | 37篇 |
2001年 | 34篇 |
2000年 | 27篇 |
1999年 | 21篇 |
1998年 | 24篇 |
1997年 | 12篇 |
1996年 | 17篇 |
1995年 | 10篇 |
1994年 | 15篇 |
1993年 | 5篇 |
1992年 | 18篇 |
1991年 | 4篇 |
1990年 | 6篇 |
1989年 | 3篇 |
1988年 | 1篇 |
排序方式: 共有1071条查询结果,搜索用时 15 毫秒
151.
152.
针对局部线性嵌入方法对于噪声的敏感性,从分析噪声对数据集局部特性的影响入手,提出了稳健局部线性嵌入方法。通过与局部线性嵌入方法的理论分析和实例对比,表明稳健局部线性嵌入方法不仅对噪声影响不敏感,而且对邻域的选择有较好的适应性,可更好地挖掘数据集的本征特性,具有更强的数据可视化能力。 相似文献
153.
给出了发射点、观测所、目标、炸点不在同一水平面内的对岸射击校正量模型 ,完善了对岸射击校正量的处理。建立了更加符合实际射击条件、更为合理的射击校正数学模型。 相似文献
154.
This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000 相似文献
155.
In this short note we study a two‐machine flowshop scheduling problem with the additional no‐idle feasibility constraint and the total completion time criterion function. We show that one of the few papers which deal with this special problem contains incorrect claims and suggest a way how these claims can be rectified. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47:353–358, 2000 相似文献
156.
极坐标下雷达多目标跟踪及其实现 总被引:1,自引:0,他引:1
王云峰 《军械工程学院学报》2000,12(2):32-35
导出极坐标下雷达多目标跟踪的非线性滤波方程和预测方程 ,获得了稳定和渐近无偏估计 ;采用最优配对法进行点迹与航迹相关 ,避免相关模糊 ;利用记分法进行航迹质量管理 ,并在计算机上实现了多目标跟踪数据处理 相似文献
157.
In this paper we consider the discrete time/resource trade-off problem in project networks. Given a project network consisting of nodes (activities) and arcs (technological precedence relations), in which the duration of the activities is a discrete, nonincreasing function of the amount of a single renewable resource committed to it, the discrete time/resource trade-off problem minimizes the project makespan subject to precedence constraints and a single renewable resource constraint. For each activity, a work content is specified such that all execution modes (duration/resource requirement pairs) for performing the activity are allowed as long as the product of the duration and the resource requirement is at least as large as the specified work content. We present a tabu search procedure which is based on a decomposition of the problem into a mode assignment phase and a resource-constrained project scheduling phase with fixed mode assignments. Extensive computational experience, including a comparison with other local search methods, is reported. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 553–578, 1998 相似文献
158.
We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998 相似文献
159.
综合考虑了查询处理时的计算费用和存储费用,提出了距离连接索引(Distance associatedJoinIn dices,DJI)的分步实现方法,以高效地支持联机空间距离查询。该方法采用分阶段计算DJI的策略,根据用户的查询条件动态地计算DJI的一部分以支持查询。实验研究证明,与传统方法相比,DJI的分步实现方法在性能上具有较大优势。 相似文献
160.
面对数据量呈指数增长的全球遥感图像,研究快速、有效、高精度的自动图像配准算法成为遥感领域迫切需要解决的问题。综述了遥感图像自动配准算法的研究现状和关键技术,且从新的角度分类总结了已有算法的特点及适用情况,并给出了综合的解决方案;同时研究并提出了三种新的并行策略,获得了较好的实验结论。由于算法采用粗粒度的数据并行方法,因此可扩展性和可移植性较好,无论在理论上还是在实践上都能为实际的遥感应用提供有益的指导和借鉴。最后提出了有待进一步研究的问题。 相似文献