首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   60490篇
  国内免费   960篇
  完全免费   347篇
  数学   61797篇
  2019年   57篇
  2018年   1925篇
  2017年   2007篇
  2016年   1920篇
  2015年   1162篇
  2014年   1735篇
  2013年   2013篇
  2012年   2280篇
  2011年   2376篇
  2010年   2182篇
  2009年   2099篇
  2008年   2174篇
  2007年   1914篇
  2006年   1609篇
  2005年   1408篇
  2004年   1338篇
  2003年   1249篇
  2002年   1296篇
  2001年   1328篇
  2000年   1263篇
  1999年   1172篇
  1998年   1162篇
  1997年   1157篇
  1996年   1155篇
  1995年   1037篇
  1994年   1045篇
  1993年   1020篇
  1992年   1038篇
  1991年   1111篇
  1990年   1005篇
  1989年   960篇
  1988年   808篇
  1987年   882篇
  1986年   875篇
  1985年   817篇
  1984年   845篇
  1983年   185篇
  1982年   1082篇
  1981年   663篇
  1980年   937篇
  1979年   858篇
  1978年   1080篇
  1977年   608篇
  1976年   843篇
  1975年   333篇
  1974年   219篇
  1973年   946篇
  1972年   817篇
  1971年   847篇
  1970年   448篇
  1969年   391篇
  1968年   327篇
  1967年   360篇
  1966年   184篇
  1965年   148篇
  1964年   73篇
  1963年   49篇
  1962年   61篇
  1961年   59篇
  1960年   59篇
  1959年   58篇
  1958年   33篇
  1957年   32篇
  1956年   33篇
  1955年   19篇
  1954年   19篇
  1953年   20篇
  1952年   25篇
  1951年   14篇
  1950年   16篇
  1949年   13篇
  1948年   18篇
  1939年   10篇
  1937年   9篇
  1936年   19篇
  1935年   10篇
  1933年   8篇
  1931年   14篇
  1930年   14篇
  1929年   10篇
  1928年   10篇
  1927年   8篇
  1926年   13篇
  1922年   8篇
  1912年   8篇
  1896年   9篇
  1894年   9篇
  1890年   9篇
  1887年   14篇
  1886年   8篇
  1881年   9篇
  1880年   17篇
  1879年   7篇
  1878年   11篇
  1877年   11篇
  1873年   8篇
  1872年   12篇
  1871年   13篇
  1870年   10篇
  1869年   12篇
排序方式: 共有61797条查询结果,搜索用时 62 毫秒
1.
Factoring polynomials with rational coefficients   总被引:55,自引:0,他引:55  
2.
E-Convex Sets, E-Convex Functions, and E-Convex Programming   总被引:33,自引:0,他引:33  
A class of sets and a class of functions called E-convex sets and E-convex functions are introduced by relaxing the definitions of convex sets and convex functions. This kind of generalized convexity is based on the effect of an operator E on the sets and domain of definition of the functions. The optimality results for E-convex programming problems are established.  相似文献
3.
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples   总被引:27,自引:0,他引:27  
Compressive sampling offers a new paradigm for acquiring signals that are compressible with respect to an orthonormal basis. The major algorithmic challenge in compressive sampling is to approximate a compressible signal from noisy samples. This paper describes a new iterative recovery algorithm called CoSaMP that delivers the same guarantees as the best optimization-based approaches. Moreover, this algorithm offers rigorous bounds on computational cost and storage. It is likely to be extremely efficient for practical problems because it requires only matrix–vector multiplies with the sampling matrix. For compressible signals, the running time is just O(Nlog2N), where N is the length of the signal.  相似文献
4.
The boundary correspondence under quasiconformal mappings   总被引:25,自引:0,他引:25  
5.
In this paper, we present sufficient optimality conditions and duality results for a class of nonlinear fractional programming problems. Our results are based on the properties of sublinear functionals and generalized convex functions.  相似文献
6.
Efficient Arithmetic on Koblitz Curves   总被引:24,自引:0,他引:24  
It has become increasingly common to implement discrete-logarithm based public-key protocols on elliptic curves over finite fields. The basic operation is scalar multiplication: taking a given integer multiple of a given point on the curve. The cost of the protocols depends on that of the elliptic scalar multiplication operation.Koblitz introduced a family of curves which admit especially fast elliptic scalar multiplication. His algorithm was later modified by Meier and Staffelbach. We give an improved version of the algorithm which runs 50 than any previous version. It is based on a new kind of representation of an integer, analogous to certain kinds of binary expansions. We also outline further speedups using precomputation and storage.  相似文献
7.
Generalized Benders decomposition   总被引:23,自引:0,他引:23  
J. F. Benders devised a clever approach for exploiting the structure of mathematical programming problems withcomplicating variables (variables which, when temporarily fixed, render the remaining optimization problem considerably more tractable). For the class of problems specifically considered by Benders, fixing the values of the complicating variables reduces the given problem to an ordinary linear program, parameterized, of course, by the value of the complicating variables vector. The algorithm he proposed for finding the optimal value of this vector employs a cutting-plane approach for building up adequate representations of (i) the extremal value of the linear program as a function of the parameterizing vector and (ii) the set of values of the parameterizing vector for which the linear program is feasible. Linear programming duality theory was employed to derive the natural families ofcuts characterizing these representations, and the parameterized linear program itself is used to generate what are usuallydeepest cuts for building up the representations.In this paper, Benders' approach is generalized to a broader class of programs in which the parametrized subproblem need no longer be a linear program. Nonlinear convex duality theory is employed to derive the natural families of cuts corresponding to those in Benders' case. The conditions under which such a generalization is possible and appropriate are examined in detail. An illustrative specialization is made to the variable factor programming problem introduced by R. Wilson, where it offers an especially attractive approach. Preliminary computational experience is given.Communicated by A. V. BalakrishnanAn earlier version was presented at the Nonlinear Programming Symposium at the University of Wisconsin sponsored by the Mathematics Research Center, US Army, May 4–6, 1970. This research was supported by the National Science Foundation under Grant No. GP-8740.  相似文献
8.
Necessary and sufficient conditions in constrained optimization   总被引:22,自引:0,他引:22  
Additional conditions are attached to the Kuhn-Tucker conditions giving a set of conditions which are both necessary and sufficient for optimality in constrained optimization, under appropriate constraint qualifications. Necessary and sufficient conditions are also given for optimality of the dual problem. Duality and converse duality are treated accordingly.  相似文献
9.
The cascadic multigrid method for elliptic problems   总被引:22,自引:0,他引:22  
Summary. The paper deals with certain adaptive multilevel methods at the confluence of nested multigrid methods and iterative methods based on the cascade principle of [10]. From the multigrid point of view, no correction cycles are needed; from the cascade principle view, a basic iteration method without any preconditioner is used at successive refinement levels. For a prescribed error tolerance on the final level, more iterations must be spent on coarser grids in order to allow for less iterations on finer grids. A first candidate of such a cascadic multigrid method was the recently suggested cascadic conjugate gradient method of [9], in short CCG method, whichused the CG method as basic iteration method on each level. In [18] it has been proven, that the CCG method is accurate with optimal complexity for elliptic problems in 2D and quasi-uniform triangulations. The present paper simplifies that theory and extends it to more general basic iteration methods like the traditional multigrid smoothers. Moreover, an adaptive control strategy for the number of iterations on successive refinement levels for possibly highly non-uniform grids is worked out on the basis of a posteriori estimates. Numerical tests confirm the efficiency and robustness of the cascadic multigrid method. Received November 12, 1994 / Revised version received October 12, 1995  相似文献
10.
Convergence of an annealing algorithm   总被引:21,自引:0,他引:21  
The annealing algorithm is a stochastic optimization method which has attracted attention because of its success with certain difficult problems, including NP-hard combinatorial problems such as the travelling salesman, Steiner trees and others. There is an appealing physical analogy for its operation, but a more formal model seems desirable. In this paper we present such a model and prove that the algorithm converges with probability arbitrarily close to 1. We also show that there are cases where convergence takes exponentially long—that is, it is no better than a deterministic method. We study how the convergence rate is affected by the form of the problem. Finally we describe a version of the algorithm that terminates in polynomial time and allows a good deal of practical confidence in the solution.  相似文献
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号