全文获取类型
收费全文 | 14986篇 |
免费 | 1266篇 |
国内免费 | 705篇 |
专业分类
化学 | 3128篇 |
晶体学 | 49篇 |
力学 | 1361篇 |
综合类 | 237篇 |
数学 | 9391篇 |
物理学 | 2791篇 |
出版年
2024年 | 22篇 |
2023年 | 156篇 |
2022年 | 317篇 |
2021年 | 475篇 |
2020年 | 332篇 |
2019年 | 372篇 |
2018年 | 405篇 |
2017年 | 496篇 |
2016年 | 509篇 |
2015年 | 362篇 |
2014年 | 738篇 |
2013年 | 1042篇 |
2012年 | 836篇 |
2011年 | 799篇 |
2010年 | 686篇 |
2009年 | 870篇 |
2008年 | 900篇 |
2007年 | 973篇 |
2006年 | 806篇 |
2005年 | 732篇 |
2004年 | 569篇 |
2003年 | 554篇 |
2002年 | 483篇 |
2001年 | 412篇 |
2000年 | 402篇 |
1999年 | 318篇 |
1998年 | 350篇 |
1997年 | 280篇 |
1996年 | 221篇 |
1995年 | 216篇 |
1994年 | 182篇 |
1993年 | 151篇 |
1992年 | 130篇 |
1991年 | 109篇 |
1990年 | 91篇 |
1989年 | 91篇 |
1988年 | 71篇 |
1987年 | 56篇 |
1986年 | 51篇 |
1985年 | 78篇 |
1984年 | 58篇 |
1983年 | 20篇 |
1982年 | 36篇 |
1981年 | 28篇 |
1980年 | 30篇 |
1979年 | 36篇 |
1978年 | 23篇 |
1977年 | 34篇 |
1976年 | 22篇 |
1957年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
51.
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. 相似文献
52.
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. 相似文献
53.
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. 相似文献
54.
单调优化是指目标函数与约束函数均为单调函数的全局优化问题.本文提出一种新的凸化变换方法把单调函数化为凸函数,进而把单调优化问题化为等价的凸极大或凹极小问题,然后采用Hoffman的外逼近方法来求得问题的全局最优解.我们把这种凸化方法同Tuy的Polyblock外逼近方法作了比较,通过数值比较可以看出本文提出的凸化的方法在收敛速度上明显优于Polyblock方法. 相似文献
55.
56.
I. Peshko G. Galich M. Lopiychuk A. Khizhnyak V. Nakvasuk 《Optics & Laser Technology》1997,29(4):211-215
A laser system containing four CW Nd:YAG double-rod lasers, transforming optics and a fibre with input-output optics has been designed and investigated. It is shown that reduction of the beam parameter product of the non-Gaussian beams in the image space of the lens has made it possible to collect the emission of four lasers to the same fibre. Independent laser operation has provided the output power control in the range of 10–900 W with a stable light spot size on the input end of the fibre. 相似文献
57.
Gabriele Bonanno 《Journal of Global Optimization》1998,12(1):101-104
In this note we introduce a suitable class of functionals, including the class of integral functionals, and prove that any (strict) local minimum of a functional of this class, defined on a decomposable space, is a (strict) global minimum. So, the recent result obtained by Giner in [1] is specified and extended. 相似文献
58.
This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms. 相似文献
59.
Arno Jüschke Johannes Jahn Andreas Kirsch 《Computational Optimization and Applications》1997,7(3):261-276
In this paper we consider a special optimization problem withtwo objectives which arises in antenna theory. It is shown that thisabstract bicriterial optimization problem has at least one solution.Discretized versions of this problem are also discussed, and therelationships between these finite dimensional problems and the infinitedimensional problem are investigated. Moreover, we presentnumerical results for special parameters using a multiobjectiveoptimization method. 相似文献
60.
多级制造系统是现代制造业的主要加工方式,系统的每一级的加工速度和加工周期是系统设计的主要决策变量,正确确定这两个变量是系统得到优化的主要目标。本文导出了系统优化的基本模型,它包括系统各级的生产时间、等待时间、生产速度、生产成本以及系统的循环时间、总成本、产品利润和利润率等,并给出了一个应用实例。 相似文献