全文获取类型
收费全文 | 25581篇 |
免费 | 1550篇 |
国内免费 | 1217篇 |
专业分类
化学 | 1738篇 |
晶体学 | 32篇 |
力学 | 1152篇 |
综合类 | 185篇 |
数学 | 7513篇 |
物理学 | 1725篇 |
综合类 | 16003篇 |
出版年
2024年 | 156篇 |
2023年 | 364篇 |
2022年 | 726篇 |
2021年 | 746篇 |
2020年 | 644篇 |
2019年 | 594篇 |
2018年 | 582篇 |
2017年 | 711篇 |
2016年 | 752篇 |
2015年 | 746篇 |
2014年 | 1423篇 |
2013年 | 1355篇 |
2012年 | 1656篇 |
2011年 | 1669篇 |
2010年 | 1307篇 |
2009年 | 1446篇 |
2008年 | 1426篇 |
2007年 | 1735篇 |
2006年 | 1471篇 |
2005年 | 1228篇 |
2004年 | 1009篇 |
2003年 | 870篇 |
2002年 | 766篇 |
2001年 | 666篇 |
2000年 | 594篇 |
1999年 | 453篇 |
1998年 | 469篇 |
1997年 | 395篇 |
1996年 | 317篇 |
1995年 | 298篇 |
1994年 | 242篇 |
1993年 | 242篇 |
1992年 | 207篇 |
1991年 | 188篇 |
1990年 | 154篇 |
1989年 | 147篇 |
1988年 | 123篇 |
1987年 | 81篇 |
1986年 | 57篇 |
1985年 | 63篇 |
1984年 | 57篇 |
1983年 | 16篇 |
1982年 | 27篇 |
1981年 | 21篇 |
1980年 | 18篇 |
1979年 | 35篇 |
1978年 | 21篇 |
1977年 | 30篇 |
1976年 | 18篇 |
1955年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
We consider the Stackelberg problem corresponding to a two-player game in which one of the two players has the leadership in playing the game. We present a general approach for approximating the considered hierarchical programming problem by a sequence of two-level optimization problems. From a practical point of view, we also give some results for asymptotically Stackelberg approximating sequences and for problems with perturbed constraints.This paper is based upon results first presented at Journées Fermat: Mathematics for Optimization, Toulouse, France, May 1985. 相似文献
992.
The annealing algorithm (Ref. 1) is modified to allow for noisy or imprecise measurements of the energy cost function. This is important when the energy cannot be measured exactly or when it is computationally expensive to do so. Under suitable conditions on the noise/imprecision, it is shown that the modified algorithm exhibits the same convergence in probability to the globally minimum energy states as the annealing algorithm (Ref. 2). Since the annealing algorithm will typically enter and exit the minimum energy states infinitely often with probability one, the minimum energy state visited by the annealing algorithm is usually tracked. The effect of using noisy or imprecise energy measurements on tracking the minimum energy state visited by the modified algorithms is examined.The research reported here has been supported under Contracts AFOSR-85-0227, DAAG-29-84-K-0005, and DAAL-03-86-K-0171 and a Purdue Research Initiation Grant. 相似文献
993.
P. S. Szczepaniak 《Journal of Optimization Theory and Applications》1989,63(3):459-468
This paper deals with dynamic systems described by nonlinear differential-difference equations of retarded type. The problem considered is to determine the initial function and certain system parameters which minimize a given cost functional. A computational method is presented and some convergence results are given. Numerical examples of linear and nonlinear systems are also included. 相似文献
994.
We describe a new algorithm which uses the trajectories of a discrete dynamical system to sample the domain of an unconstrained objective function in search of global minima. The algorithm is unusually adept at avoiding nonoptimal local minima and successfully converging to a global minimum. Trajectories generated by the algorithm for objective functions with many local minima exhibit chaotic behavior, in the sense that they are extremely sensitive to changes in initial conditions and system parameters. In this context, chaos seems to have a beneficial effect: failure to converge to a global minimum from a given initial point can often be rectified by making arbitrarily small changes in the system parameters. 相似文献
995.
Y. Wardi 《Journal of Optimization Theory and Applications》1989,61(3):473-485
A stochastic algorithm for finding stationary points of real-valued functions defined on a Euclidean space is analyzed. It is based on the Robbins-Monro stochastic approximation procedure. Gradient evaluations are done by means of Monte Carlo simulations. At each iteratex
i
, one sample point is drawn from an underlying probability space, based on which the gradient is approximated. The descent direction is against the approximation of the gradient, and the stepsize is 1/i. It is shown that, under broad conditions, w.p.1 if the sequence of iteratesx
1,x
2,...generated by the algorithm is bounded, then all of its accumulation points are stationary. 相似文献
996.
Any global minimization algorithm is made by several local searches performed sequentially. In the classical multistart algorithm, the starting point for each new local search is selected at random uniformly in the region of interest. In the tunneling algorithm, such a starting point is required to have the same function value obtained by the last local minimization. We introduce the class of acceptance-rejection based algorithms in order to investigate intermediate procedures. A particular instance is to choose at random the new point approximately according to a Boltzmann distribution, whose temperatureT is updated during the algorithm. AsT 0, such distribution peaks around the global minima of the cost function, producing a kind of random tunneling effect. The motivation for such an approach comes from recent works on the simulated annealing approach in global optimization. The resulting algorithm has been tested on several examples proposed in the literature. 相似文献
997.
Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations 总被引:5,自引:0,他引:5
A. A. Brown M. C. Bartholomew-Biggs 《Journal of Optimization Theory and Applications》1989,62(2):211-224
In this paper, we review briefly some methods for minimizing a functionF(x), which proceed by follwoing the solution curve of a system of ordinary differential equations. Such methods have often been thought to be unacceptably expensive; but we show, by means of extensive numerical tests, using a variety of algorithms, that the ODE approach can in fact be implemented in such a way as to be more than competitive with currently available conventional techniques.This work was supported by a SERC research studentship for the first author. Both authors are indebted to Dr. J. J. McKeown and Dr. K. D. Patel of SCICON Ltd, the collaborating establishment, for their advice and encouragement. 相似文献
998.
Consider first passage percolation on with passage times given by i.i.d. random variables with common distribution F. Let be the time from u to v for a path π and the minimal time among all paths from u to v. We ask whether or not there exist points and a semi‐infinite path such that for all n. Necessary and sufficient conditions on F are given for this to occur. When the support of F is unbounded, we also obtain results on the number of edges with large passage time used by geodesics. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 47, 414–423, 2015 相似文献
999.
We present a multispecies stochastic model that suggests optimal fishing policy for two species in a three‐species predator–prey ecosystem in the Barents Sea. We employ stochastic dynamic programming to solve a three‐dimensional model, in which the catch is optimized by using a multispecies feedback strategy. Applying the model to the cod, capelin, and herring ecosystem in the Barents Sea shows that the optimal catch for the stochastic interaction model is more conservative than that implied by the deterministic model. We also find that stochasticity has a stronger effect on the optimal exploitation policy for prey (capelin) than for predator (cod). 相似文献
1000.