全文获取类型
收费全文 | 21366篇 |
免费 | 2279篇 |
国内免费 | 1295篇 |
专业分类
化学 | 3766篇 |
晶体学 | 72篇 |
力学 | 2771篇 |
综合类 | 472篇 |
数学 | 11690篇 |
物理学 | 6169篇 |
出版年
2024年 | 41篇 |
2023年 | 210篇 |
2022年 | 589篇 |
2021年 | 645篇 |
2020年 | 450篇 |
2019年 | 482篇 |
2018年 | 537篇 |
2017年 | 741篇 |
2016年 | 859篇 |
2015年 | 612篇 |
2014年 | 1146篇 |
2013年 | 1417篇 |
2012年 | 1246篇 |
2011年 | 1195篇 |
2010年 | 1037篇 |
2009年 | 1297篇 |
2008年 | 1316篇 |
2007年 | 1392篇 |
2006年 | 1171篇 |
2005年 | 1036篇 |
2004年 | 882篇 |
2003年 | 770篇 |
2002年 | 731篇 |
2001年 | 638篇 |
2000年 | 597篇 |
1999年 | 509篇 |
1998年 | 484篇 |
1997年 | 431篇 |
1996年 | 335篇 |
1995年 | 332篇 |
1994年 | 269篇 |
1993年 | 230篇 |
1992年 | 200篇 |
1991年 | 156篇 |
1990年 | 132篇 |
1989年 | 112篇 |
1988年 | 94篇 |
1987年 | 75篇 |
1986年 | 73篇 |
1985年 | 90篇 |
1984年 | 85篇 |
1983年 | 24篇 |
1982年 | 55篇 |
1981年 | 31篇 |
1980年 | 24篇 |
1979年 | 43篇 |
1978年 | 28篇 |
1977年 | 36篇 |
1976年 | 22篇 |
1957年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 328 毫秒
81.
82.
Alvim Adriana C.F. Ribeiro Celso C. Glover Fred Aloise Dario J. 《Journal of Heuristics》2004,10(2):205-229
We propose in this work a hybrid improvement procedure for the bin packing problem. This heuristic has several features: the use of lower bounding strategies; the generation of initial solutions by reference to the dual min-max problem; the use of load redistribution based on dominance, differencing, and unbalancing; and the inclusion of an improvement process utilizing tabu search. Encouraging results have been obtained for a very wide range of benchmark instances, illustrating the robustness of the algorithm. The hybrid improvement procedure compares favourably with all other heuristics in the literature. It improved the best known solutions for many of the benchmark instances and found the largest number of optimal solutions with respect to the other available approximate algorithms. 相似文献
83.
单调优化是指目标函数与约束函数均为单调函数的全局优化问题.本文提出一种新的凸化变换方法把单调函数化为凸函数,进而把单调优化问题化为等价的凸极大或凹极小问题,然后采用Hoffman的外逼近方法来求得问题的全局最优解.我们把这种凸化方法同Tuy的Polyblock外逼近方法作了比较,通过数值比较可以看出本文提出的凸化的方法在收敛速度上明显优于Polyblock方法. 相似文献
84.
85.
Kenneth Weber Vilmar Trevisan Luiz Felipe Martins 《Journal of Algorithms in Cognition, Informatics and Logic》2005,54(2):152-167
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (U−bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors. 相似文献
86.
基于改进遗传算法的布局优化子问题 总被引:2,自引:0,他引:2
本针对子问题,构造了布局子问题(关于同构布局等价类)的改进遗传算法。将该算法应用于二维布局优化子问题,数值实验表明该算法能够在很好地保持图元的邻接关系的前提下找到子问题的最优解。由于布局优化问题可分解为有限个子问题,所以利用该算法可以找到整个布局优化问题的全局最优解。 相似文献
87.
88.
We investigate a new interpretation for the Navier-Stokes corrections to the hydrodynamic equation of asymmetric interacting particle systems. We consider a system that starts from a measure associated with a profile that is constant along the drift direction. We show that under diffusive scaling the macroscopic behavior of the process is described by a nonlinear parabolic equation whose diffusion coefficient coincides with the diffusion coefficient of the hydrodynamic equation of the symmetric version of the process. 相似文献
89.
Gabriele Bonanno 《Journal of Global Optimization》1998,12(1):101-104
In this note we introduce a suitable class of functionals, including the class of integral functionals, and prove that any (strict) local minimum of a functional of this class, defined on a decomposable space, is a (strict) global minimum. So, the recent result obtained by Giner in [1] is specified and extended. 相似文献
90.
This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms. 相似文献