全文获取类型
收费全文 | 1522篇 |
免费 | 60篇 |
国内免费 | 48篇 |
专业分类
电工技术 | 22篇 |
综合类 | 54篇 |
化学工业 | 8篇 |
金属工艺 | 18篇 |
机械仪表 | 42篇 |
建筑科学 | 24篇 |
矿业工程 | 4篇 |
能源动力 | 8篇 |
轻工业 | 3篇 |
水利工程 | 6篇 |
石油天然气 | 6篇 |
武器工业 | 4篇 |
无线电 | 64篇 |
一般工业技术 | 46篇 |
冶金工业 | 216篇 |
原子能技术 | 1篇 |
自动化技术 | 1104篇 |
出版年
2024年 | 3篇 |
2023年 | 4篇 |
2022年 | 4篇 |
2021年 | 6篇 |
2020年 | 8篇 |
2019年 | 9篇 |
2018年 | 4篇 |
2017年 | 15篇 |
2016年 | 24篇 |
2015年 | 28篇 |
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条查询结果,搜索用时 0 毫秒
31.
In the Max Lin-2 problem we are given a system S of m linear equations in n variables over F2 in which equation j is assigned a positive integral weight wj for each j. We wish to find an assignment of values to the variables which maximizes the total weight of satisfied equations. This problem generalizes Max Cut. The expected weight of satisfied equations is W/2, where W=w1+?+wm; W/2 is a tight lower bound on the optimal solution of Max Lin-2.Mahajan et al. (Parameterizing above or below guaranteed values, J. Comput. Syst. Sci. 75 (2009) 137-153) stated the following parameterized version of Max Lin-2: decide whether there is an assignment of values to the variables that satisfies equations of total weight at least W/2+k, where k is the parameter. They asked whether this parameterized problem is fixed-parameter tractable, i.e., can be solved in time f(k)(nm)O(1), where f(k) is an arbitrary computable function in k only. Their question remains open, but using some probabilistic inequalities and, in one case, a Fourier analysis inequality, Gutin et al. (A probabilistic approach to problems parameterized above tight lower bound, in: Proc. IWPEC'09, in: Lect. Notes Comput. Sci., vol. 5917, 2009, pp. 234-245) proved that the problem is fixed-parameter tractable in three special cases.In this paper we significantly extend two of the three special cases using only tools from combinatorics. We show that one of our results can be used to obtain a combinatorial proof that another problem from Mahajan et al. (Parameterizing above or below guaranteed values, J. Comput. Syst. Sci. 75 (2009) 137-153), Max r-SAT above Average, is fixed-parameter tractable for each r?2. Note that Max r-SAT above Average has been already shown to be fixed-parameter tractable by Alon et al. (Solving MAX-r-SAT above a tight lower bound, in: Proc. SODA 2010, pp. 511-517), but the paper used the approach of Gutin et al. (A probabilistic approach to problems parameterized above tight lower bound, in: Proc. IWPEC'09, in: Lect. Notes Comput. Sci., vol. 5917, 2009, pp. 234-245). 相似文献
32.
33.
并行FFT是解决大数据量FFT运算耗时过久的重要途径,在PC机群上实现并行FFT是一种低成本、高效率的解决方案。本文讨论了PC机群环境下MPI并行FFT实现,并利用建立的平台,对并行算法进行了测试,得出了一些有意义的结论和方法。 相似文献
34.
35.
The bottleneck network flow problem (BNFP) is a generalization of several well-studied bottleneck problems such as the bottleneck transportation problem (BTP), bottleneck assignment problem (BAP), bottleneck path problem (BPP), and so on. The BNFP can easily be solved as a sequence of O(logn) maximum flow problems on almost unit capacity networks. We observe that this algorithm runs in O(min{m3/2,n2/3m}logn) time by showing that the maximum flow problem on an almost unit capacity graph can be solved in O(min{m3/2,n2/3m}) time. We then propose a faster algorithm to solve the unit capacity BNFP in time, an improvement by a factor of at least . For dense graphs, the improvement is by a factor of . On unit capacity simple graphs, we show that BNFP can be solved in time, an improvement by a factor of . As a consequence we have an algorithm for the BTP with unit arc capacities. 相似文献
36.
Given a real number sequence A=(a1,a2,…,an), an average lower bound L, and an average upper bound U, the Average-Constrained Maximum-Sum Segment problem is to locate a segment A(i,j)=(ai,ai+1,…,aj) that maximizes ∑i?k?jak subject to . In this paper, we give an O(n)-time algorithm for the case where the average upper bound is ineffective, i.e., U=∞. On the other hand, we prove that the time complexity of the problem with an effective average upper bound is Ω(nlogn) even if the average lower bound is ineffective, i.e., L=−∞. 相似文献
37.
Given a list of n items and a function defined over sub-lists, we study the space required for computing the function for arbitrary sub-lists in constant time.For the function mode we improve the previously known space bound O(n2/logn) to O(n2loglogn/log2n) words.For median the space bound is improved to O(n2loglog2n/log2n) words from O(n2⋅log(k)n/logn), where k is an arbitrary constant and log(k) is the iterated logarithm. 相似文献
38.
We study the problems to find a maximum packing of shortest edge-disjoint cycles in a graph of given girth g (g-ESCP) and its vertex-disjoint analogue g-VSCP. In the case g=3, Caprara and Rizzi (2001) have shown that g-ESCP can be solved in polynomial time for graphs with maximum degree 4, but is APX-hard for graphs with maximum degree 5, while g-VSCP can be solved in polynomial time for graphs with maximum degree 3, but is APX-hard for graphs with maximum degree 4. For g∈{4,5}, we show that both problems allow polynomial time algorithms for instances with maximum degree 3, but are APX-hard for instances with maximum degree 4. For each g?6, both problems are APX-hard already for graphs with maximum degree 3. 相似文献
39.
Eunsang Kim 《Information Processing Letters》2009,109(9):454-459
Bentley and Sedgewick proposed multikey Quicksort with ‘split-end’ partitioning for sorting strings. But it can be slow in case of many equal elements because it adopted ‘split-end’ partitioning that moves equal elements to the ends and swaps back to the middle. We present ‘collect-center’ partitioning to improve multikey Quicksort in that case. It moves equal elements to the middle directly like the ‘Dutch National Flag Problem’ partitioning approach and it uses two inner loops like Bentley and McIlroy's. In case of many equal elements such as DNA sequences, HTML files, and English texts, multikey Quicksort with ‘collect-center’ partitioning is faster than multikey Quicksort with ‘split-end’ partitioning. 相似文献
40.
We point out a subtle error in the proof of Chrobak's theorem that every unary NFA can be represented as a union of arithmetic progressions that is at most quadratically large. We propose a correction for this and show how Martinez's polynomial time algorithm, which realizes Chrobak's theorem, can be made correct accordingly. We also show that Martinez's algorithm cannot be improved to have logarithmic space, unless L = NL. 相似文献