全文获取类型
收费全文 | 9963篇 |
免费 | 766篇 |
国内免费 | 283篇 |
专业分类
化学 | 1330篇 |
晶体学 | 31篇 |
力学 | 1103篇 |
综合类 | 145篇 |
数学 | 6808篇 |
物理学 | 1595篇 |
出版年
2024年 | 23篇 |
2023年 | 104篇 |
2022年 | 334篇 |
2021年 | 340篇 |
2020年 | 212篇 |
2019年 | 230篇 |
2018年 | 246篇 |
2017年 | 332篇 |
2016年 | 317篇 |
2015年 | 231篇 |
2014年 | 465篇 |
2013年 | 558篇 |
2012年 | 629篇 |
2011年 | 476篇 |
2010年 | 446篇 |
2009年 | 561篇 |
2008年 | 555篇 |
2007年 | 605篇 |
2006年 | 497篇 |
2005年 | 435篇 |
2004年 | 342篇 |
2003年 | 322篇 |
2002年 | 298篇 |
2001年 | 268篇 |
2000年 | 266篇 |
1999年 | 205篇 |
1998年 | 221篇 |
1997年 | 197篇 |
1996年 | 144篇 |
1995年 | 164篇 |
1994年 | 134篇 |
1993年 | 112篇 |
1992年 | 100篇 |
1991年 | 85篇 |
1990年 | 76篇 |
1989年 | 61篇 |
1988年 | 47篇 |
1987年 | 41篇 |
1986年 | 39篇 |
1985年 | 53篇 |
1984年 | 50篇 |
1983年 | 14篇 |
1982年 | 22篇 |
1981年 | 20篇 |
1980年 | 17篇 |
1979年 | 31篇 |
1978年 | 20篇 |
1977年 | 29篇 |
1976年 | 18篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 10 毫秒
101.
We examine a sequential selection problem in which a single option must be selected. Each option's value is a function of its attributes, whose precise values can be ascertained at a given cost. We prove the optimality of a threshold stopping rule for a general class of objective functions. 相似文献
102.
P. A. V. Ferreira M. E. S. Machado 《Journal of Optimization Theory and Applications》1996,89(3):659-680
Projection and relaxation techniques are employed to decompose a multiobjective problem into a two-level structure. The basic manipulation consists in projecting the decision variables onto the space of the implicit tradeoffs, allowing the definition of a relaxed multiobjective master problem directly in the objective space. An additional subproblem tests the feasibility of the solution encountered by the relaxed problem. Some properties of the relaxed problem (linearity, small number of variables, etc.) render its solution efficient by a number of methods. Representatives of two different classes of multiobjective methods [the Geoffrion, Dyer, Feinberg (GDF) method and the fuzzy method of Baptistella and Ollero] are implemented and applied within this context to a water resources allocation problem. The results attest the computational viability of the overall procedure and its usefulness for the solution of multiobjective problems.This work was partially sponsored by grants from CNPq and FAPESP, Brazil. The authors are indebted to the anonymous reviewers for their valuable comments. 相似文献
103.
Erica L. Plambeck Bor-Ruey Fu Stephen M. Robinson Rajan Suri 《Mathematical Programming》1996,75(2):137-176
In this paper we propose a method for optimizing convex performance functions in stochastic systems. These functions can include
expected performance in static systems and steady-state performance in discrete-event dynamic systems; they may be nonsmooth.
The method is closely related to retrospective simulation optimization; it appears to overcome some limitations of stochastic
approximation, which is often applied to such problems. We explain the method and give computational results for two classes
of problems: tandem production lines with up to 50 machines, and stochastic PERT (Program Evaluation and Review Technique)
problems with up to 70 nodes and 110 arcs.
Sponsored by the National Science Foundation under grant number CCR-9109345, by the Air Force Systems Command, USAF, under
grant numbers F49620-93-1-0068 and F49620-95-1-0222, by the U.S. Army Research Office under grant number DAAL03-92-G-0408,
and by the U.S. Army Space and Strategic Defense Command under contract number DASG60-91-C-0144. The U.S. Government has certain
rights in this material, and is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding
any copyright notation thereon.
Sponsored by a Wisconsin/Hilldale Research Award, by the U.S. Army Space and Strategic Defense Command under contract number
DASG60-91-C-0144, and the Air Force Systems Command, USAF, under grant number F49620-93-1-0068.
Sponsored by the National Science Foundation under grant number DDM-9201813. 相似文献
104.
M. A. Morón C. Romero F. R. Ruiz del Portal 《Journal of Optimization Theory and Applications》1996,91(3):643-649
The purpose of this paper is to seek utility functions satisfying a weak condition which guarantees that the utility optimum always belongs to the compromise set. This set is a special subset of the attainable or feasible set, which is generated through the application of the well-known operational research approach called compromise programming. It is shown that there are large families of utility functions satisfying this condition, thus reinforcing the value of compromise programming as a good surrogate of the traditional utility optimum.Thanks are due to the reviewers for their helpful suggestions. The English editing by Ms. Christine Méndez is appreciated. The authors have been supported by the Comisión Interministerial de Ciencia y Tecnología (CICYT), Madrid, Spain. 相似文献
105.
On the numerical solution of a class of Stackelberg problems 总被引:1,自引:0,他引:1
J. V. Outrata 《Mathematical Methods of Operations Research》1990,34(4):255-277
This study tries to develop two new approaches to the numerical solution of Stackelberg problems. In both of them the tools of nonsmooth analysis are extensively exploited; in particular we utilize some results concerning the differentiability of marginal functions and some stability results concerning the solutions of convex programs. The approaches are illustrated by simple examples and an optimum design problem with an elliptic variational inequality.Prepared while the author was visiting the Department of Mathematics, University of Bayreuth as a guest of the FSP Anwendungsbezogene Optimierung und Steuerung. 相似文献
106.
We study the convergence properties of reduced Hessian successive quadratic programming for equality constrained optimization. The method uses a backtracking line search, and updates an approximation to the reduced Hessian of the Lagrangian by means of the BFGS formula. Two merit functions are considered for the line search: the
1 function and the Fletcher exact penalty function. We give conditions under which local and superlinear convergence is obtained, and also prove a global convergence result. The analysis allows the initial reduced Hessian approximation to be any positive definite matrix, and does not assume that the iterates converge, or that the matrices are bounded. The effects of a second order correction step, a watchdog procedure and of the choice of null space basis are considered. This work can be seen as an extension to reduced Hessian methods of the well known results of Powell (1976) for unconstrained optimization.This author was supported, in part, by National Science Foundation grant CCR-8702403, Air Force Office of Scientific Research grant AFOSR-85-0251, and Army Research Office contract DAAL03-88-K-0086.This author was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under contracts W-31-109-Eng-38 and DE FG02-87ER25047, and by National Science Foundation Grant No. DCR-86-02071. 相似文献
107.
Y. Wardi 《Journal of Optimization Theory and Applications》1990,64(2):399-417
Stochastic algorithms for optimization problems, where function evaluations are done by Monte Carlo simulations, are presented. At each iteratex
i, they draw a predetermined numbern(i) of sample points from an underlying probability space; based on these sample points, they compute a feasible-descent direction, an Armijo stepsize, and the next iteratex
i+1. For an appropriate optimality function , corresponding to an optimality condition, it is shown that, ifn(i) , then (x
i) 0, whereJ is a set of integers whose upper density is zero. First, convergence is shown for a general algorithm prototype: then, a steepest-descent algorithm for unconstrained problems and a feasible-direction algorithm for problems with inequality constraints are developed. A numerical example is supplied. 相似文献
108.
In this paper, we treat a domain optimization problem in which the boundary-value problem is a Neumann problem. In the case where the domain is in a three-dimensional Euclidean space, the first-order and the second-order necessary conditions which the optimal domain must satisfy are derived under a constraint which is the generalization of the requisite of constant volume.Portions of this paper were presented at the 13th IFIP Conference on System Modelling and Optimization, Tokyo, Japan, 1987. 相似文献
109.
This paper describes a numerical realization of an extended continuous Newton method defined by Diener. It traces a connected set of locally one-dimensional trajectories which contains all critical points of a smooth functionf:
n
. The results show that the method is effectively applicable.The authors would like to thank L. C. W. Dixon for pointing out some errors in the original version of this paper and for several suggestions of improvements. 相似文献
110.
R. Horst 《Journal of Optimization Theory and Applications》1989,61(1):143-146
This technical comment refers to the discussion of strong consistency of several bounding procedures in Lemma 2.1 and Proposition 2.1 of Ref. 1. A necessary clarification is given of the notion of convergence q in Lemma 2.1, and a derivation of Proposition 2.1 is presented that includes a new and simple consistency proof of the classical bounding by convex envelopes used in many branch-and-bound procedures. 相似文献