全文获取类型
收费全文 | 2281篇 |
免费 | 46篇 |
国内免费 | 87篇 |
专业分类
电工技术 | 21篇 |
综合类 | 34篇 |
化学工业 | 65篇 |
金属工艺 | 21篇 |
机械仪表 | 202篇 |
建筑科学 | 27篇 |
矿业工程 | 5篇 |
能源动力 | 12篇 |
轻工业 | 3篇 |
水利工程 | 3篇 |
石油天然气 | 8篇 |
武器工业 | 8篇 |
无线电 | 188篇 |
一般工业技术 | 114篇 |
冶金工业 | 170篇 |
原子能技术 | 1篇 |
自动化技术 | 1532篇 |
出版年
2024年 | 4篇 |
2023年 | 4篇 |
2022年 | 6篇 |
2021年 | 19篇 |
2020年 | 18篇 |
2019年 | 25篇 |
2018年 | 23篇 |
2017年 | 50篇 |
2016年 | 47篇 |
2015年 | 96篇 |
2014年 | 117篇 |
2013年 | 186篇 |
2012年 | 158篇 |
2011年 | 182篇 |
2010年 | 111篇 |
2009年 | 178篇 |
2008年 | 196篇 |
2007年 | 175篇 |
2006年 | 164篇 |
2005年 | 122篇 |
2004年 | 98篇 |
2003年 | 94篇 |
2002年 | 73篇 |
2001年 | 27篇 |
2000年 | 30篇 |
1999年 | 30篇 |
1998年 | 32篇 |
1997年 | 28篇 |
1996年 | 18篇 |
1995年 | 13篇 |
1994年 | 10篇 |
1993年 | 8篇 |
1992年 | 3篇 |
1991年 | 5篇 |
1990年 | 6篇 |
1989年 | 6篇 |
1988年 | 3篇 |
1987年 | 2篇 |
1986年 | 8篇 |
1985年 | 5篇 |
1984年 | 9篇 |
1982年 | 8篇 |
1981年 | 5篇 |
1980年 | 2篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1976年 | 3篇 |
1975年 | 1篇 |
1974年 | 1篇 |
1971年 | 1篇 |
排序方式: 共有2414条查询结果,搜索用时 15 毫秒
991.
This paper proposes a new mechanism called the Priority Token Bank for admission control, scheduling and policing in integrated-services networks. In such networks, both arrival processes and performance objectives can vary greatly from one packet stream to another. There are two principal components to the Priority Token Bank: accepting or rejecting requests to admit entire packet streams, where acceptance means guaranteeing that the packet stream's performance objectives will be met, and scheduling the transmission of packets such that performance objectives are met, even under heavy loads. To the extent possible, the performance of traffic is also optimized beyond the requirements. The performance achieved with the Priority Token Bank is compared to that of other typical algorithms. It is shown that, when operating under the constraint that the performance objectives of applications such as packet voice, video and bulk data transfer must be met in an ATM network, the mean delay experienced by other traffic is much better with the Priority Token Bank. Furthermore, the admission control algorithm can guarantee requirements will be met, and admit more traffic than the common alternatives. 相似文献
992.
分布式车间作业计划与调度是一个典型的组合优化问题,而组合优化问题是遗传算法求解的领域。该文描述了分布式车间作业调度问题及其调度方法,结合分布式车间生产模式的实际情况,将模拟退火算法引入自适应遗传算法,提出了混合遗传算法(GASA);详细地阐述了分布式车间作业计划与调度问题的解决策略和操作过程,并以甘特图的方式给出了计算结果。与其他方法比较,混合遗传算法是解决分布式车间作业计划与调度问题的更为优良的方法。 相似文献
993.
服务器通道调度技术是解决大规模流媒体点播应用系统资源瓶颈问题的有效途径。它的基本思想是通过让用户尽可能共享同一个数据流来提高系统资源的利用率。本文综述了媒体点播系统中通道调度方案的研究现状,分析了一些典型方案的设计思想和方法,指出目前通道调度方案研究中的不足,并对今后该领域需要进一步研究的问题进行展望 相似文献
994.
卫星通信系统星上处理中的调度问题及其算法 总被引:1,自引:0,他引:1
以往的卫星调度问题多侧重于地球站或测控资源的优化调度,实际上通信卫星本身包含许多调度问题。航天通信测控任务的新发展,要求通信卫星具有更强的星上处理与交换功能。该文主要研究卫星通信系统星上处理中的优化调度问题。卫星通信系统的常见多址联接方式是时分多址(TDMA)。该文描述了TDMA卫星通信系统星上处理中的调度问题。提出了相应的优化算法,并利用图论与网络最优化中的理论。说明卫星通信系统星上处理中的调度问题本质上是二部图的匹配问题,最后结合应用实例说明了优化算法与匹配方法的具体应用。 相似文献
995.
996.
就802.11 WLAN中MAC层点协调功能(PCF)状态下点协调器(PC)对各个站点分配媒体访问权的轮询机制进行分析并加以改进,通过引入不同优先级的业务区分机制,提出一种新的轮询调度算法,从而提高站点数据接入服务的性能,以满足VoIP over WLAN应用的QoS需求。 相似文献
997.
998.
The exploitation of service oriented technologies, such as Grid computing, is being boosted by the current service oriented economy trend, leading to a growing need of Quality of Service (QoS) mechanisms. However, Grid computing was created to provide vast amounts of computational power but in a best effort way. Providing QoS guarantees is therefore a very difficult and complex task due to the distributed and heterogeneous nature of their resources, specially the volunteer computing resources (e.g., desktop resources).The scope of this paper is to empower an integrated multi QoS support suitable for Grid Computing environments made of either dedicated and volunteer resources, even taking advantage of that fact. The QoS is provided through SLAs by exploiting different available scheduling mechanisms in a coordinated way, and applying appropriate resource usage optimization techniques. It is based on the differentiated use of reservations and scheduling in advance techniques, enhanced with the integration of rescheduling techniques that improve the allocation decisions already made, achieving a higher resource utilization and still ensuring the agreed QoS. As a result, our proposal enhances best-effort Grid environments by providing QoS aware scheduling capabilities.This proposal has been validated by means of a set of experiments performed in a real Grid testbed. Results show how the proposed framework effectively harnesses the specific capabilities of the underlying resources to provide every user with the desired QoS level, while, at the same time, optimizing the resources’ usage. 相似文献
999.
Scheduling large-scale applications in heterogeneous distributed computing systems is a fundamental NP-complete problem that is critical to obtaining good performance and execution cost. In this paper, we address the scheduling problem of an important class of large-scale Grid applications inspired by the real world, characterized by a huge number of homogeneous, concurrent, and computationally intensive tasks that are the main sources of performance, cost, and storage bottlenecks. We propose a new formulation of this problem based on a cooperative distributed game-theory-based method applied using three algorithms with low time complexity for optimizing three important metrics in scientific computing: execution time, economic cost, and storage requirements. We present comprehensive experiments using simulation and real-world applications that demonstrate the effectiveness of our approach in terms of time and fairness compared to other related algorithms. 相似文献
1000.
This paper investigates the limited-buffer permutation flow shop scheduling problem (LBPFSP) with the makespan criterion. A hybrid variable neighborhood search (HVNS) algorithm hybridized with the simulated annealing algorithm is used to solve the problem. A method is also developed to decrease the computational effort needed to implement different types of local search approaches used in the HVNS algorithm. Computational results show the higher efficiency of the HVNS algorithm as compared with the state-of-the-art algorithms. In addition, the HVNS algorithm is competitive with the algorithms proposed in the literature for solving the blocking flow shop scheduling problem (i.e., LBPFSP with zero-capacity buffers), and finds 54 new upper bounds for the Taillard's benchmark instances. 相似文献