全文获取类型
收费全文 | 10227篇 |
免费 | 694篇 |
国内免费 | 543篇 |
专业分类
电工技术 | 526篇 |
综合类 | 831篇 |
化学工业 | 164篇 |
金属工艺 | 116篇 |
机械仪表 | 539篇 |
建筑科学 | 217篇 |
矿业工程 | 59篇 |
能源动力 | 157篇 |
轻工业 | 56篇 |
水利工程 | 69篇 |
石油天然气 | 43篇 |
武器工业 | 50篇 |
无线电 | 907篇 |
一般工业技术 | 766篇 |
冶金工业 | 105篇 |
原子能技术 | 31篇 |
自动化技术 | 6828篇 |
出版年
2024年 | 40篇 |
2023年 | 62篇 |
2022年 | 98篇 |
2021年 | 97篇 |
2020年 | 164篇 |
2019年 | 153篇 |
2018年 | 124篇 |
2017年 | 229篇 |
2016年 | 247篇 |
2015年 | 335篇 |
2014年 | 465篇 |
2013年 | 680篇 |
2012年 | 592篇 |
2011年 | 686篇 |
2010年 | 472篇 |
2009年 | 703篇 |
2008年 | 754篇 |
2007年 | 783篇 |
2006年 | 709篇 |
2005年 | 558篇 |
2004年 | 523篇 |
2003年 | 481篇 |
2002年 | 402篇 |
2001年 | 317篇 |
2000年 | 278篇 |
1999年 | 210篇 |
1998年 | 208篇 |
1997年 | 196篇 |
1996年 | 127篇 |
1995年 | 104篇 |
1994年 | 99篇 |
1993年 | 72篇 |
1992年 | 72篇 |
1991年 | 46篇 |
1990年 | 34篇 |
1989年 | 40篇 |
1988年 | 45篇 |
1987年 | 25篇 |
1986年 | 22篇 |
1985年 | 32篇 |
1984年 | 47篇 |
1983年 | 27篇 |
1982年 | 21篇 |
1981年 | 20篇 |
1980年 | 18篇 |
1979年 | 12篇 |
1978年 | 7篇 |
1977年 | 11篇 |
1976年 | 9篇 |
1975年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
22.
Paolo Detti 《Journal of Scheduling》2008,11(3):205-212
A variant of the High Multiplicity Multiprocessor Scheduling Problem with C job lengths is considered, in which jobs can be processed only by machines not greater than a given index. When C=2, polynomial algorithms are proposed, for the feasibility version of the problem and for maximizing the number of scheduled
jobs. 相似文献
23.
The recommendation of the CIE has been followed as closely as possible to evaluate the accuracy of five color gamut mapping algorithms (GMAs)—two nonspatial and three spatial algorithms—by psychophysical experiments with 20 test images, 20 observers, one test done on paper and a second one on display. Even though the results do not show any overall “winner,” one GMA is definitely perceived as not accurate. The importance of a high number of test images to obtain robust evaluation is underlined by the high variability of the results depending on the test images. Significant correlations between the percentage of out‐of‐gamut pixels, the number of distinguishable pairs of GMAs, and the perceived difficulty to distinguish them have been found. The type of observers is also important. The experts, who prefer a spatial GMA, show a stronger consensus and look especially for a good rendering of details, whereas the nonexperts hardly make a difference between the GMAs. © 2008 Wiley Periodicals, Inc. Col Res Appl, 33, 470–476, 2008 相似文献
24.
Sun-Yuan Hsieh 《The Journal of supercomputing》2007,39(1):39-57
A graph is distance-hereditary if the distance stays the same between any of two vertices in every connected induced subgraph containing both. Two well-known
classes of graphs, trees and cographs, both belong to distance-hereditary graphs. In this paper, we first show that the perfect
domination problem can be solved in sequential linear-time on distance-hereditary graphs. By sketching some regular property
of the problem, we also show that it can be easily parallelized on distance-hereditary graphs. 相似文献
25.
无向网络K终端可靠度的分解算法中,包括多边形→链简化在内的等可靠度简化和分解定理结合,可以降低算法的复杂度。本文完善了边随机无向网络和混合随机无向网络的4#,6#,7#型多边形→链简化定理。计算机编程验证了其正确性。 相似文献
26.
The focus of this paper is database design using automated database design tools or more general CASE tools. We present a genetic algorithm for the optimization of (internal) database structures, using a multi-criterion objective function. This function expresses conflicting objectives, reflecting the well-known time/space trade-off. This paper shows how the solution space of the algorithm can be set up in the form of tree structures (forests), and how these are encoded by a simple integer assignation. Genetic operators (database transformations) defined in terms of this encoding behave as if they manipulate tree structures. Some basic experimental results produced by a research prototype are presented. 相似文献
27.
A genetic algorithm for the optimisation of assembly sequences 总被引:6,自引:0,他引:6
This paper describes a Genetic Algorithm (GA) designed to optimise the Assembly Sequence Planning Problem (ASPP), an extremely diverse, large scale and highly constrained combinatorial problem. The modelling of the ASPP problem, which has to be able to encode any industrial-size product with realistic constraints, and the GA have been designed to accommodate any type of assembly plan and component. A number of specific modelling issues necessary for understanding the manner in which the algorithm works and how it relates to real-life problems, are succinctly presented, as they have to be taken into account/adapted/solved prior to Solving and Optimising (S/O) the problem. The GA has a classical structure but modified genetic operators, to avoid the combinatorial explosion. It works only with feasible assembly sequences and has the ability to search the entire solution space of full-scale, unabridged problems of industrial size. A case study illustrates the application of the proposed GA for a 25-components product. 相似文献
28.
We consider an integer-subset representation problem motivated by a medical application in radiation therapy. We prove NP-completeness, derive nontrivial bounds, and report on the performance of a greedy heuristic. 相似文献
29.
We present a new post processing method of simulating depth of field based on accurate calculations of circles of confusion. Compared to previous work, our method derives actual scene depth information directly from the existing depth buffer, requires no specialized rendering passes, and allows easy integration into existing rendering applications. Our implementation uses an adaptive, two‐pass filter, producing a high quality depth of field effect that can be executed entirely on the GPU, taking advantage of the parallelism of modern graphics cards and permitting real time performance when applied to large numbers of pixels. 相似文献
30.
The concept of combinatorial objects is formalized. It allows strict definition of a combinatorial optimization problem (COP).
An efficient metaheuristic method to solve COPs (H-method) is considered. It includes stochastic local search algorithms as
a built-in procedure. A parallel implementation of the H-method is set forth and analyzed. The results from a numerical experiment
and solution of some well-known COPs on personal computers and on the SKIT cluster supercomputer are presented.
The study was supported by INTAS (Project 06-1000017-8909).
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 70–79, November–December 2007. 相似文献