全文获取类型
收费全文 | 7998篇 |
免费 | 240篇 |
国内免费 | 174篇 |
专业分类
化学 | 189篇 |
晶体学 | 1篇 |
力学 | 303篇 |
综合类 | 80篇 |
数学 | 7468篇 |
物理学 | 371篇 |
出版年
2023年 | 28篇 |
2022年 | 74篇 |
2021年 | 85篇 |
2020年 | 84篇 |
2019年 | 97篇 |
2018年 | 104篇 |
2017年 | 148篇 |
2016年 | 150篇 |
2015年 | 112篇 |
2014年 | 337篇 |
2013年 | 363篇 |
2012年 | 440篇 |
2011年 | 331篇 |
2010年 | 342篇 |
2009年 | 491篇 |
2008年 | 530篇 |
2007年 | 546篇 |
2006年 | 355篇 |
2005年 | 330篇 |
2004年 | 249篇 |
2003年 | 242篇 |
2002年 | 246篇 |
2001年 | 212篇 |
2000年 | 235篇 |
1999年 | 194篇 |
1998年 | 172篇 |
1997年 | 156篇 |
1996年 | 180篇 |
1995年 | 175篇 |
1994年 | 120篇 |
1993年 | 127篇 |
1992年 | 127篇 |
1991年 | 115篇 |
1990年 | 97篇 |
1989年 | 69篇 |
1988年 | 85篇 |
1987年 | 53篇 |
1986年 | 83篇 |
1985年 | 115篇 |
1984年 | 76篇 |
1983年 | 26篇 |
1982年 | 47篇 |
1981年 | 40篇 |
1980年 | 34篇 |
1979年 | 29篇 |
1978年 | 48篇 |
1977年 | 47篇 |
1976年 | 27篇 |
1975年 | 12篇 |
1974年 | 12篇 |
排序方式: 共有8412条查询结果,搜索用时 15 毫秒
991.
Y. Rubinstein 《Journal of Optimization Theory and Applications》1976,18(3):309-317
The problem of searching the extremum of a scalar function of a vector argument is considered. It is assumed that a finite set of algorithms, each of which is capable of finding the extremum, is specified. Every algorithm is characterized by a given number of operators each of which is identified with the state of the system. Each algorithm is defined by a transition probability matrix over the possible states (operators) and a corresponding matrix of the respective changes in the value of the function toward the extremal point.A procedure is given for selecting an optimal sequence of algorithms which maximizes the total expected change in the value of the function toward the optimum. 相似文献
992.
New least-square algorithms 总被引:1,自引:0,他引:1
W. C. Davidon 《Journal of Optimization Theory and Applications》1976,18(2):187-197
New algorithms are presented for approximating the minimum of the sum of squares ofM real and differentiable functions over anN-dimensional space. These algorithms update estimates for the location of a minimum after each one of the functions and its first derivatives are evaluated, in contrast with other least-square algorithms which evaluate allM functions and their derivatives at one point before using any of this information to make an update. These new algorithms give estimates which fluctuate about a minimum rather than converging to it. For many least-square problems, they give an adequate approximation for the solution more quickly than do other algorithms.It is a pleasure to thank J. Chesick of Haverford College for suggesting and implementing the application of this algorithm to x-ray crystallography. 相似文献
993.
Guillermo A. Mendoza 《Natural Resource Modeling》1988,2(4):653-667
This paper describes a nonlinear programming model combined with a binary search technique that systematically searches for the minimum value of a given objective within the nondominated solution set. The procedure provides a way of determining the range of efficient target levels for any multiobjective planning problem using information contained in the pay-off table. The method is illustrated using a numerical example. 相似文献
994.
M. Schechter 《Journal of Optimization Theory and Applications》1977,23(3):389-400
A symmetric duality theory for programming problems with homogeneous objective functions was published in 1961 by Eisenberg and has been used by a number of authors since in establishing duality theorems for specific problems. In this paper, we study a generalization of Eisenberg's problem from the viewpoint of Rockafellar's very general perturbation theory of duality. The extension of Eisenberg's sufficient conditions appears as a special case of a much more general criterion for the existence of optimal vectors and lack of a duality gap. We give examples where Eisenberg's sufficient condition is not satisfied, yet optimal vectors exist, and primal and dual problems have the same value. 相似文献
995.
New results on a class of exact augmented Lagrangians 总被引:3,自引:0,他引:3
S. Lucidi 《Journal of Optimization Theory and Applications》1988,58(2):259-282
In this paper, a new continuously differentiable exact augmented Lagrangian is introduced for the solution of nonlinear programming problems with compact feasible set. The distinguishing features of this augmented Lagrangian are that it is radially unbounded with respect to the multiplier and that it goes to infinity on the boundary of a compact set containing the feasible region. This allows one to establish a complete equivalence between the unconstrained minimization of the augmented Lagrangian on the product space of problem variables and multipliers and the solution of the constrained problem.The author wishes to thank Dr. L. Grippo for having suggested the topic of this paper and for helpful discussions. 相似文献
996.
W. Stadje 《Mathematical Methods of Operations Research》1992,36(5):447-457
An item having a known initial failure probability is to be controlled by some out of a finite set of possible checks. Every check costs a certain amount of money, and budget constraints must be met. A check is characterized by the probabilities of three events: (i) letting a workable item pass, (ii) overlooking a failure if one is present, (iii) introducing a failure into a workable item. We show how any subset of checks to be employed is ordered optimally, and how the optimal subsequence of checks depends on the initial failure probability and oil the budget constraint. 相似文献
997.
We propose a new algorithm for dynamic lot size models (LSM) in which production and inventory cost functions are only assumed to be piecewise linear. In particular, there are no assumptions of convexity, concavity or monotonicity. Arbitrary capacities on both production and inventory may occur, and backlogging is allowed. Thus the algorithm addresses most variants of the LSM appearing in the literature. Computational experience shows it to be very effective on NP-hard versions of the problem. For example, 48 period capacitated problems with production costs defined by eight linear segments are solvable in less than 2.5 minutes of Vax 8600 cpu time. 相似文献
998.
Each year, the US Air Force Academy graduates nearly 1000 young men and women. To support the decision of which cadets will be classified into which career fields, we describe a linear programming formulation with appealing computational properties that enable it as the core of a decision support tool. We explore methods for measuring and balancing cadets' class standing, Air Force career field requirements, and cadets' career field preferences in the context of this model. Our computational experiments demonstrate the improvement of this method over previous classification approaches, yielding more than 10% increase in the number of cadets assigned to their top career field choice and yielding nearly a 100% reduction in the number of cadets not receiving any of their career field choices. We also explore alternative methods for measuring cadets' career field preferences and demonstrate the positive effect of the new measurement scheme on the overall classification. Because of the short running time of this model, it will serve as a flexible, real-time component of the Academy's classification process. 相似文献
999.
Vivek S. Borkar 《Annals of Operations Research》1991,29(1):429-438
A new state variable is introduced for the problem of controlling a Markov chain under partial observations, which, under a suitably altered probability measure, has a simple evolution. 相似文献
1000.
H. Zhu 《Journal of Optimization Theory and Applications》1992,75(1):155-181
Upon introducing a finite-fuel constraint in a stochastic control system, the convex duality formulation can be set up to represent the original singular control problem as a minimization problem over the space of vector measures at each level of available fuel. This minimization problem is imbedded tightly into a related weak problem, which is actually a mathematical programming problem over a convex,w*-compact space of vector-valued Radon measures. Then, through the Fenchel duality principle, the dual for the finite-fuel control problems is to seek the maximum of smooth subsolutions to a dynamic programming variational inequality. The approach is basically in the spirit of Fleming and Vermes, and the results of this paper extend those of Vinter and Lewis in deterministic control problems to the finite-fuel problems in singular stochastic control. Meanwhile, we also obtain the characterization of the value function as a solution to the dynamic programming variational inequality in the sense of the Schwartz distribution.The author is much indebted to Professor Wendell H. Fleming for his constant support and many helpful discussions during the preparation of this paper. 相似文献