全文获取类型
收费全文 | 11714篇 |
免费 | 1095篇 |
国内免费 | 844篇 |
学科分类
工业技术 | 13653篇 |
出版年
2024年 | 44篇 |
2023年 | 107篇 |
2022年 | 180篇 |
2021年 | 168篇 |
2020年 | 253篇 |
2019年 | 219篇 |
2018年 | 199篇 |
2017年 | 300篇 |
2016年 | 339篇 |
2015年 | 424篇 |
2014年 | 555篇 |
2013年 | 810篇 |
2012年 | 700篇 |
2011年 | 800篇 |
2010年 | 574篇 |
2009年 | 829篇 |
2008年 | 882篇 |
2007年 | 918篇 |
2006年 | 810篇 |
2005年 | 676篇 |
2004年 | 605篇 |
2003年 | 543篇 |
2002年 | 455篇 |
2001年 | 363篇 |
2000年 | 318篇 |
1999年 | 233篇 |
1998年 | 233篇 |
1997年 | 203篇 |
1996年 | 135篇 |
1995年 | 104篇 |
1994年 | 97篇 |
1993年 | 72篇 |
1992年 | 74篇 |
1991年 | 43篇 |
1990年 | 35篇 |
1989年 | 40篇 |
1988年 | 44篇 |
1987年 | 26篇 |
1986年 | 23篇 |
1985年 | 35篇 |
1984年 | 47篇 |
1983年 | 27篇 |
1982年 | 22篇 |
1981年 | 20篇 |
1980年 | 19篇 |
1979年 | 12篇 |
1978年 | 7篇 |
1977年 | 11篇 |
1976年 | 9篇 |
1974年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
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. 相似文献
72.
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 相似文献
73.
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. 相似文献
74.
Six misconceptions about evolutionary approaches to human behavior are exposed. Evidence is adduced to support the assertions that evolutionary approaches do not (a) adopt a reductionistic "gene-centered" level of analysis, (b) assume that natural selection is the only process that creates and designs ontogenetic processes and phenotypic outcomes, (c) assume that genes are the only agents responsible for the transgenerational inheritance of phenotypic traits and characteristics, (d) assume that genes are self-contained and impervious to extragenetic influences, (e) posit a strong form of genetic determinism, or (f) pay lip service to the role of the environment. Building straw men and knocking them down is an inherently destructive enterprise; integrating different approaches is a more constructive way of contributing to the growth of knowledge. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
75.
76.
77.
无向网络K终端可靠度的分解算法中,包括多边形→链简化在内的等可靠度简化和分解定理结合,可以降低算法的复杂度。本文完善了边随机无向网络和混合随机无向网络的4#,6#,7#型多边形→链简化定理。计算机编程验证了其正确性。 相似文献
78.
This paper introduces a novel methodology for clustering of symbolic objects by making use of Genetic Algorithms (GAs). GAs
are a family of computational models inspired by evolution. These algorithms encode potential solutions to specific problems
on simple chromosome-like data structures and apply recombination operators to these structures so as to preserve critical
information. A new type of representation for chromosome structure is presented here along with a new method for mutation.
The efficacy of the proposed method is examined by application to numeric data of known number of classes and also to assertion
type of symbolic objects drawn from the domain of fat oil, microcomputers, microprocessors and botany. The validity of the
clusters obtained is examined. 相似文献
79.
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. 相似文献
80.
In this paper we analyze the algebraic formulations of certain geometry statements appearing in recent literature related to mechanical geometry theorem proving and give several examples to show that one of these formulations can cause serious problems. We clarify a formulation which is essentially due to W. T. Wu and, in our opinion, is the most satisfactory.This author was supported by NSF Grants DCR-8503498 and CCR-8702108. 相似文献