首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2512篇
  免费   203篇
  国内免费   123篇
电工技术   50篇
综合类   100篇
化学工业   60篇
金属工艺   54篇
机械仪表   93篇
建筑科学   187篇
矿业工程   17篇
能源动力   19篇
轻工业   37篇
水利工程   23篇
石油天然气   61篇
武器工业   5篇
无线电   209篇
一般工业技术   87篇
冶金工业   234篇
原子能技术   13篇
自动化技术   1589篇
  2024年   11篇
  2023年   32篇
  2022年   24篇
  2021年   31篇
  2020年   34篇
  2019年   33篇
  2018年   48篇
  2017年   40篇
  2016年   69篇
  2015年   79篇
  2014年   131篇
  2013年   145篇
  2012年   164篇
  2011年   199篇
  2010年   174篇
  2009年   170篇
  2008年   173篇
  2007年   146篇
  2006年   146篇
  2005年   166篇
  2004年   124篇
  2003年   137篇
  2002年   122篇
  2001年   47篇
  2000年   38篇
  1999年   42篇
  1998年   89篇
  1997年   49篇
  1996年   27篇
  1995年   27篇
  1994年   19篇
  1993年   13篇
  1992年   8篇
  1991年   9篇
  1990年   8篇
  1989年   3篇
  1988年   8篇
  1987年   5篇
  1986年   4篇
  1985年   13篇
  1984年   8篇
  1983年   4篇
  1982年   3篇
  1981年   3篇
  1980年   3篇
  1979年   5篇
  1978年   2篇
  1976年   2篇
  1975年   1篇
排序方式: 共有2838条查询结果,搜索用时 15 毫秒
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.
针对传统的小区内开环功率控制算法通常以提升本小区的吞吐量性能为目标,忽略了当前小区用户对邻小区用户同频干扰的问题,为提升边缘用户性能的同时兼顾系统整体性能,提出了一种LTE系统小区间上行联合功率控制(UJPC)算法。该算法采用单基站三扇区为系统模型,以最优化系统吞吐量比例公平函数为目标,首先根据最小信干噪比(SINR)约束值和用户最大发射功率这两个约束条件得到相应的数学优化模型,然后采用连续凸近似的方法求解优化问题得出各个基站所管辖的小区内所有用户的最优发射功率。仿真结果表明,与基准的开环功控方案相比,联合功控方案在保证系统平均频谱利用率的情况下能够较大幅度地提高小区边缘频谱利用率,其最佳性能增益能达到50%。  相似文献   
3.
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.  相似文献   
4.
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(nm/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.  相似文献   
5.
6.
Brodal  Makris  Sioutas  Tsakalidis  Tsichlas 《Algorithmica》2002,33(4):494-510
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 .  相似文献   
7.
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.  相似文献   
8.
 The paper investigates the performance of various time stepping schemes for coupled displacement and pore pressure analysis. A number of alternative forms of the automatic time stepping method proposed by Sloan and Abbo (1999a) are also presented. These alternative schemes use different updates for the displacements and pore pressures and also adopt different starting conditions for the iterations. The automatic schemes are compared with an implicit θ-method, as well as an explicit method, through analysis of a variety of problems involving undrained loading, drained loading, and consolidation for Mohr-Coulomb and critical state models. As expected, the numerical results confirm that the explicit scheme is neither accurate nor robust. Although the implicit θ-method is accurate and fast, it fails to give a solution in a number of cases where the time step is large. The automatic schemes are shown to be accurate, fast and generally robust. Two of the automatic schemes proposed never fail to furnish a solution for the cases considered. In addition, all the automatic schemes are able to constrain the time-stepping (temporal integration) error in the displacements and pore pressures to lie near a prescribed tolerance, provided the iteration error tolerance is properly chosen. For complex soil models, it is important that the latter is set sufficiently small in order for the schemes to be able to constrain the time-stepping error to lie within a prescribed tolerance. Dedicated to the memory of Prof. Mike Crisfield, for his cheerfulness and cooperation as a colleague and friend over many years.  相似文献   
9.
10.
Safety,liveness and fairness in temporal logic   总被引:1,自引:0,他引:1  
In this paper we present syntactic characterization of temporal formulas that express various properties of interest in the verification of concurrent programs. Such a characterization helps us in choosing the right techniques for proving correctness with respect to these properties. The properties that we consider include safety properties, liveness properties and fairness properties. We also present algorithms for checking if a given temporal formula expresses any of these properties.This work is partly supported by NSF grant CCR-9212183. A preliminary version of this paper appeared in the Fourth ACM Symposium on Principles of Distributed Computing.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号