全文获取类型
收费全文 | 9580篇 |
免费 | 717篇 |
国内免费 | 262篇 |
专业分类
化学 | 1260篇 |
晶体学 | 28篇 |
力学 | 1062篇 |
综合类 | 146篇 |
数学 | 6690篇 |
物理学 | 1373篇 |
出版年
2024年 | 14篇 |
2023年 | 97篇 |
2022年 | 203篇 |
2021年 | 329篇 |
2020年 | 195篇 |
2019年 | 212篇 |
2018年 | 233篇 |
2017年 | 321篇 |
2016年 | 302篇 |
2015年 | 220篇 |
2014年 | 448篇 |
2013年 | 544篇 |
2012年 | 604篇 |
2011年 | 467篇 |
2010年 | 436篇 |
2009年 | 548篇 |
2008年 | 544篇 |
2007年 | 598篇 |
2006年 | 484篇 |
2005年 | 421篇 |
2004年 | 330篇 |
2003年 | 312篇 |
2002年 | 288篇 |
2001年 | 261篇 |
2000年 | 258篇 |
1999年 | 194篇 |
1998年 | 211篇 |
1997年 | 192篇 |
1996年 | 135篇 |
1995年 | 160篇 |
1994年 | 132篇 |
1993年 | 112篇 |
1992年 | 100篇 |
1991年 | 85篇 |
1990年 | 78篇 |
1989年 | 61篇 |
1988年 | 52篇 |
1987年 | 40篇 |
1986年 | 39篇 |
1985年 | 54篇 |
1984年 | 51篇 |
1983年 | 14篇 |
1982年 | 23篇 |
1981年 | 20篇 |
1980年 | 17篇 |
1979年 | 31篇 |
1978年 | 20篇 |
1977年 | 30篇 |
1976年 | 19篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
131.
Pure adaptive search in global optimization 总被引:10,自引:0,他引:10
Pure adaptive seach iteratively constructs a sequence of interior points uniformly distributed within the corresponding sequence of nested improving regions of the feasible space. That is, at any iteration, the next point in the sequence is uniformly distributed over the region of feasible space containing all points that are strictly superior in value to the previous points in the sequence. The complexity of this algorithm is measured by the expected number of iterations required to achieve a given accuracy of solution. We show that for global mathematical programs satisfying the Lipschitz condition, its complexity increases at mostlinearly in the dimension of the problem.This work was supported in part by NATO grant 0119/89. 相似文献
132.
本文利用不连续罚函数方法将带有不等式约束的全局优化问题的求解转化为 讨论一非线性方程的求根问题,从而得到若干个全局最优性条件. 相似文献
133.
Fabio Schoen 《Journal of Global Optimization》1994,4(1):17-35
In this paper a new algorithm is proposed for global optimization problems. The main idea is that of modifying a standard clustering approach by sequentially sampling the objective function while adaptively deciding an appropriate sample size. Theoretical as well as computational results are presented. 相似文献
134.
We study the effect of arrival model uncertainties on the optimal routing in a system of parallel queues. For exponential service time distributions and Bernoulli routing, the optimal mean system delay generally depends on the interarrival time distribution. Any error in modeling the arriving process will cause a model-based optimal routing algorithm to produce a mean system delay higher than the true optimum. In this paper, we present an asymptotic analysis of the behavior of this error under heavy traffic conditions for a general renewal arrival process. An asymptotic analysis of the error in optimal mean delay due to uncertainties in the service time distribution for Poisson arrivals was reported in Ref. 6, where it was shown that, when the first moment of the service time distribution is known, this error in performance vanishes asymptotically as the traffic load approaches the system capacity. In contrast, this paper establishes the somewhat surprising result that, when only the first moment of the arrival distribution is known, the error in optimal mean delay due to uncertainties in the arrival model is unbounded as the traffic approaches the system capacity. However, when both first and second moments are known, the error vanishes asymptotically. Numerical examples corroborating the theoretical results are also presented.This work was supported by the National Science Foundation under Grants ECS-88-01912 and EID-92-12122 and by NASA under Contract NAG 2-595.The authors wish to thank an anonymous referee for pointing out Ref. 20, thus avoiding the need for an explicit proof of convexity of the cost function considered in the paper. 相似文献
135.
The paper deals with the global minimization of a differentiable cost function mapping a ball of a finite dimensional Euclidean space into an interval of real numbers. It is established that a suitable random perturbation of the gradient method with a fixed parameter generates a bounded minimizing sequence and leads to a global minimum: the perturbation avoids convergence to local minima. The stated results suggest an algorithm for the numerical approximation of global minima: experiments are performed for the problem of fitting a sum of exponentials to discrete data and to a nonlinear system involving about 5000 variables. The effect of the random perturbation is examined by comparison with the purely deterministic gradient method. 相似文献
136.
A filled function with adjustable parameters is suggested in this paper for finding a global minimum point of a general class of nonlinear programming problems with a bounded and closed domain. This function has two adjustable parameters. We will discuss the properties of the proposed filled function. Conditions on this function and on the values of parameters are given so that the constructed function has the desired properties of traditional filled function. 相似文献
137.
时贞军 《数学物理学报(A辑)》2004,4(6):675-682
该文提出一种无约束优化非线性共轭梯度法,证明了精确线性 搜索下的全局收敛性。当目标函数为一致凸函数时,证明了算法具有线性收敛速度。数值实验表明算法对于求解实际问题是有效的。 相似文献
138.
139.
本文我们利用一个可微函数给出了一对高阶对称规划问题 ,其中目标函数包含了Rn 中一紧凸集的支撑函数 .在引入高阶F 凸性 (F 伪凸性 ,F 拟凸性 )后 ,证明了高阶弱、高阶强及高阶逆对称对偶性质 . 相似文献
140.
利用集值映射切导数与半可微概念,给出了无约束与具约束的集值向量优化问题局部真有效解与局部强有效解的最优性条件。 相似文献