全文获取类型
收费全文 | 10659篇 |
免费 | 284篇 |
国内免费 | 192篇 |
专业分类
化学 | 250篇 |
晶体学 | 1篇 |
力学 | 390篇 |
综合类 | 69篇 |
数学 | 9610篇 |
物理学 | 815篇 |
出版年
2023年 | 45篇 |
2022年 | 92篇 |
2021年 | 115篇 |
2020年 | 181篇 |
2019年 | 204篇 |
2018年 | 182篇 |
2017年 | 189篇 |
2016年 | 170篇 |
2015年 | 181篇 |
2014年 | 475篇 |
2013年 | 887篇 |
2012年 | 550篇 |
2011年 | 510篇 |
2010年 | 498篇 |
2009年 | 663篇 |
2008年 | 695篇 |
2007年 | 726篇 |
2006年 | 465篇 |
2005年 | 361篇 |
2004年 | 301篇 |
2003年 | 280篇 |
2002年 | 284篇 |
2001年 | 249篇 |
2000年 | 261篇 |
1999年 | 210篇 |
1998年 | 189篇 |
1997年 | 170篇 |
1996年 | 207篇 |
1995年 | 194篇 |
1994年 | 144篇 |
1993年 | 156篇 |
1992年 | 136篇 |
1991年 | 125篇 |
1990年 | 115篇 |
1989年 | 74篇 |
1988年 | 96篇 |
1987年 | 67篇 |
1986年 | 88篇 |
1985年 | 114篇 |
1984年 | 85篇 |
1983年 | 26篇 |
1982年 | 57篇 |
1981年 | 48篇 |
1980年 | 43篇 |
1979年 | 35篇 |
1978年 | 54篇 |
1977年 | 57篇 |
1976年 | 34篇 |
1975年 | 15篇 |
1974年 | 12篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
1.
2.
3.
M. M. Kostreva 《Journal of Optimization Theory and Applications》1989,62(1):63-76
Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments. 相似文献
4.
Dean A. Carlson 《Journal of Mathematical Analysis and Applications》2002,276(2):561-588
The method of equivalent variational methods, originally due to Carathéodory for free problems in the calculus of variations is extended to investigate feedback Nash equilibria for a class of n-person differential games. Both the finite-horizon and infinite-horizon cases are considered. Examples are given to illustrate the presented results. 相似文献
5.
Mikhail Andramonov 《Journal of Global Optimization》2002,24(2):115-132
We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency. 相似文献
6.
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. 相似文献
7.
José E. Valdés 《Operations Research Letters》2006,34(1):49-52
Components C1 and C2 form a series system. Suppose we can allocate the spare R1 in parallel with C1 and the spare R2 in parallel with C2, or otherwise, allocate R1 with C2 and R2 with C1. In this paper, we compare these two options using hazard rate ordering. 相似文献
8.
Boban Marinković 《Mathematical Methods of Operations Research》2006,63(3):513-524
We present local sensitivity analysis for discrete optimal control problems with varying endpoints in the case when the customary regularity of boundary conditions can be violated. We study the behavior of the optimal solutions subject to parametric perturbations of the problem. 相似文献
9.
We consider the problem of maximizing a linear fractional function on the Pareto efficient frontier of two other linear fractional functions. We present a finite pivoting-type algorithm that solves the maximization problem while computing simultaneously the efficient frontier. Application to multistage efficiency analysis is discussed. An example demonstrating the computational procedure is included. 相似文献
10.
Fabio Schoen 《Journal of Global Optimization》1991,1(3):207-228
In this paper stochastic algorithms for global optimization are reviewed. After a brief introduction on random-search techniques, a more detailed analysis is carried out on the application of simulated annealing to continuous global optimization. The aim of such an analysis is mainly that of presenting recent papers on the subject, which have received only scarce attention in the most recent published surveys. Finally a very brief presentation of clustering techniques is given. 相似文献