全文获取类型
收费全文 | 7261篇 |
免费 | 694篇 |
国内免费 | 221篇 |
专业分类
化学 | 331篇 |
晶体学 | 2篇 |
力学 | 600篇 |
综合类 | 78篇 |
数学 | 5689篇 |
物理学 | 1476篇 |
出版年
2023年 | 62篇 |
2022年 | 107篇 |
2021年 | 151篇 |
2020年 | 177篇 |
2019年 | 151篇 |
2018年 | 164篇 |
2017年 | 171篇 |
2016年 | 208篇 |
2015年 | 134篇 |
2014年 | 270篇 |
2013年 | 651篇 |
2012年 | 317篇 |
2011年 | 308篇 |
2010年 | 322篇 |
2009年 | 387篇 |
2008年 | 409篇 |
2007年 | 452篇 |
2006年 | 382篇 |
2005年 | 351篇 |
2004年 | 278篇 |
2003年 | 275篇 |
2002年 | 259篇 |
2001年 | 244篇 |
2000年 | 246篇 |
1999年 | 183篇 |
1998年 | 201篇 |
1997年 | 160篇 |
1996年 | 127篇 |
1995年 | 108篇 |
1994年 | 106篇 |
1993年 | 89篇 |
1992年 | 82篇 |
1991年 | 70篇 |
1990年 | 57篇 |
1989年 | 51篇 |
1988年 | 54篇 |
1987年 | 37篇 |
1986年 | 42篇 |
1985年 | 60篇 |
1984年 | 57篇 |
1983年 | 18篇 |
1982年 | 34篇 |
1981年 | 23篇 |
1980年 | 22篇 |
1979年 | 21篇 |
1978年 | 19篇 |
1977年 | 26篇 |
1976年 | 17篇 |
1974年 | 6篇 |
1973年 | 6篇 |
排序方式: 共有8176条查询结果,搜索用时 265 毫秒
21.
We consider the problem of minimizing an SC1 function subject to inequality constraints. We propose a local algorithm whose distinguishing features are that: (a) a fast convergence rate is achieved under reasonable assumptions that do not include strict complementarity at the solution; (b) the solution of only linear systems is required at each iteration; (c) all the points generated are feasible. After analyzing a basic Newton algorithm, we propose some variants aimed at reducing the computational costs and, in particular, we consider a quasi-Newton version of the algorithm. 相似文献
22.
23.
On the Application of the Auxiliary Problem Principle 总被引:6,自引:0,他引:6
The auxiliary problem principle (APP) derives from a general theory on decomposition-coordination methods establishing a comprehensive framework for both one-level and two-level methods. In this paper, the results of the two-level methods of APP are specialized for an efficient application to some engineering problems. 相似文献
24.
M/G/1非空竭服务休假排队系统随机分解的简化算法 总被引:2,自引:0,他引:2
本文根据M/G/1非空竭服务休假排队系统稳态队长随机分解的结构特征提出一种统一算法,该方法简洁高效,避免了再生循环方法繁杂的运算。运用该方法得出的结果与已知的用再生循环方法得出的结论一致。并且修正了Levy(1989)关于Bernoulli闸门服务休假排队系统随机分解的一个错误。 相似文献
25.
26.
27.
We introduce here some Itô calculus for non-continuous Dirichlet processes. Such calculus extends what was known for continuous Dirichlet processes or for semimartingales. In particular we prove that non-continuous Dirichlet processes are stable under C
1 transformation. 相似文献
28.
29.
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. 相似文献
30.
The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large. 相似文献