全文获取类型
收费全文 | 14285篇 |
免费 | 879篇 |
国内免费 | 475篇 |
专业分类
化学 | 2066篇 |
晶体学 | 33篇 |
力学 | 1363篇 |
综合类 | 157篇 |
数学 | 9764篇 |
物理学 | 2256篇 |
出版年
2024年 | 23篇 |
2023年 | 158篇 |
2022年 | 398篇 |
2021年 | 406篇 |
2020年 | 274篇 |
2019年 | 311篇 |
2018年 | 312篇 |
2017年 | 413篇 |
2016年 | 388篇 |
2015年 | 312篇 |
2014年 | 617篇 |
2013年 | 911篇 |
2012年 | 840篇 |
2011年 | 720篇 |
2010年 | 673篇 |
2009年 | 876篇 |
2008年 | 885篇 |
2007年 | 918篇 |
2006年 | 703篇 |
2005年 | 586篇 |
2004年 | 497篇 |
2003年 | 446篇 |
2002年 | 416篇 |
2001年 | 349篇 |
2000年 | 340篇 |
1999年 | 260篇 |
1998年 | 295篇 |
1997年 | 268篇 |
1996年 | 235篇 |
1995年 | 227篇 |
1994年 | 218篇 |
1993年 | 176篇 |
1992年 | 163篇 |
1991年 | 117篇 |
1990年 | 112篇 |
1989年 | 86篇 |
1988年 | 67篇 |
1987年 | 58篇 |
1986年 | 67篇 |
1985年 | 85篇 |
1984年 | 80篇 |
1983年 | 25篇 |
1982年 | 64篇 |
1981年 | 41篇 |
1980年 | 38篇 |
1979年 | 56篇 |
1978年 | 36篇 |
1977年 | 40篇 |
1976年 | 26篇 |
1957年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
2.
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. 相似文献
3.
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. 相似文献
4.
We consider the problem of maximizing a linear fractional function on the Pareto efficient frontier of two other linear fractional functions. We present a finite pivoting-type algorithm that solves the maximization problem while computing simultaneously the efficient frontier. Application to multistage efficiency analysis is discussed. An example demonstrating the computational procedure is included. 相似文献
5.
We describe a new algorithm which uses the trajectories of a discrete dynamical system to sample the domain of an unconstrained objective function in search of global minima. The algorithm is unusually adept at avoiding nonoptimal local minima and successfully converging to a global minimum. Trajectories generated by the algorithm for objective functions with many local minima exhibit chaotic behavior, in the sense that they are extremely sensitive to changes in initial conditions and system parameters. In this context, chaos seems to have a beneficial effect: failure to converge to a global minimum from a given initial point can often be rectified by making arbitrarily small changes in the system parameters. 相似文献
6.
具有模糊数的模糊多目标群体决策优选模型与方法 总被引:5,自引:0,他引:5
多目标群体决策问题是运筹学的一个重要研究领域,目前已经提出了一些有效的决策方法。但对目标值和权重均为模糊数的模糊多目标群体决策问题却研究不多,本对此类模糊多目标群体决策问题进行了探讨,利用相对正理想方案与相对负理想方案概念定义了相对差异距离,进而建立了模糊多目标群体决策优选模型与方法,并通过战役决心方案的评价说明了该方法是可行、有效的,可作为军事决策与决策支持系统的备选方法。 相似文献
7.
ON HYPERBOLIC TIME DISCOUNTING IN EXHAUSTIBLE RESOURCE MODELS: AN APPLICATION TO WORLD OIL RESOURCES
JOHN ROWSE 《Natural Resource Modeling》2006,19(2):243-277
ABSTRACT. Recent research on discounting in long term economic models involves hyperbolic discounting, in which the marginal discount rate shrinks as time passes. To investigate hyperbolic discounting and exhaustible resource allocation, this work develops a discrete‐time world oil model and model solution procedure, then uses the model to examine the consequences of adopting conventional (constant annual) discounting when hyperbolic discounting is appropriate, of adopting one hyperbolic discount rate path when a different hyperbolic path is appropriate, and of adopting hyperbolic discounting when conventional discounting is appropriate. Five conventional and two hyperbolic discount rate paths are considered. One hyperbolic path is that used by Nordhaus and Boyer [2000]; the other is that recommended by Weitzman [2001]. The generality of the findings is also assessed. 相似文献
8.
讨论了求解无约束线性最小二乘问题的一种并行单纯形法以及对它的改进算法并行共轭梯度—单纯形法 .算法本身具有很强的并行机制 ,能够充分地发挥并行机快速省时的特点 .本文也对算法做了理论分析 ,对算法的收敛性给予了证明 (在二维情形下 ) .最后做了数值实验 (由于软硬件条件的限制 ,并行算法未能在并行计算机上实现 ,鉴于这种情况 ,我们所做的数值实验均是在串行机上完成的 ) 相似文献
9.
10.
The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study 总被引:1,自引:0,他引:1
Bram Verweij Shabbir Ahmed Anton J. Kleywegt George Nemhauser Alexander Shapiro 《Computational Optimization and Applications》2003,24(2-3):289-333
The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 21694 scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time. 相似文献