全文获取类型
收费全文 | 14067篇 |
免费 | 1376篇 |
国内免费 | 1010篇 |
专业分类
化学 | 3187篇 |
晶体学 | 63篇 |
力学 | 1959篇 |
综合类 | 186篇 |
数学 | 6959篇 |
物理学 | 4099篇 |
出版年
2024年 | 29篇 |
2023年 | 151篇 |
2022年 | 449篇 |
2021年 | 459篇 |
2020年 | 310篇 |
2019年 | 336篇 |
2018年 | 375篇 |
2017年 | 477篇 |
2016年 | 492篇 |
2015年 | 387篇 |
2014年 | 704篇 |
2013年 | 929篇 |
2012年 | 865篇 |
2011年 | 753篇 |
2010年 | 682篇 |
2009年 | 826篇 |
2008年 | 821篇 |
2007年 | 877篇 |
2006年 | 751篇 |
2005年 | 674篇 |
2004年 | 569篇 |
2003年 | 499篇 |
2002年 | 479篇 |
2001年 | 415篇 |
2000年 | 399篇 |
1999年 | 335篇 |
1998年 | 334篇 |
1997年 | 290篇 |
1996年 | 214篇 |
1995年 | 240篇 |
1994年 | 209篇 |
1993年 | 153篇 |
1992年 | 140篇 |
1991年 | 123篇 |
1990年 | 92篇 |
1989年 | 87篇 |
1988年 | 65篇 |
1987年 | 54篇 |
1986年 | 45篇 |
1985年 | 65篇 |
1984年 | 59篇 |
1983年 | 15篇 |
1982年 | 39篇 |
1981年 | 27篇 |
1980年 | 20篇 |
1979年 | 38篇 |
1978年 | 27篇 |
1977年 | 31篇 |
1976年 | 20篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
《Annales de l'Institut Henri Poincaré (C) Analyse Non Linéaire》2021,38(5):1337-1371
In this paper we consider minimizers of the functional where is a bounded open set and where are the first k eigenvalues on Ω of an operator in divergence form with Dirichlet boundary condition and with Hölder continuous coefficients. We prove that the optimal sets have finite perimeter and that their free boundary is composed of a regular part, which is locally the graph of a -regular function, and a singular part, which is empty if , discrete if and of Hausdorff dimension at most if , for some . 相似文献
2.
3.
Ji-Ming Peng 《Mathematical Programming》1997,78(3):347-355
In this paper we propose a class of merit functions for variational inequality problems (VI). Through these merit functions,
the variational inequality problem is cast as unconstrained minimization problem. We estimate the growth rate of these merit
functions and give conditions under which the stationary points of these functions are the solutions of VI.
This work was supported by the state key project “Scientific and Engineering Computing”. 相似文献
4.
5.
Well-Posedness by Perturbations of Variational Problems 总被引:3,自引:0,他引:3
Lemaire B. Ould Ahmed Salem C. Revalski J. P. 《Journal of Optimization Theory and Applications》2002,115(2):345-368
In this paper, we consider the extension of the notion of well-posedness by perturbations, introduced by Zolezzi for optimization problems, to other related variational problems like inclusion problems and fixed-point problems. Then, we study the conditions under which there is equivalence of the well-posedness in the above sense between different problems. Relations with the so-called diagonal well-posedness are also given. Finally, an application to staircase iteration methods is presented. 相似文献
6.
This paper presents an adaptive memory-based method for solving the Capacitated Vehicle Routing Problem (CVRP), called BoneRoute. The CVRP deals with the problem of finding the optimal sequence of deliveries conducted by a fleet of homogeneous vehicles, based at one depot, to serve a set of customers. The computational performance of the BoneRoute was found to be very efficient, producing high quality solutions over two sets of well known case studies examined. 相似文献
7.
In this paper, we will propose algorithms for calculating a minimal ellipsoid circumscribing a polytope defined by a system
of linear inequalities. If we know all vertices of the polytope and its cardinality is not very large, we can solve the problem
in an efficient manner by a number of existent algorithms. However, when the polytope is defined by linear inequalities, these
algorithms may not work since the cardinality of vertices may be huge. Based on a fact that vertices determining an ellipsoid
are only a fraction of these vertices, we propose algorithms which iteratively calculate an ellipsoid which covers a subset
of vertices. Numerical experiment shows that these algorithms perform well for polytopes of dimension up to seven. 相似文献
8.
Mikhail Andramonov 《Journal of Global Optimization》2002,24(2):115-132
We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency. 相似文献
9.
Y. Wardi 《Journal of Optimization Theory and Applications》1989,61(3):473-485
A stochastic algorithm for finding stationary points of real-valued functions defined on a Euclidean space is analyzed. It is based on the Robbins-Monro stochastic approximation procedure. Gradient evaluations are done by means of Monte Carlo simulations. At each iteratex
i
, one sample point is drawn from an underlying probability space, based on which the gradient is approximated. The descent direction is against the approximation of the gradient, and the stepsize is 1/i. It is shown that, under broad conditions, w.p.1 if the sequence of iteratesx
1,x
2,...generated by the algorithm is bounded, then all of its accumulation points are stationary. 相似文献
10.