全文获取类型
收费全文 | 13153篇 |
免费 | 1149篇 |
国内免费 | 578篇 |
专业分类
化学 | 1790篇 |
晶体学 | 31篇 |
力学 | 1333篇 |
综合类 | 286篇 |
数学 | 8719篇 |
物理学 | 2721篇 |
出版年
2024年 | 23篇 |
2023年 | 131篇 |
2022年 | 297篇 |
2021年 | 428篇 |
2020年 | 261篇 |
2019年 | 308篇 |
2018年 | 315篇 |
2017年 | 439篇 |
2016年 | 471篇 |
2015年 | 338篇 |
2014年 | 671篇 |
2013年 | 783篇 |
2012年 | 809篇 |
2011年 | 693篇 |
2010年 | 595篇 |
2009年 | 784篇 |
2008年 | 809篇 |
2007年 | 837篇 |
2006年 | 730篇 |
2005年 | 615篇 |
2004年 | 480篇 |
2003年 | 452篇 |
2002年 | 432篇 |
2001年 | 385篇 |
2000年 | 380篇 |
1999年 | 275篇 |
1998年 | 293篇 |
1997年 | 263篇 |
1996年 | 192篇 |
1995年 | 191篇 |
1994年 | 171篇 |
1993年 | 131篇 |
1992年 | 123篇 |
1991年 | 100篇 |
1990年 | 84篇 |
1989年 | 81篇 |
1988年 | 55篇 |
1987年 | 47篇 |
1986年 | 48篇 |
1985年 | 70篇 |
1984年 | 59篇 |
1983年 | 16篇 |
1982年 | 28篇 |
1981年 | 27篇 |
1980年 | 25篇 |
1979年 | 32篇 |
1978年 | 22篇 |
1977年 | 32篇 |
1976年 | 23篇 |
1974年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
141.
Arne Barinka Stephan Dahlke Wolfgang Dahmen 《Advances in Computational Mathematics》2006,24(1-4):5-34
Recently adaptive wavelet methods have been developed which can be shown to exhibit an asymptotically optimal accuracy/work
balance for a wide class of variational problems including classical elliptic boundary value problems, boundary integral equations
as well as certain classes of noncoercive problems such as saddle point problems. A core ingredient of these schemes is the
approximate application of the involved operators in standard wavelet representation. Optimal computational complexity could
be shown under the assumption that the entries in properly compressed standard representations are known or computable in
average at unit cost. In this paper we propose concrete computational strategies and show under which circumstances this assumption
is justified in the context of elliptic boundary value problems.
Dedicated to Charles A. Micchelli on the occasion of his 60th birthday
Mathematics subject classifications (2000) 41A25, 41A46, 65F99, 65N12, 65N55.
This work has been supported in part by the Deutsche Forschungsgemeinschaft SFB 401, the first and third author are supported
in part by the European Community's Human Potential Programme under contract HPRN-CT-202-00286 (BREAKING COMPLEXITY). The
second author acknowledges the financial support provided through the European Union's Human Potential Programme, under contract
HPRN-CT-2002-00285 (HASSIP) and through DFG grant DA 360/4–1. 相似文献
142.
Pure adaptive search constructs a sequence of points uniformly distributed within a corresponding sequence of nested regions of the feasible space. At any stage, the next point in the sequence is chosen uniformly distributed over the region of feasible space containing all points that are equal or superior in value to the previous points in the sequence. We show that for convex programs the number of iterations required to achieve a given accuracy of solution increases at most linearly in the dimension of the problem. This compares to exponential growth in iterations required for pure random search. 相似文献
143.
Kenneth Sörensen 《Central European Journal of Operations Research》2006,14(2):193-207
In this paper, we argue that vehicle routing solutions are often tactical decisions, that should not be changed too often
or too much. For marketing or other reasons, vehicle routing solutions should be stable, i.e. a new solution (when e.g. new customers require service) should be as similar as possible to a solution already in
use. Simultaneously however, this new solution should still have a good quality in the traditional sense (e.g. small total
travel cost). In this paper, we develop a way to measure the difference between two vehicle routing solutions. We use this
distance measure to create a metaheuristic approach that will find solutions that are “close” (in the solution space) to a
given baseline solution and at the same time have a high quality in the sense that their total distance traveled is small.
By using this approach, the dispatcher is offered a choice of Pareto-optimal solutions, allowing him to make a trade-off between
changing his existing solution and allowing a longer travel distance. Some experiments are performed to show the effectiveness
of the approach. 相似文献
144.
场源基本微元的对称性与场的性质 总被引:1,自引:1,他引:0
直接由标量基本微元(点源)和矢量基本微元(电流元等)的对称性和两个基本假设讨论基本微元产生的场矢量的性质。 相似文献
145.
Jeannette Van Iseghem 《Numerical Algorithms》2002,29(1-3):267-279
A method for solving a linear system is defined. It is a Lanczos-type method, but it uses formal vector orthogonality instead of scalar orthogonality. Moreover, the dimension of vector orthogonality may vary which gives a large freedom in leading the algorithm, and controlling the numerical problems. The ideas of truncated and restarted methods are revisited. The obtained residuals are exactly orthogonal to a space of increasing dimension. Some experiments are done, the problem of finding automaticaly good directions of projection remains partly open. 相似文献
146.
本主要介绍原木经销商在周期内原木变价销售情况下的最佳期初贮存量的决策方法,在建立期望机会成本的数学模型基础上,探讨原木随机存贮策略的最优化问题。 相似文献
147.
潘继斌 《数学的实践与认识》2006,36(2):182-185
研究了基于支持向量机的后验概率的应用,提出了对样本集进行分解,以产生局部后验概率,根据模式的稳健性对局部后验概率进行凸组合融合的方法. 相似文献
148.
A domain partitioning algorithm for minimizing or maximizing a Lipschitz continuous function is enhanced to yield two new, more efficient algorithms. The use of interval arithmetic in the case of rational functions and the estimates of Lipschitz constants valid in subsets of the domain in the case of others and the addition of local optimization have resulted in an algorithm which, in tests on standard functions, performs well. 相似文献
149.
Dirk P. Kroese Sergey Porotsky Reuven Y. Rubinstein 《Methodology and Computing in Applied Probability》2006,8(3):383-407
In recent years, the cross-entropy method has been successfully applied to a wide range of discrete optimization tasks. In
this paper we consider the cross-entropy method in the context of continuous optimization. We demonstrate the effectiveness
of the cross-entropy method for solving difficult continuous multi-extremal optimization problems, including those with non-linear
constraints.
相似文献
150.
C. Zălinescu 《Mathematical Methods of Operations Research》1991,35(4):291-298
In this paper there is stated a result on sets in ordered linear spaces which can be used to show that some properties of the sets are inherited by their convex hulls under suitable conditions. As applications one gives a characterization of weakly efficient points and a duality result for nonconvex vector optimization problems. 相似文献