全文获取类型
收费全文 | 9300篇 |
免费 | 565篇 |
国内免费 | 205篇 |
专业分类
化学 | 273篇 |
晶体学 | 4篇 |
力学 | 380篇 |
综合类 | 178篇 |
数学 | 8714篇 |
物理学 | 521篇 |
出版年
2023年 | 36篇 |
2022年 | 96篇 |
2021年 | 175篇 |
2020年 | 113篇 |
2019年 | 122篇 |
2018年 | 120篇 |
2017年 | 212篇 |
2016年 | 239篇 |
2015年 | 173篇 |
2014年 | 464篇 |
2013年 | 449篇 |
2012年 | 523篇 |
2011年 | 411篇 |
2010年 | 412篇 |
2009年 | 580篇 |
2008年 | 572篇 |
2007年 | 614篇 |
2006年 | 437篇 |
2005年 | 410篇 |
2004年 | 316篇 |
2003年 | 312篇 |
2002年 | 298篇 |
2001年 | 240篇 |
2000年 | 263篇 |
1999年 | 203篇 |
1998年 | 198篇 |
1997年 | 167篇 |
1996年 | 205篇 |
1995年 | 190篇 |
1994年 | 130篇 |
1993年 | 139篇 |
1992年 | 149篇 |
1991年 | 127篇 |
1990年 | 99篇 |
1989年 | 77篇 |
1988年 | 93篇 |
1987年 | 54篇 |
1986年 | 83篇 |
1985年 | 129篇 |
1984年 | 86篇 |
1983年 | 31篇 |
1982年 | 53篇 |
1981年 | 43篇 |
1980年 | 38篇 |
1979年 | 28篇 |
1978年 | 48篇 |
1977年 | 46篇 |
1976年 | 26篇 |
1975年 | 12篇 |
1974年 | 12篇 |
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
91.
根据作者最近提出的求解线性规划问题的鞍点法[3],本文对带框形约束的问题 min c~Tx, s,t A_x=b, l≤x≤h,给出简单的迭代公式.该法的主要优点是它的强收敛性和它的迭代公式非常容易实现. 相似文献
92.
93.
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 相似文献
94.
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]. 相似文献
95.
Gisella Facchinetti 《Fuzzy Optimization and Decision Making》2002,1(3):313-327
In this paper we present two definitions of possibilistic weighted average of fuzzy numbers, and by them we introduce two different rankings on the set of real fuzzy numbers. The two methods are dependent on several parameters. In the first case, the parameter is constant and the results generalize what Carlsson and Fuller have obtained in (2001). In the second case, the parameter is a function, not fixed a priori by the decision maker, but it depends on the position of the interval on the real axe. In all the two cases we call the parameter degree of risk, which takes into account of a risk-tendency or aversion of the decision maker. 相似文献
96.
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. 相似文献
97.
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. 相似文献
98.
C. D. Bisbos 《Optimization Letters》2007,1(1):101-109
Limit and shakedown analysis problems of Computational Mechanics lead to convex optimization problems, characterized by linear objective functions, linear equality constraints and constraints expressing the restrictions imposed by the material strength. It is shown that two important strength criteria, the Mohr–Coulomb and the Tresca criterion, can be represented as systems of semidefinite constraints, leading this way to semidefinite programming problems. 相似文献
99.
In this paper, we propose and analyze an SQP-type method for solving linearly constrained convex minimization problems where the objective functions are too complex to be evaluated exactly. Some basic results for global convergence and local superlinear convergence are obtained according to the properties of the approximation sequence. We illustrate the applicability of our approach by proposing a new method for solving two-stage stochastic programs with fixed recourse. 相似文献
100.
Optimization theory provides a framework for determining the best decisions or actions with respect to some mathematical model of a process. This paper focuses on learning to act in a near-optimal manner through reinforcement learning for problems that either have no model or the model is too complex. One approach to solving this class of problems is via approximate dynamic programming. The application of these methods are established primarily for the case of discrete state and action spaces. In this paper we develop efficient methods of learning which act in complex systems with continuous state and action spaces. Monte-Carlo approaches are employed to estimate function values in an iterative, incremental procedure. Derivative-free line search methods are used to obtain a near-optimal action in the continuous action space for a discrete subset of the state space. This near-optimal control policy is then extended to the entire continuous state space via a fuzzy additive model. To compensate for approximation errors, a modified procedure for perturbing the generated control policy is developed. Convergence results under moderate assumptions and stopping criteria are established. 相似文献