全文获取类型
收费全文 | 9091篇 |
免费 | 1124篇 |
国内免费 | 347篇 |
专业分类
化学 | 753篇 |
晶体学 | 14篇 |
力学 | 1033篇 |
综合类 | 325篇 |
数学 | 5628篇 |
物理学 | 2809篇 |
出版年
2024年 | 22篇 |
2023年 | 91篇 |
2022年 | 299篇 |
2021年 | 271篇 |
2020年 | 188篇 |
2019年 | 205篇 |
2018年 | 228篇 |
2017年 | 342篇 |
2016年 | 448篇 |
2015年 | 297篇 |
2014年 | 548篇 |
2013年 | 605篇 |
2012年 | 493篇 |
2011年 | 544篇 |
2010年 | 436篇 |
2009年 | 577篇 |
2008年 | 595篇 |
2007年 | 605篇 |
2006年 | 492篇 |
2005年 | 440篇 |
2004年 | 386篇 |
2003年 | 324篇 |
2002年 | 302篇 |
2001年 | 252篇 |
2000年 | 230篇 |
1999年 | 199篇 |
1998年 | 183篇 |
1997年 | 161篇 |
1996年 | 142篇 |
1995年 | 106篇 |
1994年 | 72篇 |
1993年 | 84篇 |
1992年 | 72篇 |
1991年 | 39篇 |
1990年 | 45篇 |
1989年 | 28篇 |
1988年 | 31篇 |
1987年 | 24篇 |
1986年 | 29篇 |
1985年 | 32篇 |
1984年 | 29篇 |
1983年 | 9篇 |
1982年 | 18篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1959年 | 5篇 |
1957年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
32.
Fabio Schoen 《Journal of Global Optimization》1994,4(1):17-35
In this paper a new algorithm is proposed for global optimization problems. The main idea is that of modifying a standard clustering approach by sequentially sampling the objective function while adaptively deciding an appropriate sample size. Theoretical as well as computational results are presented. 相似文献
33.
In this paper, we present a new algorithm to estimate a regression function in a fixed design regression model, by piecewise
(standard and trigonometric) polynomials computed with an automatic choice of the knots of the subdivision and of the degrees
of the polynomials on each sub-interval. First we give the theoretical background underlying the method: the theoretical performances
of our penalized least-squares estimator are based on non-asymptotic evaluations of a mean-square type risk. Then we explain
how the algorithm is built and possibly accelerated (to face the case when the number of observations is great), how the penalty
term is chosen and why it contains some constants requiring an empirical calibration. Lastly, a comparison with some well-known
or recent wavelet methods is made: this brings out that our algorithm behaves in a very competitive way in term of denoising
and of compression. 相似文献
34.
We address the problem of computing homotopic shortest paths in the presence of obstacles in the plane. Problems on homotopy of paths received attention very recently [Cabello et al., in: Proc. 18th Annu. ACM Sympos. Comput. Geom., 2002, pp. 160–169; Efrat et al., in: Proc. 10th Annu. European Sympos. Algorithms, 2002, pp. 411–423]. We present two output-sensitive algorithms, for simple paths and non-simple paths. The algorithm for simple paths improves the previous algorithm [Efrat et al., in: Proc. 10th Annu. European Sympos. Algorithms, 2002, pp. 411–423]. The algorithm for non-simple paths achieves O(log2n) time per output vertex which is an improvement by a factor of O(n/log2n) of the previous algorithm [Hershberger, Snoeyink, Comput. Geom. Theory Appl. 4 (1994) 63–98], where n is the number of obstacles. The running time has an overhead O(n2+) for any positive constant . In the case k<n2+, where k is the total size of the input and output, we improve the running to O((n+k+(nk)2/3)logO(1)n). 相似文献
35.
36.
SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS (PART I:EQUAL TIMES AND COSTS) 总被引:1,自引:0,他引:1
Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by realloeating resources. In this paper, authors consider a machine scheduling problemwith controllable processing times. In the first part of this paper, a special case where the pro-cessing times and compression costs are uniform among jobs is discussed. Theoretical results are derived that aid in developing an O(n^2) algorithm to slove the problem optimally. In the second part of this paper, authors generalize the discussion to general case, An effective heuristic to the genera/ problem will be presented. 相似文献
37.
Masakazu Muramatsu 《Mathematical Programming》1998,83(1-3):393-406
In this paper, we introduce an affine scaling algorithm for semidefinite programming (SDP), and give an example of a semidefinite
program such that the affine scaling algorithm converges to a non-optimal point. Both our program and its dual have interior
feasible solutions and unique optimal solutions which satisfy strict complementarity, and they are non-degenerate everywhere. 相似文献
38.
朱扬勇 《新疆大学学报(理工版)》1991,8(3):44-45
本文给出了关系数据库模式中求解关键字的一个算法。算法很简洁并且对于[1]定义的一大类问题,执行时间是多项式级的。 相似文献
39.
A bound is given for the average length of a lexicographic path, a definition that is motivated by degeneracies encountered when using the randomized simplex method. 相似文献
40.
两种计算吸光光度法同时测定钙镁 总被引:3,自引:0,他引:3
研究了在pH10.5的硼砂-氢氧化钾缓冲溶液和乙醇的增敏作用条件下,偶氮氯膦Ⅰ与钙、镁的吸收特性,建立了多波长光度法同时测定钙和镁的方法。采用两种矩阵算法对试验数据进行处理,并对结果进行比较和分析。钙和镁含量在0~25μg/25ml范围内用计算法Ⅱ能得到准确结果。 相似文献