全文获取类型
收费全文 | 6670篇 |
免费 | 814篇 |
国内免费 | 789篇 |
专业分类
电工技术 | 245篇 |
综合类 | 412篇 |
化学工业 | 184篇 |
金属工艺 | 115篇 |
机械仪表 | 574篇 |
建筑科学 | 362篇 |
矿业工程 | 52篇 |
能源动力 | 113篇 |
轻工业 | 42篇 |
水利工程 | 51篇 |
石油天然气 | 37篇 |
武器工业 | 36篇 |
无线电 | 1001篇 |
一般工业技术 | 246篇 |
冶金工业 | 24篇 |
原子能技术 | 21篇 |
自动化技术 | 4758篇 |
出版年
2024年 | 12篇 |
2023年 | 44篇 |
2022年 | 103篇 |
2021年 | 155篇 |
2020年 | 114篇 |
2019年 | 101篇 |
2018年 | 146篇 |
2017年 | 153篇 |
2016年 | 202篇 |
2015年 | 270篇 |
2014年 | 402篇 |
2013年 | 472篇 |
2012年 | 572篇 |
2011年 | 666篇 |
2010年 | 494篇 |
2009年 | 456篇 |
2008年 | 509篇 |
2007年 | 550篇 |
2006年 | 535篇 |
2005年 | 389篇 |
2004年 | 372篇 |
2003年 | 337篇 |
2002年 | 243篇 |
2001年 | 146篇 |
2000年 | 124篇 |
1999年 | 118篇 |
1998年 | 100篇 |
1997年 | 83篇 |
1996年 | 77篇 |
1995年 | 62篇 |
1994年 | 44篇 |
1993年 | 44篇 |
1992年 | 35篇 |
1991年 | 23篇 |
1990年 | 13篇 |
1989年 | 21篇 |
1988年 | 13篇 |
1987年 | 2篇 |
1986年 | 5篇 |
1985年 | 8篇 |
1984年 | 5篇 |
1983年 | 5篇 |
1982年 | 6篇 |
1981年 | 9篇 |
1980年 | 6篇 |
1979年 | 3篇 |
1978年 | 7篇 |
1977年 | 8篇 |
1976年 | 5篇 |
1965年 | 1篇 |
排序方式: 共有8273条查询结果,搜索用时 0 毫秒
11.
The molten iron allocation problem (MIAP) is to allocate molten iron from blast furnaces to steel-making furnaces. The allocation needs to observe the release times of the molten iron defined by the draining plan of the blast furnaces and the transport time between the iron-making and steel-making stages. Time window constraints for processing the molten iron must be satisfied to avoid freezing. The objective is to find a schedule with minimum total weighted completion time. This objective reflects the practical consideration of improving steel-making efficiency and reducing operation cost caused by the need for reheating. Such a problem can be viewed as a parallel machine scheduling problem with time windows which is known to be NP-hard. In this paper, we first formulate the molten iron allocation problem as an integer programming model and then reformulate it as a set partitioning model by applying the Dantzig–Wolfe decomposition. We solve the problem using a column generation-based branch-and-price algorithm. Since the subproblem of column generation is still NP-hard, we propose a state-space relaxation-based dynamic programming algorithm for the subproblem. Computational experiments demonstrate that the proposed algorithm is capable of solving problems with up to 100 jobs to optimality within a reasonable computation time. 相似文献
12.
13.
D.E. Kvasov D. Menniti A. Pinnarelli Y.D. Sergeyev N. Sorrentino 《Electric Power Systems Research》2008
In this paper, the problem of global tuning of fuzzy power-system stabilizers (FPSSs) present in a multi-machine power system in order to damp the power system oscillations is considered. In particular, it is formulated as a problem of global minimization of a multiextremal black-box function over a multidimensional hyperinterval. A global optimization technique, recently proposed, is used for solving the stated problem: the search hyperinterval is partitioned into smaller hyperintervals and the objective function is evaluated only at two vertices corresponding to the main diagonal of the generated hyperintervals, thus avoiding unnecessary ponderous simulations. Then, the performances of this technique are numerically compared with ones of a genetic algorithm (GA). 相似文献
14.
15.
16.
17.
The parallelism of loop nests with non-uniform dependences is difficult to extract and ineffectively explored by the existing parallelization schemes. In this paper, we propose new efficient techniques in extracting parallelism of loop nests with non-uniform dependences using their irregularity. By this way, current highly parallel multiprocessor systems such as multithreaded and clustering multiprocessor systems can be fully utilized. These four mechanisms are (a) parallelization part splitting, (b) partial parallelization decomposition, (c) irregular loop interchange and (d) growing pattern detection. They explore parallelisms of special parallel patterns for nested loops with non-uniform dependences. The loop transformations used in uniform loops are also applied in non-uniform dependence loops after legality tests. We apply the results of classical convex theory and detect special parallel patterns of dependence vectors. We also proposed an algorithm that combines above mechanisms to enhance parallelism. We demonstrate that our technique gives much better speedup and extracts more parallelism than the existing techniques. Thus, we are encouraged by these apparent enhancements to pursue further development. 相似文献
18.
The problem of packing circles into a domain of prescribed topology is considered. The circles need not have equal radii. The Collins-Stephenson algorithm computes such a circle packing. This algorithm is parallelized in two different ways and its performance is reported for a triangular, planar domain test case. The implementation uses the highly parallel graphics processing unit (GPU) on commodity hardware. The speedups so achieved are discussed based on a number of experiments. 相似文献
19.
无线传感网络是当前无线网络研究的热点领域,分簇路由协议作为降低网络能耗、提高网络生存时间的核心技术而备受关注。在深入分析已有算法存在诸多不足的基础上,本文提出了一种基于减聚类优化的分簇路由算法。本文首先建立一阶能耗模型,确定网络最优簇首数量;然后建立减聚类优化数学模型,确定可供选择的分簇方案;最后以最小化最大簇内距离方差作为评价指标,确定最优的分簇结果。仿真结果表明:相比经典的LEACH分簇路由协议,该算法划分的网络能够有效地降低网络能耗、提高网络生存时间,弥补已有算法的不足之处。 相似文献
20.
郭乐新 《电脑与微电子技术》2012,(2):3-5,18
旅行商问题TSP是一类典型的NP完全问题.围绕着这个问题有各种不同的求解方法,已有的算法例如动态规划法、分支限界法、回溯法等,这些精确式方法都是指数级的,根本无法解决目前的实际问题.贪心法是近似方法.无法达到比较满意的近似比。常用的遗传算法也是求解这类问题的常用方法之一。由于该问题的解是一种特殊的序列.所以遗传算法在求解该问题时的性能也并不理想。模拟退火算法具有描述简单、使用灵活、运用广泛、运行效率高和较少受到初始条件约束等优点.是解决旅行商问题的一种很好的算法。 相似文献