全文获取类型
收费全文 | 1935篇 |
免费 | 190篇 |
国内免费 | 159篇 |
专业分类
化学 | 213篇 |
晶体学 | 2篇 |
力学 | 56篇 |
综合类 | 31篇 |
数学 | 1443篇 |
物理学 | 539篇 |
出版年
2024年 | 4篇 |
2023年 | 23篇 |
2022年 | 40篇 |
2021年 | 59篇 |
2020年 | 52篇 |
2019年 | 46篇 |
2018年 | 47篇 |
2017年 | 54篇 |
2016年 | 56篇 |
2015年 | 35篇 |
2014年 | 73篇 |
2013年 | 122篇 |
2012年 | 95篇 |
2011年 | 103篇 |
2010年 | 86篇 |
2009年 | 136篇 |
2008年 | 143篇 |
2007年 | 129篇 |
2006年 | 137篇 |
2005年 | 120篇 |
2004年 | 95篇 |
2003年 | 84篇 |
2002年 | 79篇 |
2001年 | 59篇 |
2000年 | 65篇 |
1999年 | 59篇 |
1998年 | 38篇 |
1997年 | 41篇 |
1996年 | 36篇 |
1995年 | 22篇 |
1994年 | 24篇 |
1993年 | 11篇 |
1992年 | 15篇 |
1991年 | 11篇 |
1990年 | 6篇 |
1989年 | 5篇 |
1988年 | 13篇 |
1987年 | 14篇 |
1986年 | 9篇 |
1985年 | 7篇 |
1984年 | 8篇 |
1983年 | 3篇 |
1982年 | 3篇 |
1981年 | 4篇 |
1980年 | 2篇 |
1979年 | 3篇 |
1977年 | 4篇 |
1974年 | 1篇 |
1973年 | 1篇 |
1972年 | 1篇 |
排序方式: 共有2284条查询结果,搜索用时 15 毫秒
21.
Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms 总被引:2,自引:0,他引:2
Hoang Tuy 《Journal of Global Optimization》1991,1(1):23-36
We investigate subdivision strategies that can improve the convergence and efficiency of some branch and bound algorithms of global optimization. In particular, a general class of so called weakly exhaustive simplicial subdivision processes is introduced that subsumes all previously known radial exhaustive processes. This result provides the basis for constructing flexible subdivision strategies that can be adapted to take advantage of various problem conditions. 相似文献
22.
Jinyan Fan 《Computational Optimization and Applications》2006,34(2):215-227
In this paper, we present the new trust region method for nonlinear equations with the trust region converging to zero. The
new method preserves the global convergence of the traditional trust region methods in which the trust region radius will
be larger than a positive constant. We study the convergence rate of the new method under the local error bound condition
which is weaker than the nonsingularity. An example given by Y.X. Yuan shows that the convergence rate can not be quadratic.
Finally, some numerical results are given.
This work is supported by Chinese NSFC grants 10401023 and 10371076, Research Grants for Young Teachers of Shanghai Jiao Tong
University, and E-Institute of Computational Sciences of Shanghai Universities.
An erratum to this article is available at . 相似文献
23.
Alberto Caprara Andrea Lodi Silvano Martello Michele Monaci 《Discrete Optimization》2006,3(4):317-326
We address the problem of packing a given set of rectangles into the minimum size square. We consider three versions of the problem, arising when the rectangles (i) are squares; (ii) have a fixed orientation; (iii) can be rotated by 90. For each case we study lower bounds, and analyze their worst-case performance ratio. In addition, we evaluate through computational experiments their average performance on instances from the literature. 相似文献
24.
给出了大规模界约束优化的一个子空间截断牛顿法。利用截断牛顿法修正非有效约束所对应的变量,用投影梯度法修正有效约束所对应的变量,文中证明了方法的整体收敛性,并对方法进行了数值试验,且与子空间有限内存拟牛顿法进行了数值比较。 相似文献
25.
We give some sufficient conditions for proper lower semicontinuous functions on metric spaces to have error bounds (with exponents).
For a proper convex function f on a normed space X the existence of a local error bound implies that of a global error bound. If in addition X is a Banach space, then error bounds can be characterized by the subdifferential of f. In a reflexive Banach space X, we further obtain several sufficient and necessary conditions for the existence of error bounds in terms of the lower Dini
derivative of f.
Received: April 27, 2001 / Accepted: November 6, 2001?Published online April 12, 2002 相似文献
26.
27.
In this paper, existence criteria are established for the existence of periodic solutions of a second order sublinear differential equation with delay and forcing function. Our method is based on careful a priori estimation and continuation theorems, and our sublinear condition is an improvement of the boundedness condition in some recent results. 相似文献
28.
29.
30.
Currently, most combinatorial optimisation problems have to be solved, if the optimum solution is sought, using general techniques
to explore the space of feasible solutions and, more specifically, through exploratory enumerative procedures in trees and
search graphs. We propose Branch and Win, a general formulation for understanding and synthesising the different tree search
procedures that have been presented in the literature of operations research as well as in that of artificial intelligence.
Several general ideas are also presented, whose application allows designing new hybrid search algorithms, in order to implement
the procedure. 相似文献