全文获取类型
收费全文 | 9387篇 |
免费 | 329篇 |
国内免费 | 355篇 |
专业分类
化学 | 185篇 |
晶体学 | 1篇 |
力学 | 285篇 |
综合类 | 106篇 |
数学 | 9233篇 |
物理学 | 261篇 |
出版年
2023年 | 37篇 |
2022年 | 63篇 |
2021年 | 97篇 |
2020年 | 97篇 |
2019年 | 128篇 |
2018年 | 130篇 |
2017年 | 179篇 |
2016年 | 180篇 |
2015年 | 147篇 |
2014年 | 384篇 |
2013年 | 437篇 |
2012年 | 501篇 |
2011年 | 367篇 |
2010年 | 373篇 |
2009年 | 557篇 |
2008年 | 578篇 |
2007年 | 648篇 |
2006年 | 459篇 |
2005年 | 411篇 |
2004年 | 333篇 |
2003年 | 317篇 |
2002年 | 323篇 |
2001年 | 282篇 |
2000年 | 334篇 |
1999年 | 250篇 |
1998年 | 242篇 |
1997年 | 231篇 |
1996年 | 216篇 |
1995年 | 197篇 |
1994年 | 147篇 |
1993年 | 156篇 |
1992年 | 141篇 |
1991年 | 134篇 |
1990年 | 107篇 |
1989年 | 70篇 |
1988年 | 93篇 |
1987年 | 60篇 |
1986年 | 83篇 |
1985年 | 116篇 |
1984年 | 86篇 |
1983年 | 25篇 |
1982年 | 55篇 |
1981年 | 47篇 |
1980年 | 41篇 |
1979年 | 34篇 |
1978年 | 51篇 |
1977年 | 55篇 |
1976年 | 28篇 |
1975年 | 13篇 |
1974年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 234 毫秒
101.
In this paper, we provide bounds for the expected value of the log of the condition number C(A) of a linear feasibility problem given by a n × m matrix A (Ref. 1). We show that this expected value is O(min{n, m log n}) if n > m and is O(log n) otherwise. A similar bound applies for the log of the condition number C
R(A) introduced by Renegar (Ref. 2). 相似文献
102.
A parallel inexact Newton method with a line search is proposed for two-stage quadratic stochastic programs with recourse. A lattice rule is used for the numerical evaluation of multi-dimensional integrals, and a parallel iterative method is used to solve the quadratic programming subproblems. Although the objective only has a locally Lipschitz gradient, global convergence and local superlinear convergence of the method are established. Furthermore, the method provides an error estimate which does not require much extra computation. The performance of the method is illustrated on a CM5 parallel computer.This work was supported by the Australian Research Council and the numerical experiments were done on the Sydney Regional Centre for Parallel Computing CM5. 相似文献
103.
根据作者最近提出的求解线性规划问题的鞍点法[3],本文对带框形约束的问题 min c~Tx, s,t A_x=b, l≤x≤h,给出简单的迭代公式.该法的主要优点是它的强收敛性和它的迭代公式非常容易实现. 相似文献
104.
105.
The many facets of linear programming 总被引:1,自引:0,他引:1
Michael J. Todd 《Mathematical Programming》2002,91(3):417-436
We examine the history of linear programming from computational, geometric, and complexity points of view, looking at simplex,
ellipsoid, interior-point, and other methods.
Received: June 22, 2000 / Accepted: April 4, 2001?Published online October 2, 2001 相似文献
106.
Jesús M. Velásquez Bermúdez 《Annals of Operations Research》2002,117(1-4):21-31
This document presents theoretical considerations about the solution of dynamic optimization problems integrating the Benders Theory, the Dynamic Programming approach and the concepts of Control Theory. The so called Generalized Dual Dynamic Programming Theory (GDDP) can be considered as an extension of two previous approaches known as Dual Dynamic Programming (DDP): The first is the work developed by Pereira and Pinto [3–5], which was revised by Velásquez and others [8,9]. The second is the work developed by Read and others [2,6,7]. 相似文献
107.
THENBELCANDNWELCCLASSESOFLIFEDISTRIBUTIONS¥CAOJINHUA;WANGYUEDONG(InstituteofAppliedMathematics,ChineseAcademyofScience,Beijin... 相似文献
108.
F. Blanchini 《Journal of Optimization Theory and Applications》1991,71(3):465-484
The linear state feedback synthesis problem for uncertain linear systems with state and control constraints is considered. We assume that the uncertainties are present in both the state and input matrices and they are bounded. The main goal is to find a linear control law assuring that both state and input constraints are fulfilled at each time. The problem is solved by confining the state within a compact and convex positively invariant set contained in the allowable state region.It is shown that, if the controls, the state, and the uncertainties are subject to linear inequality constraints and if a candidate compact and convex polyhedral set is assigned, a feedback matrix assuring that this region is positively invariant for the closed-loop system is found as a solution of a set of linear inequalities for both continuous and discrete time design problems.These results are extended to the case in which additive disturbances are present. The relationship between positive invariance and system stability is investigated and conditions for the existence of positively invariant regions of the polyhedral type are given.The author is grateful to Drs. Vito Cerone and Roberto Tempo for their comments. 相似文献
109.
A BRANCH BOUND METHOD FOR SUBSET SUM PROBLEM 总被引:1,自引:0,他引:1
吴士泉 《应用数学学报(英文版)》1994,10(3):302-314
ABRANCHBOUNDMETHODFORSUBSETSUMPROBLEMWUSHIQUAN(吴士泉)(InstituteofAppliedMathematics,theChineseAcademyofSciences,Beijing100080,C... 相似文献
110.
Multi-objective optimization using evolutionary algorithms identifies Pareto-optimal alternatives or their close approximation by means of a sequence of successive local improvement moves. While several successful applications to combinatorial optimization problems are known, studies of underlying problem structures are still scarce. 相似文献