全文获取类型
收费全文 | 3902篇 |
免费 | 445篇 |
国内免费 | 312篇 |
专业分类
电工技术 | 64篇 |
技术理论 | 1篇 |
综合类 | 329篇 |
化学工业 | 49篇 |
金属工艺 | 10篇 |
机械仪表 | 79篇 |
建筑科学 | 135篇 |
矿业工程 | 27篇 |
能源动力 | 15篇 |
轻工业 | 19篇 |
水利工程 | 35篇 |
石油天然气 | 26篇 |
武器工业 | 20篇 |
无线电 | 674篇 |
一般工业技术 | 220篇 |
冶金工业 | 125篇 |
原子能技术 | 5篇 |
自动化技术 | 2826篇 |
出版年
2024年 | 17篇 |
2023年 | 27篇 |
2022年 | 52篇 |
2021年 | 66篇 |
2020年 | 72篇 |
2019年 | 86篇 |
2018年 | 88篇 |
2017年 | 113篇 |
2016年 | 124篇 |
2015年 | 118篇 |
2014年 | 200篇 |
2013年 | 275篇 |
2012年 | 238篇 |
2011年 | 310篇 |
2010年 | 211篇 |
2009年 | 262篇 |
2008年 | 274篇 |
2007年 | 287篇 |
2006年 | 227篇 |
2005年 | 210篇 |
2004年 | 186篇 |
2003年 | 160篇 |
2002年 | 123篇 |
2001年 | 109篇 |
2000年 | 84篇 |
1999年 | 82篇 |
1998年 | 72篇 |
1997年 | 42篇 |
1996年 | 60篇 |
1995年 | 46篇 |
1994年 | 50篇 |
1993年 | 34篇 |
1992年 | 36篇 |
1991年 | 28篇 |
1990年 | 21篇 |
1989年 | 16篇 |
1988年 | 15篇 |
1987年 | 7篇 |
1986年 | 6篇 |
1985年 | 21篇 |
1984年 | 23篇 |
1983年 | 25篇 |
1982年 | 26篇 |
1981年 | 21篇 |
1980年 | 25篇 |
1979年 | 29篇 |
1978年 | 10篇 |
1977年 | 6篇 |
1976年 | 12篇 |
1964年 | 5篇 |
排序方式: 共有4659条查询结果,搜索用时 0 毫秒
151.
针对线性规划问题,文中引入了一种与传统障碍函数不同的新的障碍函数,其在可行域边界上的取值是有限的.沿此有限障碍函数所确定的新的搜索方向,给出了短步长全牛顿步内点算法,结果证明该算法具有目前求解线性规划问题最好的复杂性界. 相似文献
152.
153.
《国际计算机数学杂志》2012,89(4):271-286
A recursive version of the Turing machine model is used to analyze the time and storage complexity of recursive algorithms. Hierarchy theorems are proven for time and for width of recursion (the amount of storage used at a level). A particular language is shown to be the “hardest” language to recognize without recursion. Previous results relating recursive and non-recursive time bounded computations are sharpened. 相似文献
154.
《国际计算机数学杂志》2012,89(15):3370-3386
We study the complexity of a two-point boundary value problem. We concentrate on the linear problem of order k with separated boundary conditions. Right-hand side functions are assumed to be r times differentiable with all derivatives bounded by a constant. We consider three models of computation: deterministic with standard and linear information, randomized and quantum. In each setting, we construct an algorithm for solving the problem, which allows us to establish upper complexity bounds. In the deterministic setting, we show that the use of linear information gives us a speed-up of at least one order of magnitude compared with the standard information. For randomized algorithms, we show that the speed-up over standard deterministic algorithms is by 1/2 in the exponent. For quantum algorithms, we can achieve a speed-up by one order of magnitude. We also provide lower complexity bounds. They match upper bounds in the deterministic setting with the standard information, and almost match upper bounds in the randomized and quantum settings. In the deterministic setting with the linear information, a gap still remains between the upper and lower complexity bounds. 相似文献
155.
《国际计算机数学杂志》2012,89(1):37-50
For the global optimization problems with continuous variables, evolutionary algorithms (EAs) are often used to find the approximate solutions. The number of generations for an EA to find the approximate solutions, called the first hitting time, is an important index to measure the performance of the EA. However, calculating the first hitting time is still difficult in theory. This paper proposes some new drift conditions that are used to estimate the upper bound of the first hitting times of EAs for finding the approximate solutions. Two case studies are given to show how to apply these conditions to estimate the first hitting times. 相似文献
156.
《国际计算机数学杂志》2012,89(11):1357-1362
Let G be an edge-coloured graph. We show in this paper that it is NP-hard to find the minimum number of vertex disjoint monochromatic trees which cover the vertices of the graph G. We also show that there is no constant factor approximation algorithm for the problem unless P?=?NP. The same results hold for the problem of finding the minimum number of vertex disjoint monochromatic cycles (paths, respectively) which cover the vertices of the graph. 相似文献
157.
《国际计算机数学杂志》2012,89(1-4):255-268
Parallel Breadth-First Search (BFS) algorithms for ordered trees and graphs on a shared memory model of a Single Instruction-stream Multiple Data-stream computer are proposed. The parallel BFS algorithm for trees computes the BFS rank of eachnode of an ordered tree consisting of n nodes in time of 0(β log n) when 0(n 1+1/β) processors are used, β being an integer greater than or equal to 2. The parallel BFS algorithm for graphs produces Breadth-First Spanning Trees (BFSTs) of a directedgraph G having n nodes in time 0(log d.log n) using 0(n 3) processors, where d is the diameter of G If G is a strongly connected graph or a connected undirected graph the BFS algorithm produces n BFSTs, each BFST having a different start node. 相似文献
158.
《国际计算机数学杂志》2012,89(3-4):209-219
Rectangle intersections involving rectilinearly-oriented (hyper-) rectangles in d-dimensional real space are examined from two points of view. First, a data structure is developed which is efficient in time and space and allows us to report all d-dimensional rectangles stored which intersect a d-dimensional query rectangle. Second, in Part II, a slightly modified version of this new data structure is applied to report all intersecting pairs of rectangles of a given set. This approach yields a solution which is optimal in time and space for planar rectangles and reasonable in higher dimensions. 相似文献
159.
《国际计算机数学杂志》2012,89(1-4):93-115
We study regularly controlled bidirectional (RCB) grammars from the viewpoint of time-bounded grammars. RCB-grammars are context-free grammars of which the rules can be used in a productive and in a reductive fashion, while the application of these rules is controlled by a regular language. Several modes of derivation can be distinguished for this kind of grammar. A time bound on such a grammar is a measure of its derivational complexity. For some families of time bounds and for some modes of derivation we establish closure properties and a normal form theorem. In addition parsing algorithms are given for some modes of derivation. We conclude with considering generalizations with respect to the family of control languages and the family of bounding functions.. 相似文献
160.
In component‐based development, software systems are built by assembling components already developed and prepared for integration. To estimate the quality of components, complexity, reusability, dependability, and maintainability are the key aspects. The quality of an individual component influences the quality of the overall system. Therefore, there is a strong need to select the best quality component, both from functional and nonfunctional aspects. The present paper produces a critical analysis of metrics for various quality aspects for components and component‐based systems. These aspects include four main quality factors: complexity, dependency, reusability, and maintainability. A systematic study is applied to find as much literature as possible. A total of 49 papers were found suitable after a defined search criteria. The analysis provided in this paper has a different objective as we focused on efficiency and practical ability of the proposed approach in the selected papers. The various key attributes from these two are defined. Each paper is evaluated based on the various key parameters viz. metrics definition, implementation technique, validation, usability, data source, comparative analysis, practicability, and extendibility. The paper critically examines various quality aspects and their metrics for component‐based systems. In some papers, authors have also compared the results with other techniques. For characteristics like complexity and dependency, most of the proposed metrics are analytical. Soft computing and evolutionary approaches are either not being used or much less explored so far for these aspects, which may be the future concern for the researchers. In addition, hybrid approaches like neuro‐fuzzy, neuro‐genetic, etc., may also be examined for evaluation of these aspects. However, to conclude that one particular technique is better than others may not be appropriate. It may be true for one characteristic by considering different set of inputs and dataset but may not be true for the same with different inputs. The intension in the proposed work is to give a score for each metric proposed by the researchers based on the selected parameters, but certainly not to criticize any research contribution by authors. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献