全文获取类型
收费全文 | 243篇 |
免费 | 218篇 |
国内免费 | 23篇 |
专业分类
484篇 |
出版年
2024年 | 6篇 |
2023年 | 9篇 |
2022年 | 5篇 |
2021年 | 7篇 |
2020年 | 12篇 |
2019年 | 7篇 |
2018年 | 2篇 |
2017年 | 11篇 |
2016年 | 8篇 |
2015年 | 18篇 |
2014年 | 25篇 |
2013年 | 14篇 |
2012年 | 24篇 |
2011年 | 21篇 |
2010年 | 15篇 |
2009年 | 14篇 |
2008年 | 19篇 |
2007年 | 10篇 |
2006年 | 23篇 |
2005年 | 11篇 |
2004年 | 24篇 |
2003年 | 14篇 |
2002年 | 17篇 |
2001年 | 19篇 |
2000年 | 15篇 |
1999年 | 20篇 |
1998年 | 19篇 |
1997年 | 15篇 |
1996年 | 12篇 |
1995年 | 6篇 |
1994年 | 13篇 |
1993年 | 9篇 |
1992年 | 15篇 |
1991年 | 7篇 |
1990年 | 8篇 |
1989年 | 8篇 |
1988年 | 1篇 |
1987年 | 1篇 |
排序方式: 共有484条查询结果,搜索用时 15 毫秒
111.
介绍了在图形处理中,利用面向对象技术实现的平面图形对象拾取算法。与传统的以大量图像信息的存储为基础的位图存储方式下的图形对象拾取算法相比,本算法不但包括单个图形对象的拾取,而且也探讨了在复杂的图形组合下,如在图形重叠与覆盖的情况下进行多个图形对象拾取所需解决的算法难点。本算法对提高图像信息的存储效率和图形对象拾取的质量,对图像科学与面向对象技术的发展具有实际意义。 相似文献
112.
Zhi-Long Chen 《海军后勤学研究》1998,45(3):279-295
We consider the parallel replacement problem in which machine investment costs exhibit economy of scale which is modeled through associating both fixed and variable costs with machine investment costs. Both finite- and infinite-horizon cases are investigated. Under the three assumptions made in the literature on the problem parameters, we show that the finite-horizon problem with time-varying parameters is equivalent to a shortest path problem and hence can be solved very efficiently, and give a very simple and fast algorithm for the infinite-horizon problem with time-invariant parameters. For the general finite-horizon problem without any assumption on the problem parameters, we formulate it as a zero-one integer program and propose an algorithm for solving it exactly based on Benders' decomposition. Computational results show that this solution algorithm is efficient, i.e., it is capable of solving large scale problems within a reasonable cpu time, and robust, i.e., the number of iterations needed to solve a problem does not increase quickly with the problem size. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 279–295, 1998 相似文献
113.
114.
T.C. Edwin Cheng Qing Ding Mikhail Y. Kovalyov Aleksander Bachman Adam Janiak 《海军后勤学研究》2003,50(6):531-554
We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003 相似文献
115.
The service‐provision problem described in this paper comes from an application of distributed processing in telecommunications networks. The objective is to maximize a service provider's profit from offering computational‐based services to customers. The service provider has limited capacity and must choose which of a set of software applications he would like to offer. This can be done dynamically, taking into consideration that demand for the different services is uncertain. The problem is examined in the framework of stochastic integer programming. Approximations and complexity are examined for the case when demand is described by a discrete probability distribution. For the deterministic counterpart, a fully polynomial approximation scheme is known 2 . We show that introduction of stochasticity makes the problem strongly NP‐hard, implying that the existence of such a scheme for the stochastic problem is highly unlikely. For the general case a heuristic with a worst‐case performance ratio that increases in the number of scenarios is presented. Restricting the class of problem instances in a way that many reasonable practical problem instances satisfy allows for the derivation of a heuristic with a constant worst‐case performance ratio. Worst‐case performance analysis of approximation algorithms is classical in the field of combinatorial optimization, but in stochastic programming the authors are not aware of any previous results in this direction. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
116.
使基于构件的软件配置管理系统支持对配置资源的并发访问是一种必然要求,为此提出了一种资源结构映像异步更新策略用以实现这一目标.这种方法已由北京大学软件工程国家工程中心应用于青鸟软件配置管理系统(JBCM). 相似文献
117.
地球外部空间扰动引力并行计算 总被引:1,自引:0,他引:1
针对传统的司托克斯积分方法计算量大、模型复杂的缺点,通过将地球球面以适当的经纬度差进行划分及合理简化,实现了司托克斯积分法计算外部空间扰动引力的积分方程的离散化,建立了地球扰动引力的快速计算模型,并在快速计算模型的基础上采用并行计算技术,实现扰动引力的实时计算。仿真结果表明,提出的快速并行计算模型能较好地实现地球扰动引力的快速、高精度计算。 相似文献
118.
119.
阐述了当前广泛采用的光电式头盔测位系统的组成和原理,给出了解算瞄准线参数的数学关系式。对信号处理和精度进行了分析,导出了误差表达式,可用于系统设计中误差的估算和验证。通过信号处理分析,论述了影响精度的主要因素,最后,提出了从根本上提高精度的方法——峰值点检测处理技术。 相似文献
120.
本文介绍了一种基于自组织神经网络的雷达信号分选系统,概率神经网络通过计算输入信号矢量的联合概率密度实现贝叶斯分选,它与传统的信号分选算法相比在分选精度和资源利用率上有显著的提高。这种并行的神经网络计算结构也很适合于VLSI实现。本文还介绍了此系统在复杂雷达信号环境下的仿真分选试验。 相似文献