全文获取类型
收费全文 | 7217篇 |
免费 | 202篇 |
国内免费 | 125篇 |
专业分类
化学 | 169篇 |
晶体学 | 1篇 |
力学 | 211篇 |
综合类 | 66篇 |
数学 | 6921篇 |
物理学 | 176篇 |
出版年
2023年 | 25篇 |
2022年 | 56篇 |
2021年 | 71篇 |
2020年 | 71篇 |
2019年 | 84篇 |
2018年 | 90篇 |
2017年 | 122篇 |
2016年 | 113篇 |
2015年 | 95篇 |
2014年 | 297篇 |
2013年 | 321篇 |
2012年 | 394篇 |
2011年 | 284篇 |
2010年 | 298篇 |
2009年 | 442篇 |
2008年 | 458篇 |
2007年 | 495篇 |
2006年 | 317篇 |
2005年 | 292篇 |
2004年 | 221篇 |
2003年 | 216篇 |
2002年 | 223篇 |
2001年 | 196篇 |
2000年 | 215篇 |
1999年 | 173篇 |
1998年 | 147篇 |
1997年 | 139篇 |
1996年 | 173篇 |
1995年 | 163篇 |
1994年 | 114篇 |
1993年 | 125篇 |
1992年 | 124篇 |
1991年 | 115篇 |
1990年 | 93篇 |
1989年 | 64篇 |
1988年 | 84篇 |
1987年 | 53篇 |
1986年 | 79篇 |
1985年 | 107篇 |
1984年 | 75篇 |
1983年 | 21篇 |
1982年 | 46篇 |
1981年 | 37篇 |
1980年 | 33篇 |
1979年 | 26篇 |
1978年 | 47篇 |
1977年 | 46篇 |
1976年 | 26篇 |
1975年 | 12篇 |
1974年 | 12篇 |
排序方式: 共有7544条查询结果,搜索用时 15 毫秒
981.
In a decision process (gambling or dynamic programming problem) with finite state space and arbitrary decision sets (gambles or actions), there is always available a Markov strategy which uniformly (nearly) maximizes the average time spent at a goal. If the decision sets are closed, there is even a stationary strategy with the same property.Examples are given to show that approximations by discounted or finite horizon payoffs are not useful for the general average reward problem. 相似文献
982.
L. Grandinetti 《Journal of Optimization Theory and Applications》1984,43(1):1-21
An appealing approach to the solution of nonlinear optimization problems based on conic models of the objective function has been recently introduced by Davidon. It leads to a broad class of algorithms which, in some sense, can be considered to generalize the existing quasi-Newton algorithms. One particular member of this class has been deeply examined by Sorensen, who has proved some interesting theoretical properties. A new interpretation of this algorithm is suggested in this paper from a more straightforward and somewhat familiar point of view. In addition, numerical experiments have been carried out to compare the Sorensen algorithm with a straightforward BFGS implementation of the classical quasi-Newton method with the final aim to assess the real merits and benefits of the new algorithm. Although some challenging test functions are used in computational experiments, the results are not particularly favorable to the new algorithm. As a matter of fact they do not exhibit any jump of quality, as it might be expected. Lastly, it is pointed out that a difficulty may affect the new method in situations in which it is necessary to exploit the special structure of large-scale problems.This work was supported by the National Research Council of Italy under Grant No. 80-01144. 相似文献
983.
Andrzej Ruszczyński 《Mathematical Programming》1997,79(1-3):333-353
Stochastic programming problems have very large dimension and characteristic structures which are tractable by decomposition.
We review basic ideas of cutting plane methods, augmented Lagrangian and splitting methods, and stochastic decomposition methods
for convex polyhedral multi-stage stochastic programming problems. 相似文献
984.
M. Sun 《Applied Mathematics and Optimization》1996,34(3):267-277
We focus on numerically solving a typical type of Hamilton-Jacobi-Bellman (HJB) equations arising from a class of optimal controls with a standard multidimensional diffusion model. Solving such an equation results in the value function and an optimal feedback control law. The Bellman's curse of dimensionality seems to be the main obstacle to applicability of most numerical algorithms for solving HJB. We decompose HJB into a number of lower-dimensional problems, and discuss how the usual alternating direction method can be extended for solving HJB. We present some convergence results, as well as preliminary experimental outcomes.This research was funded in part by an RGC grant from the University of Alabama. 相似文献
985.
BARON: A general purpose global optimization software package 总被引:1,自引:0,他引:1
Nikolaos V. Sahinidis 《Journal of Global Optimization》1996,8(2):201-205
986.
Herbert E. Scarf 《Mathematical Programming》1997,79(1-3):355-368
In this paper I discuss various properties of the simplicial complex of maximal lattice free bodies associated with a matrixA. If the matrix satisfies some mild conditions, and isgeneric, the edges of the complex form the minimal test set for the family of integer programs obtained by selecting a particular
row ofA as the objective function, and using the remaining rows to impose constraints on the integer variables. 相似文献
987.
一类基于广义梯度的求解非线性互补问题的算法 总被引:1,自引:0,他引:1
1 引言非线性互补问题(下称NCP)的应用十分广泛,自本世纪六十年代以来,人们对这一问题解的存在唯一性、灵敏度分析、算法与应用等方面进行深入的研究,取得很大的进展。关于NCP的解法通常是将其化为序列线性互补问题,而对线性问题则有若干现成算法,如Lemke算法。但一般说来,此类方法工作量大,效果也难以令人满意。J.S.Pang于七十年代提出了B-可微算法,即将NCP转化为一个B-可微函数的零点问题。近年来提出的一些算法大多属于此类方法。 本文提出的算法也属于B-可微算法,虽同是从广义梯度出发,但不同的是,我们不是通过二次规划而是通过线性规划来获得搜寻方向。由于所涉及的线性规划问题特别的简单,我们可以很快而方便地求得其解,所以算法简易可行,速度较快。 相似文献
988.
Multilevel programming is characterized as mathematical programming to solve decentralized planning problems. The models partition control over decision variables among ordered levels within a hierarchical planning structure of which the linear bilevel form is a special case of a multilevel programming problem. In a system with such a hierarchical structure, the high-level decision making situations generally require inclusion of zero-one variables representing ‘yes-no’ decisions. We provide a mixed-integer linear bilevel programming formulation in which zero-one decision variables are controlled by a high-level decision maker and real-value decision variables are controlled by a low-level decision maker. An algorithm based on the short term memory component of Tabu Search, called Simple Tabu Search, is developed to solve the problem, and two supplementary procedures are proposed that provide variations of the algorithm. Computational results disclose that our approach is effective in terms of both solution quality and efficiency. 相似文献
989.
For the general quadratic programming problem (including an equivalent form of the linear complementarity problem) a new solution method of branch and bound type is proposed. The branching procedure uses a well-known simplicial subdivision and the bound estimation is performed by solving certain linear programs. 相似文献
990.
N. L. Boland 《Mathematical Programming》1996,78(1):1-27
Because of the many important applications of quadratic programming, fast and efficient methods for solving quadratic programming
problems are valued. Goldfarb and Idnani (1983) describe one such method. Well known to be efficient and numerically stable,
the Goldfarb and Idnani method suffers only from the restriction that in its original form it cannot be applied to problems
which are positive semi-definite rather than positive definite. In this paper, we present a generalization of the Goldfarb
and Idnani method to the positive semi-definite case and prove finite termination of the generalized algorithm. In our generalization,
we preserve the spirit of the Goldfarb and Idnani method, and extend their numerically stable implementation in a natural
way.
Supported in part by ATERB, NSERC and the ARC.
Much of this work was done in the Department of Mathematics at the University of Western Australia and in the Department of
Combinatorics and Optimization at the University of Waterloo. 相似文献