全文获取类型
收费全文 | 1933篇 |
免费 | 138篇 |
国内免费 | 67篇 |
专业分类
化学 | 259篇 |
晶体学 | 2篇 |
力学 | 53篇 |
综合类 | 44篇 |
数学 | 1544篇 |
物理学 | 236篇 |
出版年
2023年 | 8篇 |
2022年 | 32篇 |
2021年 | 52篇 |
2020年 | 33篇 |
2019年 | 27篇 |
2018年 | 38篇 |
2017年 | 41篇 |
2016年 | 60篇 |
2015年 | 43篇 |
2014年 | 85篇 |
2013年 | 116篇 |
2012年 | 96篇 |
2011年 | 104篇 |
2010年 | 96篇 |
2009年 | 126篇 |
2008年 | 165篇 |
2007年 | 149篇 |
2006年 | 92篇 |
2005年 | 96篇 |
2004年 | 88篇 |
2003年 | 63篇 |
2002年 | 67篇 |
2001年 | 59篇 |
2000年 | 71篇 |
1999年 | 56篇 |
1998年 | 45篇 |
1997年 | 38篇 |
1996年 | 37篇 |
1995年 | 25篇 |
1994年 | 16篇 |
1993年 | 20篇 |
1992年 | 14篇 |
1991年 | 7篇 |
1990年 | 5篇 |
1989年 | 5篇 |
1988年 | 9篇 |
1987年 | 4篇 |
1986年 | 5篇 |
1985年 | 10篇 |
1984年 | 6篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 4篇 |
1979年 | 3篇 |
1978年 | 1篇 |
1977年 | 7篇 |
1976年 | 3篇 |
1975年 | 1篇 |
1973年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有2138条查询结果,搜索用时 250 毫秒
21.
本文提出一个新的非线性最小二乘的信赖域方法,在该方法中每个信赖域子问题只需要一次求解,而且每次迭代的一维搜索步长因子是给定的,避开一维搜索的环节,大大地提高了算法效率.文中证明了在一定的条件下算法的全局收敛性. 相似文献
22.
We introduce some relative versions of star selection principles first considered in [5], [11]. Some of the work extends results
from [4], [5] and gives some examples.
相似文献
23.
The feature selection consists of obtaining a subset of these features to optimally realize the task without the irrelevant
ones. Since it can provide faster and cost-effective learning machines and also improve the prediction performance of the
predictors, it is a crucial step in machine learning. The feature selection methods using support machines have obtained satisfactory
results, but the noises and outliers often reduce the performance. In this paper, we propose a feature selection approach
using fuzzy support vector machines and compare it with the previous work, the results of experiments on the UCI data sets
show that feature selection using fuzzy SVM obtains better results than using SVM. 相似文献
24.
Pure adaptive search constructs a sequence of points uniformly distributed within a corresponding sequence of nested regions of the feasible space. At any stage, the next point in the sequence is chosen uniformly distributed over the region of feasible space containing all points that are equal or superior in value to the previous points in the sequence. We show that for convex programs the number of iterations required to achieve a given accuracy of solution increases at most linearly in the dimension of the problem. This compares to exponential growth in iterations required for pure random search. 相似文献
25.
Analysis of Static Simulated Annealing Algorithms 总被引:1,自引:0,他引:1
Generalized hill climbing (GHC) algorithms provide a framework for modeling local search algorithms to address intractable discrete optimization problems. This paper introduces a measure for determining the expected number of iterations to visit a predetermined objective function level, given that an inferior objective function level has been reached in a finite number of iterations. A variation of simulated annealing (SA), termed static simulated annealing (S2A), is analyzed using this measure. S2A uses a fixed cooling schedule during the algorithm execution. Though S2A is probably nonconvergent, its finite-time performance can be assessed using the finite-time performance measure defined in this paper. 相似文献
26.
27.
First, this paper deals with lagrangean heuristics for the 0-1 bidimensional knapsack problem. A projected subgradient algorithm is performed for solving a lagrangean dual of the problem, to improve the convergence of the classical subgradient algorithm. Secondly, a local search is introduced to improve the lower bound on the value of the biknapsack produced by lagrangean heuristics. Thirdly, a variable fixing phase is embedded in the process. Finally, the sequence of 0-1 one-dimensional knapsack instances obtained from the algorithm are solved by using reoptimization techniques in order to reduce the total computational time effort. Computational results are presented. 相似文献
28.
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. 相似文献
29.
30.
时贞军 《数学物理学报(A辑)》2004,4(6):675-682
该文提出一种无约束优化非线性共轭梯度法,证明了精确线性 搜索下的全局收敛性。当目标函数为一致凸函数时,证明了算法具有线性收敛速度。数值实验表明算法对于求解实际问题是有效的。 相似文献