全文获取类型
收费全文 | 19761篇 |
免费 | 2515篇 |
国内免费 | 868篇 |
专业分类
化学 | 2468篇 |
晶体学 | 172篇 |
力学 | 3340篇 |
综合类 | 300篇 |
数学 | 11439篇 |
物理学 | 5425篇 |
出版年
2024年 | 38篇 |
2023年 | 184篇 |
2022年 | 503篇 |
2021年 | 501篇 |
2020年 | 456篇 |
2019年 | 438篇 |
2018年 | 437篇 |
2017年 | 626篇 |
2016年 | 632篇 |
2015年 | 452篇 |
2014年 | 863篇 |
2013年 | 1242篇 |
2012年 | 1108篇 |
2011年 | 957篇 |
2010年 | 904篇 |
2009年 | 1069篇 |
2008年 | 1116篇 |
2007年 | 1268篇 |
2006年 | 1090篇 |
2005年 | 1047篇 |
2004年 | 866篇 |
2003年 | 890篇 |
2002年 | 790篇 |
2001年 | 699篇 |
2000年 | 674篇 |
1999年 | 579篇 |
1998年 | 509篇 |
1997年 | 479篇 |
1996年 | 326篇 |
1995年 | 326篇 |
1994年 | 258篇 |
1993年 | 252篇 |
1992年 | 201篇 |
1991年 | 174篇 |
1990年 | 149篇 |
1989年 | 98篇 |
1988年 | 99篇 |
1987年 | 86篇 |
1986年 | 76篇 |
1985年 | 114篇 |
1984年 | 100篇 |
1983年 | 39篇 |
1982年 | 55篇 |
1981年 | 64篇 |
1980年 | 40篇 |
1979年 | 64篇 |
1978年 | 59篇 |
1977年 | 59篇 |
1976年 | 37篇 |
1974年 | 11篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
By extracting combinatorial structures in well-solved nonlinear combinatorial optimization problems, Murota (1996,1998) introduced the concepts of M-convexity and L-convexity to functions defined over the integer lattice. Recently, Murota–Shioura (2000, 2001) extended these concepts to polyhedral convex functions and quadratic functions in continuous variables. In this paper, we consider a further extension to more general convex functions defined over the real space, and provide a proof for the conjugacy relationship between general M-convex and L-convex functions.Mathematics Subject Classification (1991): 90C10, 90C25, 90C27, 90C35This work is supported by Grant-in-Aid of the Ministry of Education, Culture, Sports, Science and Technology of Japan 相似文献
72.
Many real problems can be modelled as robust shortest path problems on interval digraphs, where intervals represent uncertainty about real costs and a robust path is not too far from the shortest path for each possible configuration of the arc costs.A branch and bound algorithm for this problem is presented. 相似文献
73.
Robust linear optimization under general norms 总被引:1,自引:0,他引:1
We explicitly characterize the robust counterpart of a linear programming problem with uncertainty set described by an arbitrary norm. Our approach encompasses several approaches from the literature and provides guarantees for constraint violation under probabilistic models that allow arbitrary dependencies in the distribution of the uncertain coefficients. 相似文献
74.
Asaf Levin 《Operations Research Letters》2004,32(6):530-534
Consider the following problem: given a ground set and two minimization objectives of the same type find a subset from a given subset-class that minimizes the first objective subject to a budget constraint on the second objective. Using Megiddo's parametric method we improve an earlier weakly polynomial time algorithm. 相似文献
75.
Sufficient conditions are established for the asymptotic behavior of solutionsof nonlinear delay differential equations x′(t)+sum from i=1 to m(pi(t)x(t-т_i))=F(t,x_t),t≥0where 0<т_1<т_2<…<т_m≤r,pi∈C([0,∞)),i=1,2,…,m,F∈C([0,∞)×C_0,R).C_0=C([-r,0],R)equipped with the sup norm ||·|| forsome r>0. A new result is established, some known results are improved. 相似文献
76.
Alvim Adriana C.F. Ribeiro Celso C. Glover Fred Aloise Dario J. 《Journal of Heuristics》2004,10(2):205-229
We propose in this work a hybrid improvement procedure for the bin packing problem. This heuristic has several features: the use of lower bounding strategies; the generation of initial solutions by reference to the dual min-max problem; the use of load redistribution based on dominance, differencing, and unbalancing; and the inclusion of an improvement process utilizing tabu search. Encouraging results have been obtained for a very wide range of benchmark instances, illustrating the robustness of the algorithm. The hybrid improvement procedure compares favourably with all other heuristics in the literature. It improved the best known solutions for many of the benchmark instances and found the largest number of optimal solutions with respect to the other available approximate algorithms. 相似文献
77.
单调优化是指目标函数与约束函数均为单调函数的全局优化问题.本文提出一种新的凸化变换方法把单调函数化为凸函数,进而把单调优化问题化为等价的凸极大或凹极小问题,然后采用Hoffman的外逼近方法来求得问题的全局最优解.我们把这种凸化方法同Tuy的Polyblock外逼近方法作了比较,通过数值比较可以看出本文提出的凸化的方法在收敛速度上明显优于Polyblock方法. 相似文献
78.
79.
Zhu Yongliang; Pagilla Prabhakar R. 《IMA Journal of Mathematical Control and Information》2005,22(2):181-186
We derive some useful and easily computable necessary conditionsfor the existence of a positive semi-definite solution to thealgebraic Ricatti equation (ARE). A motivating example is givento highlight the usefulness of the conditions for controllerand observer designs for nonlinear systems. Further, an upperbound on the trace of the solution to the ARE is also derived. 相似文献
80.
We consider a splitting finite-difference scheme for an initial-boundary value problem for a two-dimensional nonlinear evolutionary
equation. The problem is split into nonlinear and linear parts. The linear part is also split into locally one-dimensional
equations. We prove the convergence and stability of the scheme in L
2 and C norms.
Printed in Lietuvos Matematikos Rinkinys, Vol. 45, No. 3, pp. 413–434, July–September, 2005. 相似文献