全文获取类型
收费全文 | 1524篇 |
免费 | 60篇 |
国内免费 | 46篇 |
专业分类
电工技术 | 22篇 |
综合类 | 54篇 |
化学工业 | 8篇 |
金属工艺 | 18篇 |
机械仪表 | 42篇 |
建筑科学 | 23篇 |
矿业工程 | 4篇 |
能源动力 | 8篇 |
轻工业 | 2篇 |
水利工程 | 6篇 |
石油天然气 | 6篇 |
武器工业 | 4篇 |
无线电 | 64篇 |
一般工业技术 | 47篇 |
冶金工业 | 217篇 |
原子能技术 | 1篇 |
自动化技术 | 1104篇 |
出版年
2024年 | 3篇 |
2023年 | 4篇 |
2022年 | 4篇 |
2021年 | 6篇 |
2020年 | 9篇 |
2019年 | 9篇 |
2018年 | 4篇 |
2017年 | 15篇 |
2016年 | 24篇 |
2015年 | 27篇 |
2014年 | 49篇 |
2013年 | 66篇 |
2012年 | 62篇 |
2011年 | 94篇 |
2010年 | 108篇 |
2009年 | 109篇 |
2008年 | 116篇 |
2007年 | 92篇 |
2006年 | 111篇 |
2005年 | 116篇 |
2004年 | 94篇 |
2003年 | 102篇 |
2002年 | 99篇 |
2001年 | 28篇 |
2000年 | 19篇 |
1999年 | 24篇 |
1998年 | 63篇 |
1997年 | 36篇 |
1996年 | 19篇 |
1995年 | 16篇 |
1994年 | 13篇 |
1993年 | 11篇 |
1992年 | 6篇 |
1991年 | 7篇 |
1990年 | 7篇 |
1989年 | 3篇 |
1988年 | 7篇 |
1987年 | 4篇 |
1986年 | 3篇 |
1985年 | 13篇 |
1984年 | 8篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1979年 | 5篇 |
1978年 | 2篇 |
1976年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有1630条查询结果,搜索用时 31 毫秒
1.
In this paper, we investigate how adaptive operator selection techniques are able to efficiently manage the balance between exploration and exploitation in an evolutionary algorithm, when solving combinatorial optimization problems. We introduce new high level reactive search strategies based on a generic algorithm's controller that is able to schedule the basic variation operators of the evolutionary algorithm, according to the observed state of the search. Our experiments on SAT instances show that reactive search strategies improve the performance of the solving algorithm. 相似文献
2.
We consider the switchbox routing problem of two-terminal nets in the case when all thek nets lie on two adjacent sides of the rectangle. Our routing model is the standard two-layer model. We develop an optimal algorithm that routes all the nets whenever a routing exists. The routing obtained uses the fewest possible number of vias. A more general version of this problem (adjacent staircase) is also optimally solved.This research was supported in part by NSA Contract No. MDA-904-85H-0015, NSF Grant No. DCR-86-00378, and by NSF Engineering Research Centers Program NSFD CDR 88003012. 相似文献
3.
This paper presents a quantum protocol that demonstrates that weak coin flipping with bias ≈0.239, less than 1/4, is possible. A bias of 1/4 was the smallest known, and followed from the strong coin flipping protocol of Ambainis in [33rd STOC, 2001] (also proposed by Spekkens and Rudolph [Phys. Rev. A 65 (2002) 012310]). Protocols with yet smaller bias ≈0.207 have independently been discovered by Ambainis (2001) and Spekkens and Rudolph [Phys. Rev. Lett. 89 (2002) 227901]. We also present an alternative strong coin flipping protocol with bias 1/4 with analysis simpler than that of Ambainis [33rd STOC, 2001]. 相似文献
4.
Gabriel Nivasch 《Information Processing Letters》2004,90(3):135-140
We present an algorithm for detecting periodicity in sequences produced by repeated application of a given function. Our algorithm uses logarithmic memory with high probability, runs in linear time, and is guaranteed to stop within the second loop through the cycle. We also present a partitioning technique that offers a time/memory tradeoff. Our algorithm is especially well suited for sequences where the cycle length is typically small compared to the length of the acyclic prefix. 相似文献
5.
6.
Kimmo Fredriksson 《Information Processing Letters》2003,87(4):201-204
Given a text T[1…n] and a pattern P[1…m] over some alphabet Σ of size σ, we want to find all the (exact) occurrences of P in T. The well-known shift-or algorithm solves this problem in time O(n⌈m/w⌉), where w is the number of bits in machine word, using bit-parallelism. We show how to extend the bit-parallelism in another direction, using super-alphabets. This gives a speed-up by a factor s, where s is the number of characters processed simultaneously. The algorithm is implemented, and we show that it works well in practice too. The result is the fastest known algorithm for exact string matching for short patterns and small alphabets. 相似文献
7.
Scale selection using three different representations for images 总被引:1,自引:0,他引:1
J. Martinez-Baena J. A. García J. Fdez-Valdivia Rosa Rodriguez-Sanchez 《Pattern recognition letters》1997,18(14):1453-1467
8.
Abstract. In this paper we refer to the Temporal Precedence Problem on Pure Pointer Machines . This problem asks for the design of a data structure, maintaining a set of stored elements and supporting the following
two operations: insert and precedes . The operation insert (a) introduces a new element a in the structure, while the operation precedes (a,b) returns true iff element a was inserted before element b temporally. In [11] a solution was provided to the problem with worst-case time complexity O (log log n ) per operation and O(n log log n) space, where n is the number of elements inserted. It was also demonstrated that the precedes operation has a lower bound of Ω (log log n ) for the Pure Pointer Machine model of computation. In this paper we present two simple solutions with linear space and worst-case constant insertion
time. In addition, we describe two algorithms that can handle the precedes (a,b) operation in O (log log d ) time, where d is the temporal distance between the elements a and b . 相似文献
9.
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. 相似文献
10.
We show that an n-vertex bipartite K3,3-free graph with n?3 has at most 2n−4 edges and that an n-vertex bipartite K5-free graph with n?5 has at most 3n−9 edges. These bounds are also tight. We then use the bound on the number of edges in a K3,3-free graph to extend two known NC algorithms for planar graphs to K3,3-free graphs. 相似文献