全文获取类型
收费全文 | 12773篇 |
免费 | 1209篇 |
国内免费 | 542篇 |
专业分类
化学 | 1474篇 |
晶体学 | 32篇 |
力学 | 1341篇 |
综合类 | 241篇 |
数学 | 9718篇 |
物理学 | 1718篇 |
出版年
2024年 | 29篇 |
2023年 | 131篇 |
2022年 | 262篇 |
2021年 | 387篇 |
2020年 | 295篇 |
2019年 | 310篇 |
2018年 | 354篇 |
2017年 | 473篇 |
2016年 | 453篇 |
2015年 | 315篇 |
2014年 | 585篇 |
2013年 | 847篇 |
2012年 | 743篇 |
2011年 | 630篇 |
2010年 | 579篇 |
2009年 | 706篇 |
2008年 | 719篇 |
2007年 | 806篇 |
2006年 | 676篇 |
2005年 | 582篇 |
2004年 | 468篇 |
2003年 | 472篇 |
2002年 | 439篇 |
2001年 | 401篇 |
2000年 | 371篇 |
1999年 | 296篇 |
1998年 | 297篇 |
1997年 | 267篇 |
1996年 | 192篇 |
1995年 | 208篇 |
1994年 | 166篇 |
1993年 | 138篇 |
1992年 | 126篇 |
1991年 | 106篇 |
1990年 | 92篇 |
1989年 | 70篇 |
1988年 | 60篇 |
1987年 | 46篇 |
1986年 | 43篇 |
1985年 | 66篇 |
1984年 | 64篇 |
1983年 | 17篇 |
1982年 | 32篇 |
1981年 | 29篇 |
1980年 | 35篇 |
1979年 | 39篇 |
1978年 | 24篇 |
1977年 | 36篇 |
1976年 | 19篇 |
1957年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 437 毫秒
121.
Youssef Saab 《Journal of Heuristics》1997,3(3):207-224
A heuristic optimization methodology, Dynamic Contraction (DC), is introduced as an approach for solving a wide variety of hard combinatorial problems. Contraction is an operation that maps an instance of a problem to a smaller instance of the same problem. DC is an iterative improvement strategy that relies on contraction as a mechanism for escaping local minima. As a byproduct of contraction, efficiency is improved due to a reduction of problem size. Effectiveness of DC is shown through simple applications to two classical combinatorial problems: The graph bisection problem and the traveling salesman problem. 相似文献
122.
李亚纯 《应用数学与计算数学学报》1994,8(1):47-54
本文采用整体迭代法证明了带小初值的一阶非线性耗散偏微分方程组的Cauchy问题的整体经典解的存在性及指数衰减性质。 相似文献
123.
We consider the least squares approximation of gridded 2D data by tensor product splines with free knots. The smoothing functional to be minimized—a generalization of the univariate Schoenberg functional—is chosen in such a way that the solution of the bivariate problem separates into the solution of a sequence of univariate problems in case of fixed knots. The resulting optimization problem is a constrained separable least squares problem with tensor product structure. Based on some ideas developed by the authors for the univariate case, an efficient method for solving the specially structured 2D problem is proposed, analyzed and tested on hand of some examples from the literature. 相似文献
124.
In this paper, we propose and analyze an SQP-type method for solving linearly constrained convex minimization problems where the objective functions are too complex to be evaluated exactly. Some basic results for global convergence and local superlinear convergence are obtained according to the properties of the approximation sequence. We illustrate the applicability of our approach by proposing a new method for solving two-stage stochastic programs with fixed recourse. 相似文献
125.
This paper presents two differential systems, involving first and second order derivatives of problem functions, respectively, for solving equality-constrained optimization problems. Local minimizers to the optimization problems are proved to be asymptotically stable equilibrium points of the two differential systems. First, the Euler discrete schemes with constant stepsizes for the two differential systems are presented and their convergence theorems are demonstrated. Second, we construct algorithms in which directions are computed by these two systems and the stepsizes are generated by Armijo line search to solve the original equality-constrained optimization problem. The constructed algorithms and the Runge–Kutta method are employed to solve the Euler discrete schemes and the differential equation systems, respectively. We prove that the discrete scheme based on the differential equation system with the second order information has the locally quadratic convergence rate under the local Lipschitz condition. The numerical results given here show that Runge–Kutta method has better stability and higher precision and the numerical method based on the differential equation system with the second information is faster than the other one. 相似文献
126.
Rafael Caballero Mercedes González Flor M Guerrero Julián Molina Concepción Paralera 《European Journal of Operational Research》2007
In this work we present a multiobjective location routing problem and solve it with a multiobjective metaheuristic procedure. In this type of problem, we have to locate some plants within a set of possible locations to meet the demands of a number of clients with multiple objectives. This type of model is used to solve a problem with real data in the region of Andalusia (Spain). Thus, we study the location of two incineration plants for the disposal of solid animal waste from some preestablished locations in Andalusia, and design the routes to serve the different slaughterhouses in this region. This must be done while taking into account certain economic objectives (start-up, maintenance, and transport costs) and social objectives (social rejection by towns on the truck routes, maximum risk as an equity criterion, and the negative implications for towns close to the plant). 相似文献
127.
研究一类食饵具常数存放且功能反应函数为次线性函数的食饵-捕食者模型,获得了一些平衡点全局渐近稳定,极限环存在惟一的充分条件.利用数值仿真检验了我们的结论. 相似文献
128.
§ 1 IntroductionConsiderthefollowingnonlinearoptimizationproblem :minimizef(x)subjecttoC(x) =0 , a≤x≤b ,( 1 .1 )wheref(x) :Rn→R ,C(x) =(c1(x) ,c2 (x) ,...,cm(x) ) T:Rn→Rm aretwicecontinuouslydifferentiable,m≤n ,a ,b∈Rn.Trustregionalgorithmsareveryeffectiveforsolvingnonlinearoptimi… 相似文献
129.
Charles Blair 《Mathematical Programming》1995,71(2):127-136
We identify a class of formulas computable in polynomial time such that the functions defined by these formulas are precisely the value functions of mixed-integer programs with rational constraint coefficients. 相似文献
130.
均值-方差效用函数在证券组合投资决策中的应用 总被引:3,自引:0,他引:3
本文利用均值—方差效用函数,按期望效用最大化准则建立并分析了证券组合投资决策模型。在投资者的效用函数为指数型效用函数时,得到了两基金定理分离权重的计算公式。得出了在均值——方差效用函数条件下期望效用最大化准则与M—V期望收益最大化准则一致的结论。 相似文献