全文获取类型
收费全文 | 5815篇 |
免费 | 787篇 |
国内免费 | 474篇 |
专业分类
电工技术 | 146篇 |
技术理论 | 1篇 |
综合类 | 553篇 |
化学工业 | 85篇 |
金属工艺 | 14篇 |
机械仪表 | 83篇 |
建筑科学 | 374篇 |
矿业工程 | 51篇 |
能源动力 | 247篇 |
轻工业 | 24篇 |
水利工程 | 1543篇 |
石油天然气 | 28篇 |
武器工业 | 20篇 |
无线电 | 675篇 |
一般工业技术 | 226篇 |
冶金工业 | 150篇 |
原子能技术 | 5篇 |
自动化技术 | 2851篇 |
出版年
2024年 | 29篇 |
2023年 | 69篇 |
2022年 | 117篇 |
2021年 | 164篇 |
2020年 | 164篇 |
2019年 | 193篇 |
2018年 | 196篇 |
2017年 | 225篇 |
2016年 | 229篇 |
2015年 | 217篇 |
2014年 | 312篇 |
2013年 | 412篇 |
2012年 | 398篇 |
2011年 | 454篇 |
2010年 | 287篇 |
2009年 | 358篇 |
2008年 | 413篇 |
2007年 | 411篇 |
2006年 | 338篇 |
2005年 | 301篇 |
2004年 | 246篇 |
2003年 | 227篇 |
2002年 | 159篇 |
2001年 | 144篇 |
2000年 | 102篇 |
1999年 | 99篇 |
1998年 | 92篇 |
1997年 | 66篇 |
1996年 | 69篇 |
1995年 | 57篇 |
1994年 | 72篇 |
1993年 | 52篇 |
1992年 | 52篇 |
1991年 | 36篇 |
1990年 | 29篇 |
1989年 | 23篇 |
1988年 | 21篇 |
1987年 | 7篇 |
1986年 | 8篇 |
1985年 | 22篇 |
1984年 | 24篇 |
1983年 | 26篇 |
1982年 | 26篇 |
1981年 | 21篇 |
1980年 | 25篇 |
1979年 | 29篇 |
1978年 | 10篇 |
1977年 | 6篇 |
1976年 | 12篇 |
1964年 | 5篇 |
排序方式: 共有7076条查询结果,搜索用时 15 毫秒
21.
This paper deals with the problem of finding graph layerings restricted to a given maximal width. However, other than previous approaches for width-restricted layering, we take into account the space for dummy nodes, which are introduced by edges crossing a layer. The main result is that the problem of finding a width-restricted layering under consideration of dummy nodes is NP-complete even when all regular nodes have the same constant width and all dummy nodes have the same constant width. 相似文献
22.
23.
Yong-Jik KimJames H. Anderson 《Information Processing Letters》2002,84(1):47-55
A simple code transformation is presented that reduces the space complexity of Yang and Anderson's local-spin mutual exclusion algorithm. In both the original and the transformed algorithm, only atomic read and write instructions are used; each process generates Θ(logN) remote memory references per lock request, where N is the number of processes. The transformed algorithm uses Θ(N) distinct variables, which is clearly optimal. 相似文献
24.
A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs 总被引:1,自引:0,他引:1
We consider the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs. Each job consists of several operations that belong to different families. In a schedule, each family of job operations may be processed in batches with each batch incurring a setup time. A job completes when all of its operations have been processed. The objective is to minimize the number of tardy jobs. In the literature, this problem has been proved to be strongly NP-hard for arbitrary due-dates. We show in this paper that the problem remains strongly NP-hard even when the due-dates are common and all jobs have the same processing time. 相似文献
25.
26.
PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
We consider the problem of PAC-learning distributions over strings, represented by probabilistic deterministic finite automata (PDFAs). PDFAs are a probabilistic model for the generation of strings of symbols, that have been used in the context of speech and handwriting recognition, and bioinformatics. Recent work on learning PDFAs from random examples has used the KL-divergence as the error measure; here we use the variation distance. We build on recent work by Clark and Thollard, and show that the use of the variation distance allows simplifications to be made to the algorithms, and also a strengthening of the results; in particular that using the variation distance, we obtain polynomial sample size bounds that are independent of the expected length of strings. 相似文献
27.
The constraint satisfaction problem is known to be NP-hard in general, but a number of restrictions of the problem have been identified over the years which ensure tractability. This paper introduces two simple methods of combining two or more tractable classes over disjoint domains, in order to synthesise larger, more expressive tractable classes. We demonstrate that the classes so obtained are genuinely novel, and have not been previously identified. In addition, we use algebraic techniques to extend the tractable classes which we identify, and to show that the algorithms for solving these extended classes can be less than obvious. 相似文献
28.
本文简要的介绍了瀑布沟工程水文分析计算主要依据站的选定和基本资料的插补延长,以及径流、洪水的分析计算方法.在可行性研究阶段水文成果(通过审查)和新设立的毛头码水文站所取得的数年水文资料的基础上,将初设阶段对可行性研究阶段的水文分析计算方法和成果进行验证和补充的情况重点予以介绍. 相似文献
29.
We consider a system defined as the product of a finite set of periodic systems on cyclic groups. It is of interest to determine if certain subgroups and unions of subgroups of the state set are reachable from a specified initial state, and in particular to determine the computational complexity of verifying such reachability. These questions are motivated by certain problems that arise in the modelling and control of discrete event systems and certain forms of periodic scheduling. Our main result is that deciding whether or not the union of a certain set of subgroups is reachable or not is NP-complete. 相似文献
30.
Mohammad Taghi Hajiaghayi Yashar Ganjali 《Information Processing Letters》2002,83(3):163-166
A binary matrix has the Consecutive Ones Property (C1P) for columns if there exists a permutation of its rows that leaves the 1's consecutive in every column. The problem of Consecutive Ones Property for a matrix is a special variant of Consecutive Ones Submatrix problem in which a positive integer K is given and we want to know if there exists a submatrix B of A consisting of K columns of A with C1P property. This paper presents an error in the proof of NP-completeness for this problem in the reference cited in text by Garey and Johnson [Computers and Intractability, A Guide to the Theory of NP-Completeness, 1979]. 相似文献